Route planning with turn restrictions: A computational experiment
From MaRDI portal
Publication:1758274
DOI10.1016/J.ORL.2012.06.001zbMath1250.90024OpenAlexW2034030316MaRDI QIDQ1758274
Stéphanie Vanhove, Veerle Fack
Publication date: 8 November 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.06.001
Related Items (2)
A concise guide to existing and emerging vehicle routing problem variants ⋮ A two-stage solution approach for the directed rural postman problem with turn penalties
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- An efficient algorithm for computing least cost paths with turn constraints
- The capacitated general windy routing problem with turn penalties
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- Shortest paths algorithms: Theory and experimental evaluation
- Shortest Path Algorithms: An Evaluation Using Real Road Networks
- Solving arc routing problems with turn penalties
- On finding minimum routes in a network with turn penalties
This page was built for publication: Route planning with turn restrictions: A computational experiment
