## Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects (1998)

Citations: | 51 - 3 self |

### BibTeX

@MISC{Pallottino98shortestpath,

author = {Stefano Pallottino and Maria Grazia Scutellà},

title = {Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is transportation, where shortest path problems of different kinds need to be solved. Due to the nature of the application, transportation scientists need very flexible and efficient shortest path procedures, both from the running time point of view, and also for the memory requirements. Since no "best" algorithm currently exists for every kind of transportation problem, research in this field has recently moved to the design and implementation of "ad hoc" shortest path procedures, which are able to capture the peculiarities of the problems under consideration. The aim of this work is to present in a unifying framework both the main algorithmic approaches that have been proposed in the past years for solving the shortest path problems arising most frequently in the transportation field, and also some important implementation techniques ...