Abstract
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our network drawings is close to that achieved with the actual coordinates.
Research partially supported by the Deutsche Forschungsgemeinschaft (DFG) under grant WA 654/10-4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice-Hall, 1993.
J. Branke, F. Bucher, and H. Schmeck. A genetic algorithm for drawing undirected graphs. Proc. 3rd Nordic Workshop on Genetic Algorithms and their Applications, pp. 193–206, 1997.
R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte. The dissection of rectangles into squares. Duke Mathematical Journal, 7:312–340, 1940.
I. F. Cruz and J. P. Twarog. 3D graph drawing with simulated annealing. Proc. 3rd Intl. Symp. Graph Drawing (GD’ 95), Springer LNCS 1027, pp. 162–165, 1996.
R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301–331, 1996.
P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.
P. Eades and N. C. Wormald. Fixed edge-length graph drawing is np-hard. Discrete Applied Mathematics, 28:111–134, 1990.
T. M. Fruchterman and E. M. Reingold. Graph-drawing by force-directed placement. Software—Practice and Experience, 21(11):1129–1164, 1991.
P. Gajer, M. T. Goodrich, and S. G. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. Proc. Graph Drawing 2000. To appear.
G. H. Golub and C. F. van Loan. Matrix Computations. Johns Hopkins University Press, 3rd edition, 1996.
D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Proc. Graph Drawing 2000. To appear.
S. Jung and S. Pramanik. HiTi graph model of topographical road maps in navigation systems. Proc. 12th IEEE Int. Conf. Data Eng., pp. 76–84, 1996.
T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7–15, 1989.
C. Kosak, J. Marks, and S. Shieber. Automating the layout of network diagrams with specified visual organization. IEEE Transactions on Systems, Man and Cybernetics, 24(3):440–454, 1994.
P. Kosmol. Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Optimierungsaufgaben. Teubner Verlag, 1993.
T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, 1990.
K. Nachtigall. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83:154–166, 1995.
T. Preuß and J.-H. Syrbe. An integrated traffic information system. Proc. 6th Intl. EuropIA Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning. Europia Productions, 1997.
F. Schulz, D. Wagner, and K. Weihe. Dijkstra’s algorithm on-line: an empirical case study from public railroad transport. Proc. 3rd Workshop on Algorithm Engineering (WAE’ 99), Springer LNCS 1668, pp. 110–123, 1998.
R. Sedgewick and J. S. Vitter. Shortest paths in euclidean space. Algorithmica 1:31–48, 1986.
S. Shekhar, A. Kohli, and M. Coyle. Path computation algorithms for advanced traveler information system (ATIS). Proc. 9th IEEE Intl. Conf. Data Eng., pp. 31–39, 1993.
L. Siklóssy and E. Tulp. TRAINS, an active time-table searcher. Proc. 8th European Conf. Artificial Intelligence, pp. 170–175, 1988.
P. Spellucci. Numerische Verfahren der nichtlinearen Optimierung. Birkhäuser Verlag, 1993.
D. Tunkelang. JIGGLE: Java interactive general graph layout environment. Proc. 6th Intl. Symp. Graph Drawing (GD’ 98), Springer LNCS 1547, pp. 413–422, 1998.
W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, Third Series, 13:743–768, 1963.
C. Walshaw. A multilevel algorithm for force-directed graph drawing. Proc. Graph Drawing 2000. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandes, U., Schulz, F., Wagner, D., Willhalm, T. (2001). Travel Planning with Self-Made Maps. In: Buchsbaum, A.L., Snoeyink, J. (eds) Algorithm Engineering and Experimentation. ALENEX 2001. Lecture Notes in Computer Science, vol 2153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44808-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-44808-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42560-1
Online ISBN: 978-3-540-44808-2
eBook Packages: Springer Book Archive