Shortest viable hyperpath in multimodal networks

In this work both the multimodal hypergraph and the viable hyperpath conceptualizations are presented. The shortest viable hyperpath problem (SVHP) in a multimodal transportation network is defined. We consider a label correcting approach to find the shortest viable hyperpath from an origin to a destination, for different values of the upper limit of modal transfers. Such hyperpaths compose a Pareto-optimal set, from where the user could choose the “best” hyperpath according to personal preferences with respect to the expected travel time and the upper limit of modal transfers. An application example on a multimodal network is presented.