In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of the algorithm is that, contrarily to the previous most efficient approaches for the MSPP, not all of the ND sub-paths on the network need to be found. Additionally, the algorithm fully exploits the fact that ND s-t paths are generated at a very early stage of the ranking procedure. The computational experience reported in the paper shows that, for large size general type networks, the new algorithm clearly outperforms the labelling approach. ; FCT POCTI - Research Units Pluriannual Funding to CMUC (Centro de Matemática da Universidade de Coimbra) and CIO (Operations Research Center of the University of Lisbon), and grant POCTI/MAT/139/2001 cofunded by the EU program FEDER.
A new ranking path algorithm for the multi-objective shortest path problem
2008-01-01
Paper
Electronic Resource
English
DDC: | 629 |
The Variance-Constrained Shortest Path Problem
Online Contents | 1994
|Shortest Path Problems with a Crash Risk Objective
Transportation Research Record | 2023
|Shortest path using detour heuristic algorithm
Tema Archive | 1999
|A directionally oriented shortest path algorithm
Elsevier | 1968
|