ABSTRACT
This chapter deals with the modeling of the multimodal route planning problem as well as the development of optimal path-finding algorithms. The weighted digraph structure can well represent the fundamental static networks. The diverse and case-specific mode-switching actions in the real world, however, require some extra treatments. The authors put forward an efficient approach to describe such actions as switch points, which are somewhat analog to plugs and sockets between different mode graphs. Based on the well-defined data model, the multimodal routing problem can be formalized as a variant of the classical shortest-path problem. Consequently, the multimodal path-finding algorithms are designed as extensions of the shortest-path algorithms and verified with experiments.
