EconPapers    
Economics at your fingertips  
 

Solving the Robust Shortest Path Problem with Multimodal Transportation

Jinzuo Guo, Tianyu Liu (), Guopeng Song and Bo Guo
Additional contact information
Jinzuo Guo: College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
Tianyu Liu: College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
Guopeng Song: College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
Bo Guo: College of Systems Engineering, National University of Defense Technology, Changsha 410073, China

Mathematics, 2024, vol. 12, issue 19, 1-14

Abstract: This paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can adapt to various disruptions and modal changes is essential. By incorporating practical constraints in parameter uncertainty, this paper establishes a robust shortest path mixed-integer programming model based on a multimodal transportation network under transportation time uncertainty. To solve robust shortest path problems with multimodal transportation, we propose a modified Dijkstra algorithm that integrates parameter uncertainty with multimodal transportation. The effectiveness of the proposed multimodal transportation shortest path algorithm is verified using empirical experiments on test sets of different scales and a comparison of the runtime using a commercial solver. The experimental results on the multimodal transportation networks demonstrate the effectiveness of our approach in providing robust and efficient routing solutions. The results demonstrate that the proposed method can generate optimal solutions to the robust shortest path problem in multimodal transportation under time uncertainty and has practical significance.

Keywords: multimodal transportation; robust shortest path; mixed-integer programming; parameter uncertainty (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/19/2978/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/19/2978/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:19:p:2978-:d:1485421

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jmathe:v:12:y:2024:i:19:p:2978-:d:1485421