SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Alternative routes in road networks
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System
IEEE Transactions on Intelligent Transportation Systems
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hi-index | 0.00 |
Every human likes choices. But today's 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.