Computing and Evaluating Multimodal Journeys

Abstract

We study the problem of nding multimodal journeys in transportation networks, in- cluding 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 signicant journeys. We also propose several (still multicriteria) heuristics to nd similar journeys, but much faster. Our experiments show that this approach enables the computation of high-quality multimodal journeys on large metropolitan areas, and is fast enough for practical applications.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 9 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.