Algorithms for time-dependent bicriteria shortest path problems

Discrete Optimization

Volumn 3, Issue 3, 2006, Pages 238-254

  Hamacher, Horst W ^a   Ruzika, Stefan ^a   Tjandra, Stevanus A ^b  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Bicriteria shortest path problem; Label setting algorithm; Multiple criteria optimization; Time dependent shortest path problem

Indexed keywords

ALGORITHMIC LANGUAGES; ALGORITHMS; DATA PROCESSING; NUMERICAL ANALYSIS;

BICRITERIA SHORTEST PATH PROBLEM; LABEL SETTING ALGORITHM; MULTIPLE CRITERIA OPTIMIZATION; TIME-DEPENDENT SHORTEST PATH PROBLEM;

PROBLEM SOLVING;

EID: 33746367753     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.05.006     Document Type: Article

References (28)

1. Ahuja R., Magnanti T., and Orlin J. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall, Englewood Cliffs, New Jersey
2. Ahuja R., Orlin J., Pallottino S., and Scutella M. Dynamic shortest paths minimizing travel times and costs. Networks 41 (2003) 197-205
3. Bellman R.E. On a routing problem. Quarterly of Applied Mathematics 16 (1958) 87-90
4. Bertesekas D. Linear Network Optimization: Algorithms and Codes (1991), M.I.T. Press, Cambridge, MA
5. Brumbaugh-Smith J., and Shier D. An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43 (1989) 216-224
6. Chabini I. Discrete dynamic shortest path problems in transportation applications. Transportation Research Record 1645 (1998) 8170-8175
7. Cooke K., and Halsey E. The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications 14 (1966) 493-498
8. Corley H., and Moon I. Shortest paths in networks with vector weights. Journal of Optimization Theory and Applications 46 (1985) 79-86
9. Dreyfus S. An appraisal of some shortest-path algorithms. Operations Research 17 (1969) 395-412
10. In: Ehrgott M., and Gandibleux X. (Eds). Multiple Criteria Optimization. State of the Art Annotated Bibliographic Surveys (2002), Kluwer, Boston
11. Getachew T., Kostreva M., and Lancaster L. A generalization of dynamic programming for Pareto optimization in dynamic networks. RAIRO Operation Research 34 (2000) 27-47
12. Hamacher H.W., and Tjandra S.A. Mathematical modeling of evacuation problems: a state of the art. In: Schreckenberg M., and Sharma S. (Eds). Pedestrian and Evacuation Dynamics (2002), Springer-Verlag, Berlin 227-266
13. Hansen P. Bicriterion path problems. In: Fandel G., and Gal T. (Eds). Multiple Criteria Decision Making: Theory and Applications. Lecture Notes in Economics and Mathematical Systems vol. 177 (1980), Springer-Verlag, Berlin 109-127
14. Klingman D., Napier A., and Stutz J. NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Management Science 20 5 (1974) 814-821
15. Kostreva M., and Wiecek M. Time dependency in multiple objective dynamic programming. Journal of Mathematical Analysis and Application 173 1 (1993) 289-307
16. Martins E. On a multicriteria shortest path problem. European Journal of Operational Research 16 (1984) 236-245
17. R.H. Möhring, Verteilte Verbindungssuche im öffentlichen Personennahverkehr: Graphentheoretische Modelle und Algortihmen, Technical Report 624-1999, Technische Universität Berlin, 1999
18. M. Müller-Hannemann, M. Schnee, Finding all attractive train connections by multi-criteria Pareto search, in: Proceedings of the 4th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2004, Bergen, Norway, in: Lecture Notes in Computer Science, Springer (in press)
19. Orda A., and Rom R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM 37 3 (1990) 607-625
20. Orda A., and Rom R. Minimum weight paths in time-dependent networks. Networks 21 3 (1991) 295-320
21. S. Pallottino, M. Scutella, Shortest path algorithms in transportation models: classical and innovative aspects, Technical Report 97-06, University of Pisa, Pisa, Italy, 1997
22. Philpott A. Continuous-time shortest path problems and linear programming. SIAM Journal on Control and Optimization 32 2 (1994) 538-552
23. Philpott A., and Mees A. A finite algorithm for shortest path problems with time-varying costs. Applied Mathematics Letters 6 2 (1993) 91-94
24. Schrijver A. Combinatorial Optimization. Polyhedra and Efficiency (2003), Springer, Berlin, Heidelberg
25. S.A. Tjandra, Dynamic network optimization with application to the evacuation problem, Ph.D. Thesis, Technische Universität Kaiserslautern, Kaiserslautern, Germany, 2003
26. Wardell W., and Ziliaskopoulos A. A intermodal optimum path algorithm for dynamic multimodal networks. European Journal of Operational Research 125 (2000) 486-502
27. Yamada T. A network approach to a city emergency evacuation planning. International Journal of Systems Science 27 10 (1996) 931-936
28. Ziliaskopoulos A., and Mahmassani H. Time-dependent shortest path algorithm for real-time intelligent vehicle/highway system. Transportation Research Record 1408 (1993) 94-104