SHORTEST VIABLE HYPERPATH IN MULTIMODAL NETWORKS

This paper defines the shortest viable hyperpath problem in an urban multimodal transportation network. Both the multimodal and viable hyperpath conceptualizations are presented. The authors consider a label correcting approach to find the shortest viable hyperpath from an origin and destination, for different values of the upper limit of modal transfers. Such hyperpaths compose a Pareto-optimal set, from which the user could choose the most appropriate hyperpath that meets their personal preferences with respect to the expected travel time and the upper limit of modal transfers. The proposed procedure is illustrated using an application example on a multimodal network. The procedure could be included in traveler information systems and in the solution of more complex problems for modeling user route choice for transit-traffic management