Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
Year of publication: |
June 2018
|
---|---|
Authors: | Fu, Lunce ; Dessouky, Maged |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 21.2018, 3, p. 367-386
|
Subject: | Train routing | State-dependent shortest path problem | NP-hard | Heuristics | Tourenplanung | Vehicle routing problem | Theorie | Theory | Heuristik | Algorithmus | Algorithm |
-
Liu, Liang, (2017)
-
DomÃnguez, Oscar, (2014)
-
Poonthalir, Ganesan, (2015)
- More ...
-
Ambiguity in risk preferences in robust stochastic optimization
Haskell, William B., (2016)
-
The multi-shift vehicle routing problem with overtime
Ren, Yingtao, (2010)
-
A model and algorithm for the courier delivery problem with uncertainty
Sungur, Ilgaz, (2010)
- More ...