Improved shortest path algorithms for transport networks

Parallel implementation of a transportation network model

“…The main difference between these algorithms lies in the procedure for selecting a labelled node from the loose-end [56], that Dijkstra's algorithm is superior to Moore's, especially for large networks, although it is more difficult to program. However, the D'Esopo extension to Moore's algorithm has been found by Van Vliet [72,73] to be both more efficient and faster over a range of sparse transportation network sizes and configurations.…”

“…Their relative efficiencies are shown to depend on certain characteristics of the network [73]. The D'Esopo algorithm, as described and tested by Pape [61], was identified as performing very well for large as well as small networks by Van Vliet [73].…”

“…Their relative efficiencies are shown to depend on certain characteristics of the network [73]. The D'Esopo algorithm, as described and tested by Pape [61], was identified as performing very well for large as well as small networks by Van Vliet [73]. The D'Esopo algorithm is an extension to Moore's algorithm in that it uses a two-ended lose-end table, also known as a deque list (double-ended queue) for which additions and deletions are possible at either end, so that a node is entered at one of the ends depending on its status.…”

“…Three of the more appropriate algorithms for calculating shortest paths in transportation networks are those due to Moore, D'Esopo and Dijkstra [73]. Their relative efficiencies are shown to depend on certain characteristics of the network [73].…”

“…Therefore, the current deque shortest path algorithm, i.e., the D'Esopo algorithm, seems to be the best choice of algorithm for transportation applications, excluding specific circumstances where specialised algorithms need to be used [29,59]. (2) The robustness of the D'Esopo algorithm relates to it being able to solve the shortest paths problem for different network sizes and configurations more efficiently than both Moore, which is only faster for very small networks (less than 75 nodes) and Dijkstra (box-sort), which is only faster for large networks with short nonnegative link lengths [73].…”