| Article ID: | iaor19921475 |
| Country: | Italy |
| Volume: | 21 |
| Issue: | 59 |
| Start Page Number: | 53 |
| End Page Number: | 87 |
| Publication Date: | Sep 1991 |
| Journal: | Ricerca Operativa |
| Authors: | Schettino Alberta |
| Keywords: | transportation: general |
Computationally efficient algorithms for optimal hyperpaths in urban transportation models are studied. After a presentation of the structure of the hyperpaths in the models under consideration, the paper describes two classical algorithms and a new one, which exploit such a structure. Results from a wide computational experimentation are illustrated.