IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0287604.html
   My bibliography  Save this article

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

Author

Listed:
  • Rafaqat Ali
  • Hai Jiang
  • Lubos Buzna

Abstract

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.

Suggested Citation

  • Rafaqat Ali & Hai Jiang & Lubos Buzna, 2023. "Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities," PLOS ONE, Public Library of Science, vol. 18(11), pages 1-17, November.
    • Handle: RePEc:plo:pone00:0287604
    DOI: 10.1371/journal.pone.0287604
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0287604
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0287604&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0287604?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Richard Bellman, 1954. "Some Applications of the Theory of Dynamic Programming---A Review," Operations Research, INFORMS, vol. 2(3), pages 275-288, August.
    2. Richard Bellman, 1954. "On some applications of the theory of dynamic programming to logistics," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(2), pages 141-153, June.
    3. Ivana Martinčević & Predrag Brlek & Nives Domjan Kačarević, 2022. "Mobility as a Service (MaaS) as a Sustainability Concept for Tourist Destinations," Sustainability, MDPI, vol. 14(12), pages 1-20, June.
    4. Li, Xiang & Zhou, Jiandong & Zhao, Xiande, 2016. "Travel itinerary problem," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 332-343.
    5. Tom Storme & Corneel Casier & Hossein Azadi & Frank Witlox, 2021. "Impact Assessments of New Mobility Services: A Critical Review," Sustainability, MDPI, vol. 13(6), pages 1-20, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoyue Li & John M. Mulvey, 2023. "Optimal Portfolio Execution in a Regime-switching Market with Non-linear Impact Costs: Combining Dynamic Program and Neural Network," Papers 2306.08809, arXiv.org.
    2. Mahmoud Mahfouz & Angelos Filos & Cyrine Chtourou & Joshua Lockhart & Samuel Assefa & Manuela Veloso & Danilo Mandic & Tucker Balch, 2019. "On the Importance of Opponent Modeling in Auction Markets," Papers 1911.12816, arXiv.org.
    3. Dawei Chen & Fangxu Mo & Ye Chen & Jun Zhang & Xinyu You, 2022. "Optimization of Ramp Locations along Freeways: A Dynamic Programming Approach," Sustainability, MDPI, vol. 14(15), pages 1-13, August.
    4. Harrold, Daniel J.B. & Cao, Jun & Fan, Zhong, 2022. "Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learning," Energy, Elsevier, vol. 238(PC).
    5. Vanvuchelen, Nathalie & De Boeck, Kim & Boute, Robert N., 2024. "Cluster-based lateral transshipments for the Zambian health supply chain," European Journal of Operational Research, Elsevier, vol. 313(1), pages 373-386.
    6. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
    7. Matthias Breuer & David Windisch, 2019. "Investment Dynamics and Earnings‐Return Properties: A Structural Approach," Journal of Accounting Research, John Wiley & Sons, Ltd., vol. 57(3), pages 639-674, June.
    8. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    9. Michael J. Pennock & William B. Rouse & Diane L. Kollar, 2007. "Transforming the Acquisition Enterprise: A Framework for Analysis and a Case Study of Ship Acquisition," Systems Engineering, John Wiley & Sons, vol. 10(2), pages 99-117, June.
    10. Quetschlich, Mathias & Moetz, André & Otto, Boris, 2021. "Optimisation model for multi-item multi-echelon supply chains with nested multi-level products," European Journal of Operational Research, Elsevier, vol. 290(1), pages 144-158.
    11. Sasanka Adikari & Norou Diawara, 2024. "Utility in Time Description in Priority Best–Worst Discrete Choice Models: An Empirical Evaluation Using Flynn’s Data," Stats, MDPI, vol. 7(1), pages 1-18, February.
    12. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    13. Peng, Hujun & Li, Jianxiang & Löwenstein, Lars & Hameyer, Kay, 2020. "A scalable, causal, adaptive energy management strategy based on optimal control theory for a fuel cell hybrid railway vehicle," Applied Energy, Elsevier, vol. 267(C).
    14. Vincent Huang & James Unwin, 2019. "Markov Chain Models of Refugee Migration Data," Papers 1903.08255, arXiv.org.
    15. Akay, Rustu & Yildirim, Mustafa Yusuf, 2025. "SBA*: An efficient method for 3D path planning of unmanned vehicles," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 231(C), pages 294-317.
    16. Esmaeili Aliabadi, Danial & Chan, Katrina, 2022. "The emerging threat of artificial intelligence on competition in liberalized electricity markets: A deep Q-network approach," Applied Energy, Elsevier, vol. 325(C).
    17. Alex Sharp & Ryan Browne, 2021. "Functional data clustering by projection into latent generalized hyperbolic subspaces," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 735-757, September.
    18. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    19. G., Mauricio Contreras & Peña, Juan Pablo, 2019. "The quantum dark side of the optimal control theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 450-473.
    20. Yann Disser & John Fearnley & Martin Gairing & Oliver Göbel & Max Klimm & Daniel Schmand & Alexander Skopalik & Andreas Tönnis, 2020. "Hiring Secretaries over Time: The Benefit of Concurrent Employment," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 323-352, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0287604. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.