A Comparative Study of k-Shortest Path Algorithms
Efficient management of networks requires that the shortest route from one point (node) to another is known; this is termed the shortest path. It is often necessary to be able to determine alternative routes through the network, in case any part of the shortest path is damaged or busy. The k-shortest paths represent an ordered list of the alternative routes available. Four algorithms were selected for more detailed study from over seventy papers written on this subject since the 1950’s. These four were implemented in the ‘C’ programming language and, on the basis of the results, an assessment was made of their relative performance.
KeywordsShort Path Start Node Elementary Path Loop Path Root Path
Unable to display preview. Download preview PDF.
- O’Mahony MJ, Sinclair MC, Mikac B. Ultra-high capacity optical transmission network: European research project COST 239. Information, Telecommunications, Automata Journal 1993; 12:33–45.Google Scholar
- Carraresi P, Sodini C. A binary enumeration tree to find k shortest paths. Methods of Operations Research (Germany) 7th Symposium on Operations Research, St. Gallen, Switzerland 1983; 177–188.Google Scholar