Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

European Journal of Operational Research

Volumn 236, Issue 3, 2014, Pages 915-923

  Wen, Liang ^a   Çatay, Bülent ^b   Eglese, Richard ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b SABANCI UNIVERSITY   (Turkey)

Author keywords

Congestion charge; Heuristic; Minimum cost path; Time varying

Indexed keywords

HEURISTIC METHODS; TRAFFIC CONTROL;

BENCHMARK DATASETS; CONGESTION CHARGES; EXACT METHODS; HEURISTIC; MINIMUM COST PATHS; REAL TRAFFIC; RUNNING TIME; TIME VARYING;

COSTS;

EID: 84897913491     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.10.044     Document Type: Article

References (24)

1. T. Bektas, and G. Laporte The pollution-routing problem Transportation Research Part B: Methodological 45 2011 1232 1250
2. I. Chabini Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time Transportation Research Record 1645 1998 170 175
3. T.S. Chang, L.H. Nozick, and M.A. Turnquist Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments Transportation Science 39 2005 383 399
4. R.K. Cheung Iterative methods for dynamic stochastic shortest path problems Naval Research Logistics 45 1998 769 789
5. K.L. Cooke, and E. Halsey The shortest route through a network with time-dependent intermodal transit times Journal of Mathematical Analysis and Applications 14 1966 493 498
6. R. Eglese, and D. Black Optimizing the routeing of vehicles A. Mckinnon, A. Whiteing, M. Browne, Green logistics: Improving the environmental sustainability of logistics 2012 Kogan Page London, UK 23 235
7. R. Eglese, W. Maden, and A. Slater Road Timetable (TM) to aid vehicle routing and scheduling Computers and Operations Research 33 2006 3508 3519
8. E. Erkut, S.A. Tjandra, and V. Verter Hazardous materials transportation C. Barnhart, G. Laporte, Handbooks in Operations Research and Management Science 2007 Elsevier (Vol. 14, pp. 539-621)
9. L. Fu, and L.R. Rilett Expected shortest paths in dynamic and stochastic traffic networks Transportation Research Part B - Methodological 32 1998 499 516
10. G. Gallo, and S. Pallotino Shortest paths algorithms Annals of Operational Research 13 1988 3 79
11. R. Hall The fastest path through a network with random time-dependent travel times Transportation Science 20 1986 182 186
12. A.V. Hill, and W.C. Benton Modelling intra-city time-dependent travel speeds for vehicle scheduling problems Journal of the Operational Research Society 43 1992 343 351
13. H. Huang, and S. Gao Optimal paths in dynamic networks with dependent random link travel times Transportation Research Part B - Methodological 46 2012 579 598
14. S. Ichoua, M. Gendreau, and J.Y. Potvin Vehicle dispatching with time-dependent travel times European Journal of Operational Research 144 2003 379 396
15. E.D. Miller-Hooks, and H.S. Mahmassani Least possible time paths in stochastic, time-varying networks Computers and Operations Research 25 1998 1107 1125
16. E.D. Miller-Hooks, and H.S. Mahmassani Least expected time paths in stochastic, time-varying transportation networks Transportation Science 34 2000 198 215
17. E. Miller-Hooks, and H. Mahmassani Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks European Journal of Operational Research 146 2003 67 82
18. E. Miller-Hooks, and B. Yang Updating paths in time-varying networks given arc weight changes Transportation Science 39 2005 451 464
19. National Atmopheric Emissions Inventory. (2003). Emission factors database [Online]. < http://naei.defra.gov.uk/ > Accessed 10.04.13.
20. S. Pallottino, and M.G. Scutella Shortest path algorithms in transportation models: classical and innovative aspects P. Marcotte, S. Nguyen, Equilibrium and advanced transportation modelling 1998 Kluwer Academic Publishers Boston, MA 45 281
21. U. Pape Implementation and efficiency of moore-algorithms for the shortest route problem Mathematical Programming 7 1974 212 222
22. D. Pretolani A directed hypergraph model for random time dependent shortest paths European Journal of Operational Research 123 2000 315 324
23. K. Sung, M.G.H. Bell, M. Seong, and S. Park Shortest paths in a network with time-dependent flow speeds European Journal of Operational Research 121 2000 32 39
24. A.K. Ziliaskopoulos, and H.S. Mahmassani Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications Transportation Research Record 1408 1993 94 100