Labeling methods for the general case of the multi-objective shortest path problem – A computational study

Intelligent Systems, Control and Automation: Science and Engineering

Volumn 61, Issue , 2013, Pages 489-502

  Paixao J M ^a   Santos, J L ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Combinatorial optimization; Labeling algorithm; Multiple objective programming; Non dominated path; Shortest path problem

Indexed keywords

EID: 84989967741     PISSN: 22138986     EISSN: 22138994     Source Type: Book Series    
DOI: 10.1007/978-94-007-4722-7_46     Document Type: Chapter

References (21)

1. Ahuja R, Magnanti TL, Orlin J (1993) Network flows – theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River
2. Bellman R (1958) On a routing problem. Q Appl Math 16:87–90
3. Cherkassky BV, Goldberg AV, Radzik T (1993) Shortest paths algorithms: theory and experimental evaluation. Math Program 73:129–174
4. Deo N, Pang C (1984) Shortest path algorithms: taxonomy and annotation. Networks 14(2): 275–323
5. Dial R (1969) Algorithm 360: shortest path forest with topological ordering. Commun ACM 12:632–633
6. Dial R et al (1979) A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9:215–348
7. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
8. Ehrgott M (1997) Multiple criteria optimization – classification and methodology. Shaker Verlag, Aachen
9. Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22:425–460
10. Ehrgott M, Gandibleux X (2002) Multiple criteria optimization: state of the art annotated bibliographic survey. Kluwer Academic Publishers, Boston
11. Ford J, Fulkerson D (1962) Flows in networks. Princeton University Press, Princeton
12. Gallo G, Pallotino S (1988) Shortest path methods. Ann Oper Res 13:3–79
13. Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J Optim Theory Appl 111:589–613
14. Hansen P (1980) Bicriterion path problems, In: Fandel G, Gal T (eds) Multiple criteria decision making: theory and application. Lectures notes in economics and mathematical systems, vol 177. Springer, Heidelberg, pp 109–127
15. Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 16:236–245
16. Moore E (1959) The shortest path through a maze. In: Proceedings of the international symposium on the theory of switching. Harvard University Press, pp 285–292
17. Pape U (1974) Implementation and efficiency of Moore-algorithms for the shortest route problem. Math Program 7:212–222
18. Pape U (1980) Algorithm 562: shortest paths lengths. ACM Trans Math Softw 6:450–455
19. Santos J (2003) Optimização vectorial em redes. Ph.D. thesis, Departamento de Matemática, Universidade de Coimbra
20. Santos J, Paixão J, Rosa M (2005) A statistical analysis on the number of non-dominated paths in the multiobjective shortest path problem. In: Proceedings international network optimization conference, Lisbon, Portugal, pp 21–23
21. Vincke P (1974) Problèmes multicritères. Cahiers du Centre d’Études de Recherche Opérationelle 16:425–439