research-article

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

Authors:

Yannick Kergosien, Antoine Giret, Emmanuel Néron, Gaël SauvanetAuthors Info & Claims

INFORMS Journal on Computing, Volume 34, Issue 1

Pages 76 - 92

https://doi.org/10.1287/ijoc.2021.1081

Published: 01 January 2022 Publication History

Abstract

This paper proposes an exact algorithm to solve the one-to-one multiobjective shortest path problem. The solution involves determining a set of nondominated paths between two given nodes in a graph that minimizes several objective functions. This study is motivated by the application of this solution method to determine cycling itineraries. The proposed algorithm improves upon a label-correcting algorithm to rapidly solve the problem on large graphs (i.e., up to millions of nodes and edges). To verify the performance of the proposed algorithm, we use computational experiments to compare it with the best-known methods in the literature. The numerical results confirm the efficiency of the proposed algorithm.

Summary of Contribution: The paper deals with a classic operations research problem (the one-to-one multiobjective shortest path problem) and is motivated by a real application for cycling itineraries. An efficient method is proposed and is based on a label-correcting algorithm into which several additional improvement techniques are integrated. Computational experiments compare this algorithm with the best-known methods in the literature to validate the performance on large-size graphs (Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) instances from the ninth DIMACS challenge). New instances from the context of cycling itineraries are also proposed.

References

[1]

Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications (Alfred P. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA).

Digital Library

[2]

Aneja Y, Nair K (1979) Bicriteria transportation problem. Management Sci. 25(1):73–78.

[3]

Azevedo J, Costa MEOS, Madeira JJES, Martins EQV (1993) An algorithm for the ranking of shortest paths. Eur. J. Oper. Res. 69(1):97–106.

[4]

Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379–394.

[5]

Bellman R (1958) On a routing problem. Quart. Appl. Math. 16(1):87–90.

[6]

Bertsekas D (1998) Network Optimization: Continuous and Discrete Models (Athena Scientific, Belmont, MA).

[7]

Bolívar MA, Lozano L, Medaglia AL (2014) Acceleration strategies for the weight constrained shortest path problem with replenishment. Optim. Lett. 8(8):2155–2172.

[8]

Brumbaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. Eur. J. Oper. Res. 43(2):216–224.

[9]

Cabrera N, Medaglia AL, Lozano L, Duque D (2020) An exact bidirectional pulse algorithm for the constrained shortest path. Networks 76(2):128–146.

[10]

Carlyle W, Wood R (2005) Near-shortest and k-shortest simple paths. Networks 46(2):98–109.

[11]

Clímaco J, Martins E (1982) A bicriterion shortest path algorithm. Eur. J. Oper. Res. 11(4):399–404.

[12]

Clímaco JC, Craveirinha JM, Pascoal M (2003) A bicriterion approach for routing problems in multimedia networks. Networks 41(4):206–220.

[13]

Current J, ReVelle C, Cohon J (1987) The median shortest path problem: A multiobjective approach to analyze cost vs. accessibility in the design of transportation networks. Transportation Sci. 21(3):188–197.

Digital Library

[14]

Current J, ReVelle C, Cohon J (1988) The minimum-covering/shortest-path problem. Decision Sci. 19(3):490–503.

[15]

Demeyer S, Goedgebeur J, Audenaert P, Pickavet M, Demeester P (2013) Speeding up Martins algorithm for multiple objective shortest path problems. 4OR 11(4):323–348.

[16]

Deo N, Pang C (1984) Shortest-path algorithms: Taxonomy and annotation. Networks 14(2):275–323.

[17]

Dijkstra E (1959) A note on two problems in connection with graphs. Numerische Mathematik 1:269–271.

Digital Library

[18]

Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135–153.

[19]

Duque D, Lozano L, Medaglia A (2015) An exact method for the biobjective shorstest path problem for large-scale road networks. Eur. J. Oper. Res. 242(3):788–797.

[20]

Ehrgott M (2005) Multicriteria Optimization, vol. 491 (Springer Science & Business Media, Berlin).

[21]

Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transportation Sci. 19(1):75–84.

Digital Library

[22]

Engineer FG, Nemhauser GL, Savelsbergh MW, Song JH (2012) The fixed-charge shortest-path problem. INFORMS J. Comput. 24(4):578–596.

Digital Library

[23]

Ford LR Jr, Fulkerson DR (2015) Flows in Networks (Princeton University Press).

[24]

Gabrel V, Vanderpooten D (2002) Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Eur. J. Oper. Res. 139(3):533–542.

[25]

Galand L, Ismaili A, Perny P, Spanjaard O (2013) Bidirectional preference-based search for state space graph problems. Helmert M, Rüger G, eds. Proc. Sixth Annual Sympos. Combinatorial Search, Leavenworth, WA (AAAI Press), 80–88.

[26]

Garroppo RG, Giordano S, Tavanti L (2010) A survey on multi-constrained optimal path computation: Exact and approximate algorithms. Comput. Networks 54(17):3081–3107.

Digital Library

[27]

Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3):291–328.

Digital Library

[28]

Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22(3):618–630.

[29]

Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J. Optim. Theory Appl. 111:589–613.

[30]

Hansen P (1980) Bicriterion path problems. Fandel G, Gal T, eds. Multiple Criteria Decision Making: Theory and Applications, 2nd ed. Lectures Notes in Economics and Mathematical Systems, vol. 177 (Springer, Heidelberg), 109–127.

[31]

Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Sci. Cybernetics 4(2):100–107.

[32]

Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33–65.

[33]

Lozano L, Medaglia AL (2013) On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1):378–384.

Digital Library

[34]

Lozano L, Duque D, Medaglia AL (2015) An exact algorithm for the elementary shortest path problem with resource constraints. Transportation Sci. 50(1):348–357.

[35]

Machuca E, Mandow L (2011) Multiobjective route planning with precalculated heuristics. Proc. 15th Portuguese Conf. Artificial Intelligence, 98–107.

[36]

Machuca E, Mandow L (2016) Lower bound sets for biobjective shortest path problems. J. Global Optim. 64(1):63–77.

Digital Library

[37]

Mandow L, Cruz JDL (2010) Multiobjective A* search with consistent heuristics. J. ACM 57(5):27.

Digital Library

[38]

Martins E (1984) On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2):236–245.

[39]

Mendoza JE, Guéret C, Hoskins M, Lobit H, Pillac V, Vidal T, Vigo D (2014) VRP-rep: The vehicle routing community repository. Third Meeting EURO Working Group Vehicle Routing Logist. Optim.

[40]

Moore EF (1959) The shortest path through a maze. Proc. Internat. Sympos. Switching Theory, 285–292.

[41]

Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problems. Eur. J. Oper. Res. 53(1):81–92.

[42]

Munoz JML (2004) Boost multi-index containers library. C/C++ Users J. 22(9):6.

[43]

Ndiaye IA, Neron E, Jouglet A (2017) Macroscopic evacuation plans for natural disasters. OR Spectrum 39(1):231–272.

Digital Library

[44]

Paixão JM, Santos JL (2013) Labeling methods for the general case of the multi-objective shortest path problem–A computational study. Madureira A, Reis C, Marques V, eds. Intelligent Systems, Control and Automation: Science and Engineering. Computational Intelligence and Decision Making (Springer, The Netherlands), 489–502.

[45]

Parmentier A (2019) Algorithms for non-linear and stochastic resource constrained shortest path. Math. Methods Oper. Res. 89(2): 281–317.

[46]

PassMark Software (2019) CPU benchmarks. Accessed February 2020, https://www.cpubenchmark.net/.

[47]

Raith A (2010) Speed-up of labelling algorithms for biobjective shortest path problems. Proc. 45th Annual Conf. ORSNZ, 313–322.

[48]

Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput Oper. Res. 36(4):1299–1331.

Digital Library

[49]

Raith A, Schmidt M, Schöbel A, Thom L (2018) Extensions of labeling algorithms for multi-objective uncertain shortest path problems. Networks 72(1):84–127.

[50]

Sauvanet G, Neron E (2010) Search for the best compromise solution on multiobjective shortest path problem. Electronic Notes Discrete Math. 36:615–622.

[51]

Sedeño-Noda A, Colebrook M (2019) A biobjective Dijkstra algorithm. Eur. J. Oper. Res. 276(1):106–118.

[52]

Sedeño-Noda A, Raith A (2015) A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57:83–94.

Digital Library

[53]

Serafini P (1987) Some considerations about computational complexity for multiobjective combinatorial problems. Jahn J, Krabs W, eds. Recent Advances and Historical Development of Vector Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 294 (Springer, Berlin), 222–231.

[54]

Sherali HD, Hobeika AG, Kangwalklai S (2003) Time-dependent, label-constrained shortest path problems with applications. Transportation Sci. 37(3):278–293.

Digital Library

[55]

Skriver A, Andersen K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput. Oper. Res. 27(6):507–524.

[56]

Tarapata Z (2007) Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. Internat. J. Appl. Math. Comput. Sci. 17(2):269–287.

Digital Library

[57]

Thomas BW, Calogiuri T, Hewitt M (2019) An exact bidirectional A* approach for solving resource-constrained shortest path problems. Networks 73(2):187–205.

[58]

T’kindt V, Billaut JC (2006) Multicriteria Scheduling: Theory, Models and Algorithms (Springer Science & Business Media).

[59]

Tung C, Chew K (1992) A multicriteria Pareto-optimal path algorithm. Eur. J. Oper. Res. 62(2):203–209.

[60]

Ulungu E, Teghem J (1994) Multi-objective combinatorial optimization problems: A survey. J. Multi-Criteria Decision Anal. 3(2): 83–104.

[61]

Ulungu E, Teghem J (1995) The two phases method: An efficient procedure to solve biobjective combinatorial optimization problems. Foundations Comput. Decision Sci. 20(2):149–165.

Cited By

Patel RKhalil E(2024)LEO: Learning Efficient Orderings for Multiobjective Binary Decision DiagramsIntegration of Constraint Programming, Artificial Intelligence, and Operations Research10.1007/978-3-031-60599-4_6(83-110)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60599-4_6
Kurbanov TCuchý MVokřínek J(2023)Fast One-to-Many Multicriteria Shortest Path SearchIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.328206924:10(10410-10419)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TITS.2023.3282069
Kurbanov TCuchý MVokřínek J(2022)Heuristics for Fast One-to-Many Multicriteria Shortest Path Search2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)10.1109/ITSC55140.2022.9922586(594-599)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1109/ITSC55140.2022.9922586

Index Terms

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Paths and connectivity problems
  2. Mathematical analysis
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
  2. Randomness, geometry and discrete structures

Index terms have been assigned to the content through auto-classification.

Recommendations

A Multiple Pairs Shortest Path Algorithm

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
A simpler and more efficient algorithm for the next-to-shortest path problem
COCOA'10: Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II

Given an undirected graph G = (V,E) with positive edge weights and two vertices s and t, the next-to-shortest path problem is to find an st-path which length is minimum among all st-paths of lengths strictly larger than the shortest path length. In this ...
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

Given an undirected graph G=(V,E) with positive edge lengths and two vertices s and t, the next-to-shortest path problem is to find an st-path which length is minimum amongst all st-paths strictly longer than the shortest path length. In this paper we ...

Comments

Information & Contributors

Information

Published In

cover image INFORMS Journal on Computing

INFORMS Journal on Computing Volume 34, Issue 1

Winter 2022

670 pages

ISSN:1526-5528

DOI:10.1287/ijoc.2022.34.issue-1

Issue’s Table of Contents

Copyright © 2021, INFORMS.

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 January 2022

Accepted: 19 February 2021

Received: 08 March 2020

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Patel RKhalil E(2024)LEO: Learning Efficient Orderings for Multiobjective Binary Decision DiagramsIntegration of Constraint Programming, Artificial Intelligence, and Operations Research10.1007/978-3-031-60599-4_6(83-110)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60599-4_6
Kurbanov TCuchý MVokřínek J(2023)Fast One-to-Many Multicriteria Shortest Path SearchIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.328206924:10(10410-10419)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TITS.2023.3282069
Kurbanov TCuchý MVokřínek J(2022)Heuristics for Fast One-to-Many Multicriteria Shortest Path Search2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)10.1109/ITSC55140.2022.9922586(594-599)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1109/ITSC55140.2022.9922586

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents