Shortest viable path algorithm in multimodal networks

摘要

We consider an approach using label correcting techniques to find the shortest viable path from an origin to a destination, in a multimodal transportation network. A path is called viable if its sequence of modes is feasible with respect to a set of constraints. We present an ad hoc modification of the chronological Al- gorithm to solve the multiodal shortest viable path problem.