Skip to main content
SpringerLink
Log in

Speeding up Martins’ algorithm for multiple objective shortest path problems

  • Research paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time. The label setting algorithm of Martins efficiently finds this set of Pareto optimal paths, but sometimes tends to be slow, especially for large networks such as transportation networks. In this article we investigate a number of speedup measures, resulting in new algorithms. It is shown that the calculation time to find the Pareto optimal set can be reduced considerably. Moreover, it is mathematically proven that these algorithms still produce the Pareto optimal set of paths.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • 9th DIMACS implementation challenge (2006) Shortest paths. http://www.dis.uniroma1.it/~challenge9

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

    Article  Google Scholar 

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

    Google Scholar 

  • Bornstein C, Maculan N, Pascoal MMB, Pinto L (2012) Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization. Comput Oper Res 39:1969–1976

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Clímaco JNC, Pascoal MMB (2012) Multicriteria path and tree problems—discussion on exact algorithms and applications. Int Trans Oper Res 19:63–98

    Article  Google Scholar 

  • de Lima Pinto L, Bornstein CT, Maculan N (2009) The tricriterion shortest path problem with at least two bottleneck objective functions. Eur J Oper Res 198:387–391

    Article  Google Scholar 

  • Demeyer S, Audenaert P, Slock B, Pickavet M, Demeester P (2008) Multimodal transport planning in a dynamic environment. Conference on intelligent public transport systems, Amsterdam, pp 155–167

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

    Article  Google Scholar 

  • Disser Y, Müller-Hannemann M, Schnee M (2008) Multi-criteria shortest paths in time-dependent train networks, experimental algorithms, 7th international workshop, WEA 2008. Provincetown, MA, USA pp 347–361

  • Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22:425–460

    Article  Google Scholar 

  • Ehrgott M, Gandibleux X (2002) Multiple criteria optimization: state of the art annotated bibliographic surveys, international series in operations research and management science, vol. 52, Springer

  • Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28:652–673

    Article  Google Scholar 

  • Fu L, Sun D, Rilett LR (2006) Heuristic shortest path algorithms for transportation applications: state of the art. Comput Oper Res 33:3324–3343

    Article  Google Scholar 

  • Gandibleux X, Beugnies F, Randriamasy S (2006) Martins’ algorithm revisited for multi-objective shortest path problems with MaxMin cost function. 4OR Q J Oper Res 4:47–59

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction Hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch (ed) Workshop on experimental algorithms, LNCS 5038. Springer-Verlag, Berlin/Heidelberg, pp 319–333

  • Goldberg A, Kaplan H, Werneck R (2006) Reach for A*: efficient point-to-point shortest path algorithms. In: Workshop on algorithm engineering and experiments, Miami, pp 129–143

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

    Article  Google Scholar 

  • Hansen P (1980) Bicriterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making: theory and applications, lecture notes in economics and in mathematical systems 177. Springer, Heidelberg, pp 109–127

    Chapter  Google Scholar 

  • Jiménez V, Marzal A (1999) Computing the K shortest paths: a new algorithm and experimental comparison. In: Vitter JS, Zaroliagis CD (eds) Proceedings of the 3rd international workshop on algorithm engineering, LNCS 1668. Springer-Verlag Berlin/Heidelberg, pp 15–29

  • Jiménez V, Marzal A (2003) A lazy version of Eppstein’s k shortest path algorithm. In: Jansen K, Margraf M, Matrolli M, Rolim J (eds) Proceedings of the 2nd international workshop on experimental and efficient algorithms, LNCS 2647. Springer-Verlag Berlin/Heidelberg, pp 179–191

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

    Article  Google Scholar 

  • Martins EQV (1984b) An algorithm for ranking paths that may contain cycles. Eur J Oper Res 18:123–130

    Article  Google Scholar 

  • Martins EQV, Paixão JM, Rosa MS, Santos JLE (2007) Ranking multiobjective shortest paths, Pré-publicações do Departamento de Matemática 07–11, Universidade de Coimbra

  • Martins EQV, Pascoal MMB, Santos JLE (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10:247–263

    Article  Google Scholar 

  • Martins EQV, Pascoal MMB, Santos JLE (2000) Labeling algorithms for ranking shortest paths. Technical Report 001 CISUC

  • Martins EQV, Pascoal MMB, Santos JLE (2001) A new improvement for a K shortest path algorithm. Investigação Oper 21:47–60

    Google Scholar 

  • Martins EQV, Santos JLE (1999) The labeling algorithm for the multiobjective shortest path problem, CISUC technical report TR 99/005, University of Coimbra, Portugal

  • Nicholson JAT (1966) Finding the shortest route between two points in a network. Comput J 9:275–280

    Article  Google Scholar 

  • Pangilinan JMA, Janssens GK (2007) Evolutionary algorithms for the multiobjective shortest path problem. Int J Appl Sci Eng Technol 4:205–210

    Google Scholar 

  • Paixão JM, Santos JL (2007) Labelling methods for the general case of the multi-objective shortest path problem—a computational study, Pré-publicações do Departamento de Matemática 07-42, Universidade de Coimbra

  • Paixão JM, Santos JL (2008) A new ranking path algorithm for the multiobjective shortest path problem, Pré-publicações do Departamento de Matemática 08-27, Universidade de Coimbra

  • Pinto L, Pascoal MMB (2010) On algorithms for tricriteria shortest path problems with two bottleneck objective functions. Comput Oper Res 37:1774–1779

    Article  Google Scholar 

  • Raith A (2010) Speed-up of labelling algorithms for biobjective shortest path problems. In: Proceedings of the 45th annual conference of the ORSNZ. Auckland, New Zealand, pp 313–322

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

    Article  Google Scholar 

  • Sastry V, Janakiraman T, Mohideen S (2003) New algorithms for multi-objective shortest path problem. Opsearch 40:278–298

    Google Scholar 

  • Serafini P (1986) Some considerations about computational complexity for multiobjective combinatorial problems. Recent advances and historical development of vector optimization 294:222–232

    Article  Google Scholar 

  • Skriver AJV (2000) A classification of bicriterion shortest path (BSP) algorithms. Asia Pac J Oper Res 17:192–212

    Google Scholar 

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

    Article  Google Scholar 

  • Stewart BS, White CC (1991) Multiobjective A*. J Assoc Comput Mach 38:775–814

    Article  Google Scholar 

  • Vincke P (1974) Problemes multicritères. Cahiers Centre Etudes Recherche Operationnelle 16:425–439

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology (INTEC), Ghent University, IBBT, Gaston Crommenlaan 8/201, 9050 , Ghent, Belgium

    Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet & Piet Demeester

Authors
  1. Sofie Demeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Goedgebeur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pieter Audenaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mario Pickavet
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Piet Demeester
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sofie Demeyer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demeyer, S., Goedgebeur, J., Audenaert, P. et al. Speeding up Martins’ algorithm for multiple objective shortest path problems. 4OR-Q J Oper Res 11, 323–348 (2013). https://doi.org/10.1007/s10288-013-0232-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-013-0232-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation