|Keywords:||Route planning; Shortest paths; Speedup techniques; Preprocessing; Algorithm Engineering|
|Full text PDF:||http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3808147|
Practical algorithms for route planning in transportation networks are a showpiece of successful Algorithm Engineering. This has produced many speedup techniques, varying in preprocessing time, space, query performance, simplicity, and ease of implementation. This thesis explores solutions to more realistic scenarios, taking into account, e.g., traffic, user preferences, public transit schedules, and the options offered by the many modalities of modern transportation networks.