Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Robust and efficient methods for solving path problems
Robust and efficient methods for solving path problems
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding all attractive train connections by multi-criteria Pareto search
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
User-specific web-based route planning
ICCHP'10 Proceedings of the 12th international conference on Computers helping people with special needs: Part I
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Contraction of timetable networks with realistic transfers
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
CrowdRoute: a crowd-sourced routing algorithm in public transit networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
| Hi-index | 0.00 |
We study the problem of finding all Pareto-optimal solutions in a multi-criteria setting of the shortest path problem in time-dependent graphs. This has important applications in timetable information systems for train schedules. We present a new prototype to solve this problem in a fully realistic scenario based on a multi-criteria generalization of Dijkstra's algorithm. As optimization criteria we use travel time and number of train changes, as well as a new criterion "reliability of transfers". The performance of the prototype and various speed-up techniques are analyzed experimentally on a large set of real test instances. In comparison with a base-line implementation, our prototype achieves significant speed-up factors of 20 with respect to the number of label creations and of 138 with respect to label insertions into the priority queue. We also compare our prototype with a time-expanded graph model.