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 then 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.

Guerriero, F., Musmanno, R., Lacagnina, V., Pecorella, A. (2001). A class of label-correcting methods for the K shortest paths problem. OPERATIONS RESEARCH, 49(3), 423-429 [10.1287/opre.49.3.423.11217].

A class of label-correcting methods for the K shortest paths problem

LACAGNINA, Valerio;PECORELLA, Antonio
2001-01-01

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 then 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.
Settore SECS-S/06 -Metodi Mat. dell'Economia e d. Scienze Attuariali e Finanz.
http://www.jstor.org/stable/pdfplus/3088637.pdf
Guerriero, F., Musmanno, R., Lacagnina, V., Pecorella, A. (2001). A class of label-correcting methods for the K shortest paths problem. OPERATIONS RESEARCH, 49(3), 423-429 [10.1287/opre.49.3.423.11217].
File in questo prodotto:
File Dimensione Formato  
2001_A Class Of Label Correcting Methods for the K Shortest Paths Problem.pdf

Solo gestori archvio

Descrizione: articolo completo
Dimensione 1.17 MB
Formato Adobe PDF
1.17 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10447/51736
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 14
social impact