[{"type":"paper-conference","title":"Alternative Route Graphs in Road Networks","issued":{"date-parts":[["2011"]]},"page":"21-32","container-title":"Theory and Practice of Algorithms in (Computer) Systems \u2013 1st International ICST Conference (TAPAS 2011), Rome, I, April 18-20, 2011. Proceedings. Ed.: A. Marchetti-Spaccamela","DOI":"10.1007\/978-3-642-19754-3_5","author":[{"family":"Bader","given":"Roland"},{"family":"Dees","given":"Jonathan"},{"family":"Geisberger","given":"Robert"},{"family":"Sanders","given":"Peter"}],"publisher":"Springer","publisher-place":"Berlin","ISBN":"978-3-642-19754-3","ISSN":"0302-9743, 1611-3349","collection-title":"Lecture Notes in Computer Science","abstract":"Every human likes choices. But today\u2019s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but there is a gap between the intuition of humans what makes a good alternative and mathematical definitions needed for grasping these concepts algorithmically. In this paper we make several steps towards closing this gap: Based on the concept of an alternative graph that can compactly encode many alternatives, we define and motivate several attributes quantifying the quality of the alternative graph. We show that it is already NP-hard to optimize a simple objective function combining two of these attributes and therefore turn to heuristics. The combination of the refined penalty based iterative shortest path routine and the previously proposed Plateau heuristics yields best results. A user study confirms these results.","kit-publication-id":"1000097648"}]