Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- 7 July 2007
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 157 (1), 169-182
- https://doi.org/10.1007/s10479-007-0198-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Computational data modeling for network-constrained moving objectsPublished by Association for Computing Machinery (ACM) ,2003
- Solving arc routing problems with turn penaltiesJournal of the Operational Research Society, 2001
- The Directed Rural Postman Problem with Turn PenaltiesTransportation Science, 1999
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation SystemsINFORMS Journal on Computing, 1998
- Shortest path calculation in large road networksOR Spectrum, 1998
- Dual graph representation of transport networksTransportation Research Part B: Methodological, 1996
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- Network FlowsPublished by Defense Technical Information Center (DTIC) ,1988
- On finding minimum routes in a network with turn penaltiesCommunications of the ACM, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959