Article ID Journal Published Year Pages File Type
1142388 Operations Research Letters 2012 7 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,