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

DOI10.1007/s10479-007-0198-9zbMath1151.90335OpenAlexW1991924366WikidataQ58760145 ScholiaQ58760145MaRDI QIDQ940859

Eliécer Gutiérrez, Andrés L. Medaglia

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0198-9

zbMATH Keywords

combinatorial optimizationshortest path problemroad networksgeographic information systems (GIS)turn prohibitions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach ⋮ Route planning with turn restrictions: A computational experiment ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Optimum turn-restricted paths, nested compatibility, and optimum convex polygons ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Finding Paths in Grids with Forbidden Transitions

Cites Work

• A note on two problems in connexion with graphs
• The shortest path problem with forbidden paths
• Shortest path calculation in large road networks
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
• Solving arc routing problems with turn penalties
• The Directed Rural Postman Problem with Turn Penalties
• On finding minimum routes in a network with turn penalties
• Unnamed Item
• Unnamed Item