Algorithm for the robust shortest path problem with multimodal transportation

This paper explores the challenges of finding robust shortest paths in multimodal transportation networks. This study develops a robust mixed-integer programming model, taking into account practical constraints related to parameter uncertainty in transportation times. We propose a modified Dijkstra algorithm that integrates parameter uncertainty with multimodal transportation. The findings indicate that the proposed approach is capable of producing optimal solutions for the robust shortest path problem involving multimodal transportation in the context of time uncertainty, highlighting its practical relevance.