EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Rafaqat Ali iD, Hai Jiang, Lubos Buzna

PLOS ONE · 2023

DOI: 10.1371/journal.pone.0287604 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS ONE, 2023. Verfasst von Rafaqat Ali und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Industrial Engineering, Tsinghua University, Beijing, P.R.China. Hauptthemen laut MEDLINE: Transportation, Travel. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR, Agentúra na Podporu Výskumu a Vývoja, European Regional Development Fund.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Developing an efficient and economical journey plan in multimodal transportation networks is of significant and fast-growing importance, but it is still an annoying experience for a traveler. This paper aims to find the journey plan at a combined cross-border and inter-regional level when visiting a sequence of cities while utilizing several transport modes to reduce travel costs and planning time. We study a traveling itinerary problem in a scheduled multimodal transportation network with constraints on both arcs and nodes as a new extension of the shortest path problem. We formulate a 0-1 integer linear programming model for the traveling itinerary problem and develop an exact algorithm that finds a combined cross-border and inter-regional low costs journey plan. We present case studies based on real-world transport data to illustrate the usefulness and computational efficiency of the proposed approaches. We compare the results with the previously proposed approach to demonstrate the benefits of multimodal journeys. Finally, we compare the results with the solution obtained by the general-purpose 0-1 integer linear programming solver to evaluate the computational time.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

TransportationTravelCitiesAlgorithms

Autor:innen und Institutionen

  • Department of Industrial Engineering, Tsinghua University, Beijing, P.R.China.
  • Department of Mathematical Methods and Operations Research, University of Zilina, Zilina, Slovakia.
  • Department of International Research Projects - ERADiate+, University of Zilina, Zilina, Slovakia.

ORCID-Profile: Rafaqat Ali

Förderung

  • Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR
  • Agentúra na Podporu Výskumu a Vývoja
  • European Regional Development Fund

Zitieren

APA

Ali, R., Jiang, H., & Buzna, L. (2023). Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities. PLOS ONE. https://doi.org/10.1371/journal.pone.0287604

Vancouver

Ali R, Jiang H, Buzna L. Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities. PLOS ONE. 2023. doi:10.1371/journal.pone.0287604

BibTeX
@article{Ali2023,
  author = {Ali, Rafaqat and Jiang, Hai and Buzna, Lubos},
  title = {Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities},
  journal = {PLOS ONE},
  year = {2023},
  doi = {10.1371/journal.pone.0287604}
}
Kostenlos starten →