Abstract
Real-world road networks often contain turn penalties or forbidden turns. Standard shortest path algorithms do not take these into account. Several ways of dealing with such turn restrictions have been proposed. It has remained unclear which method is most suitable, even though efficiency is very important in route planning. We present a computational experiment comparing these methods. We conclude with a guideline for choosing the right algorithm in a real-world application.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
