Treffer: An algorithm for the ranking of shortest paths

Title:
An algorithm for the ranking of shortest paths
Authors:
AZEVEDO, J. A, SANTOS COSTA, M. E. O, SILVESTRE MADEIRA, J. J. E. R, VIEIRA MARTINS, E. Q
Source:
European journal of operational research. 69(1):97-106
Publisher Information:
Amsterdam: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Algorithme, Algorithm, Algoritmo, Chemin plus court, Shortest path, Camino más corto, Complexité calcul, Computing complexity, Complejidad cálculo, Etude comparative, Comparative study, Estudio comparativo, Marquage graphe, Graph labelling, Marcación grafo, Principe optimalité, Optimality principle, Principio optimalidad, Réseau, Network, Red
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Inst. politéc. Coimbra, escola superior agrária, 3000 Coimbra, Portugal
ISSN:
0377-2217
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4872783
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4872783
Database:
PASCAL Archive

Weitere Informationen

An efficient computational implementation of a path deletion K shortest paths algorithm and a new algorithm for the same problem are presented. In a path deletion K shortest paths algorithm a sequence {G1, G2,..., GK} of networks is defined, such that G1 is the given network and its k-th shortest path is trivially determined from the shortest path in Gk. In essence, as soon as the shortest path in Gk is determined it is excluded from Gk in such a way that no new paths are formed and no more paths are deleted. So, for each Gk, two procedures are executed: a shortest path algorithm and a path deletion algorithm. In the presented computational implementation, all the information resulting from the determination of the k-th shortest path is carried throughout Gk+1, Gk+2,..., GK.