|Vassilissa Lehoux, Christelle Loiodice|
|Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Virtual event, 9 - 10 September, 2021|
In the context of routing in public transit networks, we consider the issue of the customization 9 of walking transfer times, which is often incompatible with the preprocessing required by many 10 state-of-the-art algorithms. We propose to extend one of those, the Trip-Based Public Transit 11 Routing algorithm, to take into account at query time user defined transfer speed and maximum 12 transfer duration. The obtained algorithm is optimal for the bicriteria problem of optimizing 13 minimum arrival time and number of transfers. It is tested on two large datasets and the query 14 times are compatible with real-time queries in a production context.
You may choose which kind of cookies you allow when visiting this website. Click on "Save cookie settings" to apply your choice.
FunctionalThis website uses functional cookies which are required for the search function to work and to apply for jobs and internships.
AnalyticalOur website uses analytical cookies to make it possible to analyse our website and optimize its usability.
Social mediaOur website places social media cookies to show YouTube and Vimeo videos. Cookies placed by these sites may track your personal data.
This content is currently blocked. To view the content please either 'Accept social media cookies' or 'Accept all cookies'.
For more information on cookies see our privacy notice.