Title: On algorithms for finding the k shortest paths in a network
Abstract: Abstract This paper presents, within a unified framework, several new algorithms for computing k shortest paths in a network. These algorithms utilize strategies which have proved to be efficient in solving shortest path problems. In addition, a computational study was conducted to assess the effects of the different “arc processing” orders which are characteristic of each algorithm. Testing was performed using generated classes of moderately large grid, complete and random networks. Two particular algorithms emerge as the most promising among those evaluated.
Publication Year: 1979
Publication Date: 1979-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 152
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot