An exact method to find the intermodal shortest path (ISP)

Abstract

In this paper, we study the problem of finding the origin-destination (O-D) shortest path in intermodal transportation networks, aiming at minimizing the travel time. The transportation network and the corresponding data are modeled by means of a multi-label graph. The intermodal shortest path problem and its definition are briefly described. The algorithm developed to find the path is presented, especially by detailing a label correcting approach that updates some labels associated with the graph nodes. The implementation of this approach and the results it provides show its validity.