Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

Annals of Operations Research

Volumn 157, Issue 1, 2008, Pages 169-182

  Gutiérrez, Eliécer ^a   Medaglia, Andrés L ^a  

^a UNIVERSIDAD DE LOS ANDES   (Colombia)

Author keywords

Combinatorial optimization; Geographic information systems (GIS); Road networks; Shortest path problem; Turn prohibitions

Indexed keywords

EID: 35348840879     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0198-9     Document Type: Article

References (17)

1. Añez, J., de la Barra, T., & Pérez, B. (1996). Dual graph representation of transport networks. Transportation Research, 30(3), 209-216.
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. New York: Prentice Hall.
3. Benavent, E., & Soler, D. (1999). The directed rural postman problem with turn penalties. Transportation Science, 33(4), 408-418.
4. Caldwell, T. (1961). On finding minimum routes in a network with turn penalties. Communications of the ACM, 4(2), 107-108.
5. Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996). Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming, 73, 129-174.
6. Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1998). SPLIB version 1.4. Available at http://www.avglab.com/andrew/soft.html. Last accessed: 15 January 2005.
7. Chou, Y. L., Romeijn, H. E., & Smith, R. L. (1998). Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. INFORMS Journal on Computing, 10(2), 163-179.
8. City Mayors (2006). The world's largest cities. Available at http://www.citymayors.com/features/largest_cities1.html. Last accessed: 2 October 2006
9. Clossey, J., Laporte, G., & Soriano, P. (2001). Solving arc routing problems with turn penalties. Journal of the Operational Research Society, 52, 433-439.
10. Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1, 269-271.
11. Ertl, G. (1998). Shortest path calculation in large road networks. OR Spectrum, 20, 15-20.
12. Speičys, L., Jensen, C. S., & Kligys, A. (2003). Computational data modeling for network-constrained moving objects. In 'GIS '03: Proceedings of the 11th ACM international symposium on advances in geographic information systems (pp. 118-125). New York: ACM Press.
13. Villeneuve, D., & Desaulniers, G. (2005). The shortest path problem with forbidden paths. European Journal of Operational Research, 165, 97-107.
14. Winter, S. (2002). Modeling costs of turns in route planning. Geoinformatica, 6(4), 345-361.
15. Zeiler, M. (1999). Modeling our world. Redlands: ESRI Press.
16. Zhan, F. B. (1997). Three fastest shortest path algorithms on real road networks: data structures and procedures. Journal of Geographic Information and Decision Analysis, 1(1), 69-82.
17. Zhan, F. B., & Noon, C. E. (1998). Shortest path algorithms: an evaluation using real road networks. Transportation Science, 32(1), 65-73.