Abstract
The objective often explored in Web-based route planners is to find an optimal route in a network for a given mode of transport. Usually this involves searching for the cheapest route corresponding to some cost function. For many types of trips, not all desired route properties can be satisfied in this way. Following is a proposed solution for planning hiking trips. The method can easily be transferred to tourist guides in urban areas, for advice for taking a drive, or can be used in related contexts. It is anticipated that these applications will become increasingly relevant in our mobile leisure society.
Planning a hiking route is based primarily on the intended length of the trip, and then on the decision about whether start and destination points need to coincide. As a result, planning trips represents neither a shortest path nor a travelling salesman problem.
The problem with this approach lies in the fact that hikers require trip proposals that cannot necessarily be provided by a shortest path algorithm: round tours, routes including loops, or routes where a route segment which has to be passed in both directions are more consistent with route planning for hikers. A surprisingly simple solution for these requirements appears to be a linear dual graph, which applies a k shortest path algorithm to the linear dual graph. This paper outlines this approach and demonstrates that it achieves realistic and practical route planning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Refrences
Anez J, de la Barra T, Perez B (1996) Dual Graph Representation of Transport Networks. Transportation Research 30(3):209–216
Azevedo JA, Silvestre Madeira JJER, Martins EQV, Pires FMA (1990) A shortest paths ranking algorithm. In: Proc. of the Annual Conference of the Operations Research Society of Italy (AIRO’ 90). Associazione Italiana Ricerca Operativa, pp 1001–1011
Bellman RE (1958) On a Routing Problem. Quart. Appl. Math 16:87–90
Bellman RE, Kalaba R (1960) On kth best policies. Journal of SIAM 8:582–588
Caldwell T (1961) On finding minimum routes in a network with turn penalties. Communications of the ACM 4(2): 107–108
Chvatal V (1983) Linear Programming. W. H. Freeman & Co.
Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge
Cziferszky A (2002) Routenplanung anspruchsvoller Wanderungen. Diploma thesis in progress, Institute for Geoinformation, Technical University Vienna, Austria
Davies N, Cheverst K, Mitchell K, Efrat A (2001) Using and Determining Location in a Context Sensitive Tour Guide. IEEE Computer Journal 34(8):35–41
Denis M, Pazzaglia F, Cornoldi C, Bertolo L (1999) Spatial Discourse and Navigation: An Analysis of Route Directions in the City of Venice. Applied Cognitive Psychology 13:145–174.
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271
Eppstein D (1994) Finding the k Shortest Paths. In: IEEE Symposium on Foundations of Computer Science. pp 154–165
Frank AU (2001) Pragmatic Information Content — How to Measure the Information in a Route Description. GeoInformatica (accepted)
Golledge RG (1995) Path Selection and Route Preference in Human Navigation: A Progress Report. In: Frank AU, Kuhn W (eds) Spatial Information Theory — A Theoretical Basis for GIS. Lecture Notes in Computer Science, 988. Springer, Berlin, pp 207–222
Golledge RG, Stimson RJ (1997) Spatial Behavior: A Geographic Perspective. The Guildford Press, New York
Knödel W (1969) Graphentheoretische Methoden und ihre Anwendungen. Ökonometrie und Unternehmensforschung, 13. Springer, Berlin
Ruppert E (2000) Finding the k Shortest Paths in Parallel. Algorithmica 28:242–254
Stille W (2001) Lösungsverfahren für Prize-Collecting Traveling Salesman Subtour Probleme und ihre Anwendung auf die Tourenplanung im Touristeninformationssystem Deep Map. Diploma thesis, Fakultät für Mathematik und Informatik, Ruprecht-Karls-Universität Heidelberg, Germany
Winter S (2001) Weighting the Path Continuation in Route Planning. In: Aref WG (ed) 9th ACM International Symposium on Advances in Geographic Information Systems. ACM Press, Atlanta, GA, pp 173–176
Zeiler M (1999) Modeling Our World. ESRI Press, Redlands
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winter, S. (2002). Route Specifications with a Linear Dual Graph. In: Richardson, D.E., van Oosterom, P. (eds) Advances in Spatial Data Handling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56094-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-56094-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62859-7
Online ISBN: 978-3-642-56094-1
eBook Packages: Springer Book Archive