Alternative Route Graphs in Road Networks
Abstract
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.
Keywords
Short Path Road Network Edge Weight Penalty Method Alternative PathPreview
Unable to display preview. Download preview PDF.
References
- 1.Dijkstra, E.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
- 2.Dees, J.: Computing Alternative Routes in Road Networks. Master’s thesis, Karlsruhe Institut für Technologie, Fakultät für Informatik (April 2010)Google Scholar
- 3.Dees, J., Geisberger, R., Sanders, P., Bader, R.: Defining and Computing Alternative Routes in Road Networks. Technical report, ITI Sanders, Faculty of Informatics, Karlsruhe Institute of Technology (2010)Google Scholar
- 4.Eppstein, D.: Finding the k shortest paths. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1994), pp. 154–165 (1994)Google Scholar
- 5.Yen, J.Y.: Finding the K Shortest Loopless Paths in a Network. Management Science 17(11), 712–716 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
- 6.Scott, K.: Finding alternatives to the best path (1997)Google Scholar
- 7.Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making – Theory and Application, pp. 109–127. Springer, Heidelberg (1979)Google Scholar
- 8.Martins, E.Q.: On a Multicriteria Shortest Path Problem. European Journal of Operational Research 26(3), 236–245 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
- 9.Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125–136. Springer, Heidelberg (2009)Google Scholar
- 10.Chen, Y., Bell, M.G.H., Bogenberger, K.: Reliable pre-trip multi-path planning and dynamic adaptation for a centralized road navigation system. In: ITSC 2005 - 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, pp. 14–20. IEEE, Los Alamitos (2007)Google Scholar
- 11.Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66–79. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 12.CAMVIT: Choice routing (2009), http://www.camvit.com
- 13.Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative routes in road networks. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 23–34. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 14.de Queiros Vieira Martins, E., Queir, E., Martins, V., Margarida, M., Pascoal, M.M.B.: A new implementation of yen’s ranking loopless paths algorithm (2000)Google Scholar