A shortest path algorithm in multimodal networks: a case study with time varying costs

In this paper we deal with the problem of finding optimal routes in multimodal networks. Since modal change nodes play a relevant role in the choice of origin – destination paths, and consequently in the computation of multimodal shortest paths, we evaluate the performance of such nodes with the aim of increasing their attractivity. We propose an algorithm that focuses on the modal change nodes and forces as much as possible routings through those nodes that could be profitably selected as commuting points. Preliminary results of a computational experimentation aimed at validating the proposed algorithm with randomly generated multimodal networks are reported together with a case study related to the city of Genoa, Italy.