Pruning algorithms to determine reliable paths on networks with random and correlated link travel times
Year of publication: |
January-February 2018
|
---|---|
Authors: | Prakash, A. Arun ; Srinivasan, Karthik K. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 52.2018, 1, p. 80-101
|
Subject: | travel time reliability | robust-cost | optimal reliable path | most reliable path | minimum robust-cost path | K-best reliable paths | travel time correlations | Transportzeit | Travel time | Theorie | Theory | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem |
-
Shen, Liang, (2020)
-
Optimizing road network daily maintenance operations with stochastic service and travel times
Chen, Lu, (2014)
-
Models and algorithms for stochastic and robust vehicle routing with deadlines
Adulyasak, Yossiri, (2016)
- More ...
-
Prakash, A. Arun, (2017)
-
Prakash, A. Arun, (2020)
-
YamÃn, Daniel, (2022)
- More ...