Label correcting methods to solve multicriteria shortest path problems

Journal of Optimization Theory and Applications

Volumn 111, Issue 3, 2001, Pages 589-613

  Guerriero, F ^a   Musmanno, R ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF SALENTO   (Italy)

Author keywords

Label correcting methods; Multicriteria shortest path problem; Pareto optimal solutions; Principle of optimality

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

LABEL CORRECTING METHOD; LABEL-CORRECTING; LABELING METHODS; MULTI-CRITERIA; MULTICRITERIUM SHORT PATH PROBLEM; OPTIMAL PATH LENGTHS; PARETO OPTIMAL PATHS; PARETO OPTIMAL SOLUTIONS; PRINCIPLE OF OPTIMALITY; SHORTEST PATH PROBLEM;

PARETO PRINCIPLE;

EID: 0035527944     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012602011914     Document Type: Article

References (28)

1. 1. BATTA, R., and CHIU, S. S., Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials, Operations Research, Vol. 36, pp. 84-92, 1988.
2. 2. ANTUNES, C. H., CRAVEIIRINHA, J., CLIḾACO, J., and BARRICO, C., Multiple-Objective Routing in Integrated Communication Networks, Teletraffic Engineering in a Competitive World, Edited by D. Smith and P. Key, Elsevier, Amsterdam, Holland, Vol. 3b, pp. 1291-1300, 1999.
3. 3. CURRENT, J. R., REVELLE, C. S., and COHON, J. L., The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks, Transportation Science. Vol. 21, pp. 490-503, 1987.
4. 4. CURRENT, J. R., and MIN, H., Multiobjective Design of Transportation Net works: Taxonomy and Annotation, European Journal of Operational Research, Vol. 26, 1986.
5. 5. CURRENT, J. R., and MARSH, M., Multiobjective Transportation Network Design and Routing Problems: Taxonomy and Annotation, European Journal of Operational Research, Vol. 103, pp. 426-438, 1993.
6. 6. GAREY, M., and JOHNSON, D., Computers and Intractability: A Guide to the Theory of NP-Completness, Freeman, San Francisco, California, 1979.
7. 7. COHON, J. L., Multiobjective Programming and Planning, Academic Press, New York, NY, 1978.
8. 8. VINCKE, P., Problèmes Multicritères, Cahiers du Centre d'Etudes de Recherche Operationnelle, Vol. 16, pp. 425-439, 1974.
9. 9. BRUMBAUGH-SMITH, J., and SHIER, D., An Empirical Investigation of Some Bicriterion Shortest Path Algorithms, European Journal of Operational Research, Vol. 43, pp. 216-224, 1989.
10. 10. HANSEN, P., Bicriterion Path Problems, Multiple-Criteria Decision Making: Theory and Applications, Edited by G. Fandel and T. Gal, Springer Verlag, Heidelberg, Germany, pp. 109-127, 1980.
11. 11. SKRIVER, A. J. V., and ANDERSEN, K. A., A Label Correcting Approach for Solving Bicriterion Shortest-Path Problems, Computers and Operations Research, Vol. 27, pp. 507-524, 2000.
12. 12. MARTINS, E. Q. V., On a Multicriteria Shortest Path Problem, European Journal of Operational Research, Vol. 16, pp. 236-245, 1984.
13. 13. MARTINS, E. Q. V., and SANTOS, J. L. E., The Labeling Algorithm for the Multiobjective Shortest Path Problem, CISUC Technical Report TR 99/005, University of Coimbra, Coimbra, Portugal, 1999.
14. 14. CLIMACO, J. C. N., and MARTINS, E. Q. V., A Bicriterion Shortest Path Algorithm, European Journal of Operational Research, Vol. 11, pp. 399-404, 1982.
15. 15. AZVEDO, J., and MARTINS, E. Q. V., An Algorithm for the Multiobjective Shortest Path Problem on Acyclic Networks, Investigacao Operational, Vol. 11, pp. 52-69, 1991.
16. 16. TUNG, C., and CHEW, K., A Multicriteria Pareto-Optimal Path, European Journal of Operational Research, Vol. 62, pp. 203-209, 1992.
17. 17. WARBURTON, A., Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems, Operations Research, Vol. 35, pp. 70-79, 1987.
18. 18. CARRAWAY, R., MORIN, L., and MOSKOWITZ, H., Generalized Dynamic Programming for Multicriteria Optimization, European Journal of Operational Research, Vol. 44, pp. 95-104, 1990.
19. 19. MODESTI, P., and SCIOMACHEN, A., A Utility Measure for Finding Multi-Objective Shortest Paths in Urban Multimodal Transportation Networks, Proceedings of AIRO '96, pp. 615-617, 1996.
20. 20. CURRENT, J. R., REVELLE, C. S., and COHON, J. L., An Interactive Approach to Identify the Best Compromise Solution for Two-Objective Shortest-Path Problems, Computers and Operations Research, Vol. 17, pp. 187-198, 1990.
21. 21. CLIMACO, J. R., and COUTINHO-RODRIGUES, J. M., On an Interactive Bicriteria Shortest-Path Algorithm, 1st International Workshop on Project Management and Scheduling, Lisbon, Portugal, 1988.
22. 22. COUTINHO-RODRIGUES, J. M., CLIMACO, J. C. N., and CURRENT, J. R., A PC-Based Interactive Decision Support System for Two-Objective Direct-Delivery Problems, Journal of Business Logistics, Vol. 15, pp. 305-322, 1994.
23. 23. COUTINHO-RODRIGUES, J. M., CLIMACO, J. C. N., and CURRENT, J. R., An Interactive Biobjective Shortest-Path Approach: Searching for Unsupported Nondominated Solutions, Computers and Operations Research, Vol. 26, pp. 789-798, 1999.
24. 24. MURTHY, I., and OLSON, D. L., An Interactive Procedure Using Domination Cones for Bicriterion Shortest-Path Problems, European Journal of Operational Research, Vol. 72, pp. 417-431, 1999.
25. 25. MOTE, J., MURTHY, I., and OLSON, D., An Empirical Investigation of the Number of Pareto-Optimal Paths Obtained for Bicriteria Shortest-Paths Problems, Working Paper, Louisiana State University, 1987.
26. 26. MOTE, J., MURTHY, I., and OLSON, D., A Parametric Approach to Solving Bicriterion Shortest-Path Problems, European Journal of Operational Research, Vol. 53, pp. 81-92, 1991.
27. 27. BERTSEKAS, D. P., GUERRIERO, F., and MUSMANNO, R., Parallel Asynchronous Label Correcting Methods for Shortest Paths, Journal of Optimization Theory and Applications, Vol. 88, pp. 297-320, 1996.
28. 28. KLINGMAN, D., NAPIER, A., and STUTZ, J., NETGEN: A Program for Generating Large-Scale (Un) Capacitated Assignment, Transportation, and Minimum-Cost Flow Network Problems, Management Science, Vol. 20, pp. 814-822, 1974.