Computing Multimodal Journeys in Practice

We study the problem of finding multimodal journeys in transportation networks, including unrestricted walking, driving, cycling, and schedule-based public transportation. A natural solution to this problem is to use multicriteria search, but it tends to be slow and to produce too many journeys, several of which are of little value. We propose algorithms to compute a full Pareto set and then score the solutions in a postprocessing step using techniques from fuzzy logic, quickly identifying the most significant journeys. We also propose several (still multicriteria) heuristics to find similar journeys much faster, making the approach practical even for large metropolitan areas.

In  Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)

Publisher  Springer

Details

TypeInproceedings
Pages260–271
Volume7933
SeriesLecture Notes in Computer Science
> Publications > Computing Multimodal Journeys in Practice