An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays

In this paper, we present a time-dependent intermodal optimum path algorithm for multimodal transportation networks that accounts for delays at mode and arc switching points. The correctness and computational complexity of the algorithm are proved. A simple representation of the mode-to-mode switching options is introduced that results in a substantially improved design, with computational complexity independent of the number of modes and fixed schedule lines for typical transit and freight networks. The algorithm is implemented, coded, and computationally tested on realistic size networks with promising results.