4 Search Results for "Lehoux, Vassilissa"

Document
DOI: 10.4230/LIPIcs.SEA.2022.6
Routing in Multimodal Transportation Networks with Non-Scheduled Lines

Authors: Darko Drakulic, Christelle Loiodice, and Vassilissa Lehoux

Published in: LIPIcs, Volume 233, 20th International Symposium on Experimental Algorithms (SEA 2022)

Abstract
Over the last decades, new mobility offers have emerged to enlarge the coverage and the accessibility of public transportation systems. In many areas, public transit now incorporates on-demand transport lines, that can be activated at user need. In this paper, we propose to integrate lines without predefined schedules but with predefined stop sequences into a state-of-the-art trip planning algorithm for public transit, the Trip-Based Public Transit Routing algorithm [Witt, 2015]. We extend this algorithm to non-scheduled lines and explain how to model other modes of transportation, such as bike sharing, with this approach. The resulting algorithm is exact and optimizes two criteria: the earliest arrival time and the minimal number of transfers. Experiments on two large datasets show the interest of the proposed method over a baseline modelling.
Cite as

Darko Drakulic, Christelle Loiodice, and Vassilissa Lehoux. Routing in Multimodal Transportation Networks with Non-Scheduled Lines. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{drakulic_et_al:LIPIcs.SEA.2022.6,
  author =	{Drakulic, Darko and Loiodice, Christelle and Lehoux, Vassilissa},
  title =	{{Routing in Multimodal Transportation Networks with Non-Scheduled Lines}},
  booktitle =	{20th International Symposium on Experimental Algorithms (SEA 2022)},
  pages =	{6:1--6:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-251-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{233},
  editor =	{Schulz, Christian and U\c{c}ar, Bora},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.6},
  URN =		{urn:nbn:de:0030-drops-165406},
  doi =		{10.4230/LIPIcs.SEA.2022.6},
  annote =	{Keywords: Multimodal routing, on-demand public transportation, bicriteria shortest paths}
}
Document
DOI: 10.4230/OASIcs.ATMOS.2021.15
Transfer Customization with the Trip-Based Public Transit Routing Algorithm

Authors: Vassilissa Lehoux-Lebacque and Christelle Loiodice

Published in: OASIcs, Volume 96, 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)

Abstract
In the context of routing in public transit networks, we consider the issue of the customization of walking transfer times, which is incompatible with the preprocessing required by many state-of-the-art algorithms. We propose to extend one of those, the Trip-Based Public Transit Routing algorithm, to take into account at query time user defined transfer speed and maximum transfer duration. The obtained algorithm is optimal for the bicriteria problem of optimizing minimum arrival time and number of transfers. It is tested on two large data sets and the query times are compatible with real-time queries in a production context.
Cite as

Vassilissa Lehoux-Lebacque and Christelle Loiodice. Transfer Customization with the Trip-Based Public Transit Routing Algorithm. In 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021). Open Access Series in Informatics (OASIcs), Volume 96, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{lehouxlebacque_et_al:OASIcs.ATMOS.2021.15,
  author =	{Lehoux-Lebacque, Vassilissa and Loiodice, Christelle},
  title =	{{Transfer Customization with the Trip-Based Public Transit Routing Algorithm}},
  booktitle =	{21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)},
  pages =	{15:1--15:17},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-213-6},
  ISSN =	{2190-6807},
  year =	{2021},
  volume =	{96},
  editor =	{M\"{u}ller-Hannemann, Matthias and Perea, Federico},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.15},
  URN =		{urn:nbn:de:0030-drops-148845},
  doi =		{10.4230/OASIcs.ATMOS.2021.15},
  annote =	{Keywords: Public transit, Route planning, Algorithms, Customization}
}
Document
DOI: 10.4230/OASIcs.ATMOS.2020.3
Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm

Authors: Vassilissa Lehoux and Christelle Loiodice

Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)

Abstract
We propose an additional preprocessing step for the Trip-Based Public Transit Routing algorithm, an exact state-of-the art algorithm for bi-criteria min cost path problems in public transit networks. This additional step reduces significantly the preprocessing time, while preserving the correctness and the computation times of the queries. We test our approach on three large scale networks and show that the improved preprocessing is compatible with frequent real-time updates, even on the larger data set. The experiments also indicate that it is possible, if preprocessing time is an issue, to use the proposed preprocessing step on its own to obtain already a significant reduction of the query times compared to the no pruning scenario.
Cite as

Vassilissa Lehoux and Christelle Loiodice. Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{lehoux_et_al:OASIcs.ATMOS.2020.3,
  author =	{Lehoux, Vassilissa and Loiodice, Christelle},
  title =	{{Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{3:1--3:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Huisman, Dennis and Zaroliagis, Christos D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.3},
  URN =		{urn:nbn:de:0030-drops-131395},
  doi =		{10.4230/OASIcs.ATMOS.2020.3},
  annote =	{Keywords: Public transit, Route planning, Algorithms, Preprocessing}
}
Document
DOI: 10.4230/OASIcs.ATMOS.2019.13
Mode Personalization in Trip-Based Transit Routing

Authors: Vassilissa Lehoux and Darko Drakulic

Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)

Abstract
We study the problem of finding bi-criteria Pareto optimal journeys in public transit networks. We extend the Trip-Based Public Transit Routing (TB) approach [Sascha Witt, 2015] to allow for users to select modes of interest at query time. As a first step, we modify the preprocessing of the TB method for it to be correct for any set of selected modes. Then, we change the bi-criteria earliest arrival time queries, and propose a similar algorithm for latest departure time queries, that can handle the definition of the allowed mode set at query time. Experiments are run on 3 networks of different sizes to evaluate the cost of allowing for mode personalization. They show that although preprocessing times are increased, query times are similar when all modes are allowed and lower when some part of the network is removed by mode selection.
Cite as

Vassilissa Lehoux and Darko Drakulic. Mode Personalization in Trip-Based Transit Routing. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{lehoux_et_al:OASIcs.ATMOS.2019.13,
  author =	{Lehoux, Vassilissa and Drakulic, Darko},
  title =	{{Mode Personalization in Trip-Based Transit Routing}},
  booktitle =	{19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)},
  pages =	{13:1--13:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-128-3},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{75},
  editor =	{Cacchiani, Valentina and Marchetti-Spaccamela, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.13},
  URN =		{urn:nbn:de:0030-drops-114256},
  doi =		{10.4230/OASIcs.ATMOS.2019.13},
  annote =	{Keywords: Public transit, Route planning, Personalization}
}
  • Refine by Author
  • 3 Lehoux, Vassilissa
  • 3 Loiodice, Christelle
  • 2 Drakulic, Darko
  • 1 Lehoux-Lebacque, Vassilissa

  • Refine by Classification
  • 3 Mathematics of computing → Graph algorithms
  • 1 Mathematics of computing → Graph theory

  • Refine by Keyword
  • 3 Public transit
  • 3 Route planning
  • 2 Algorithms
  • 1 Customization
  • 1 Multimodal routing
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 1 2019
  • 1 2020
  • 1 2021
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact