Door-to-door transit accessibility using Pareto optimal range queries

Thomas Koch*, Luk Knapen, Elenna Dugundji

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review


Public transit is a backbone for well-functioning cities, forming a complicated system of interconnecting lines each with their own frequency. Defining accessibility for public transit is just as complicated, as travel times can change every minute depending on location and departure time. With Pareto optimal journeys it is possible to look beyond the earliest arrival times and also optimize for the shortest travel time, as travellers base their departure time on the start time given by their smartphone app, especially when service frequencies are low. By querying for all Pareto optimal journeys in a time range it becomes possible to get a grasp of what passengers see as their choice set when it comes to transit route choice. Based on the averages of the Pareto optimal journeys it should become possible to calculate more realistic skim matrices for traffic analysis zones, including reliability factors such as frequencies and the number of transfers. In this study we calculate Pareto optimal journeys in the area in and around Amsterdam, looking at how travel times are distributed and what factors impact them.

Original languageEnglish
Pages (from-to)107-114
Number of pages8
JournalProcedia Computer Science
Early online date14 Apr 2020
Publication statusPublished - 2020
Event11th International Conference on Ambient Systems, Networks and Technologies, ANT 2020 / 3rd International Conference on Emerging Data and Industry 4.0, EDI40 2020 / Affiliated Workshops - Warsaw, Poland
Duration: 6 Apr 20209 Apr 2020


  • accessibility
  • activity based travel demand model
  • pareto optimal transit
  • public transit
  • skim matrices


Dive into the research topics of 'Door-to-door transit accessibility using Pareto optimal range queries'. Together they form a unique fingerprint.

Cite this