SHORTEST PATH METHODS IN TRANSPORTATION MODELS

A survey of shortest path methods is presented, focusing on their use in transportation models. All the algorithms described are shown to derive from one single prototype method, the difference between them depending only on the particular data structure used in their implementation. This analysis suggests a new classification of the shortest path algorithms. The single shortest path tree problem and the all pairs shortest path problem are both considered, the latter being particularly important in transportation models. Experimental results are illustrated to assess the relative efficiency of the algorithms. (TRRL)