Shortest viable path algorithm in multimodal networks

Shortest viable path algorithm in multimodal networks

0.00 Avg rating0 Votes
Article ID: iaor20021967
Country: United Kingdom
Volume: 35A
Issue: 3
Start Page Number: 225
End Page Number: 242
Publication Date: Mar 2001
Journal: Transportation Research. Part A, Policy and Practice
Authors: ,
Abstract:

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 Algorithm to solve the multimodal shortest viable path problem. We show the resulting paths of an application on a network, for different number of modal transfers. Since the results are a solution set, the choice of a path depends on the user's preferences with respect to cost and number of modal transfers.

Reviews

Required fields are marked *. Your email address will not be published.