A Class of Label-Correcting Methods for the K Shortest Paths Problem

Francesca Guerriero (), Roberto Musmanno (), Valerio Lacagnina () and Antonio Pecorella ()
Additional contact information
Francesca Guerriero: Università degli Studi della Calabria, Rende, Italy
Roberto Musmanno: Università degli Studi di Lecce, Lecce, Italy, roberto
Valerio Lacagnina: Università degli Studi di Palermo, Palermo, Italy
Antonio Pecorella: Università degli Studi di Palermo, Palermo, Italy

Operations Research, 2001, vol. 49, issue 3, 423-429

Abstract: In this paper we deal with the problem of finding the first K shortest paths from a single origin node to all other nodes of a directed graph. In particular, we define the necessary and sufficient conditions for a set of distance label vectors, on the basis of which we propose a class of methods which can be viewed as an extension of the generic label-correcting method for solving the classical single-origin all-destinations shortest path problem. The data structure used is characterized by a set of K lists of candidate nodes, and the proposed methods differ in the strategy used to select the node to be extracted at each iteration. The computational results show that: 1. some label-correcting methods are generally much faster than the double sweep method of Shier (1979); 2. the most efficient node selection strategies, used for solving the classical single-origin all-destinations shortest path problem, have proved to be effective also in the case of the K shortest paths.

Keywords: Network/Graphs:; algorithms; for; the; K; shortest; paths; problem (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.49.3.423.11217 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:49:y:2001:i:3:p:423-429

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().