Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
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
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Alternative route graphs in road networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Alternative routes in road networks
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient route compression for hybrid route planning
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
An evaluation of multiobjective urban tourist route planning with mobile devices
UCAmI'12 Proceedings of the 6th international conference on Ubiquitous Computing and Ambient Intelligence
A case of pathology in multiobjective heuristic search
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Up to now, research on speed-up techniques for Dijkstra 's algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportation network. However, the quickest route is often not the best one. A user might be willing to accept slightly longer travel times if the cost of the journey is less. A common approach to cope with such a situation is to find Pareto-optimal (concerning other metrics than travel times) routes. Such routes have the property that each route is better than any other route with respect to at least one metric under consideration, e.g., travel costs or number of train changes. In this work, we study multi-criteria search in road networks. On the one hand, we focus on the problem of limiting the number of Pareto paths. On the other hand, we present a multi-criteria variant of our recent SHARC algorithm.