2 Search Results for "Drakulic, Darko"


Document
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
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
  • 2 Drakulic, Darko
  • 2 Lehoux, Vassilissa
  • 1 Loiodice, Christelle

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

  • Refine by Keyword
  • 1 Multimodal routing
  • 1 Personalization
  • 1 Public transit
  • 1 Route planning
  • 1 bicriteria shortest paths
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2019
  • 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