Shortest viable path algorithm in multimodal networks

Angelica Lozano and Giovanni Storchi

Transportation Research Part A: Policy and Practice, 2001, vol. 35, issue 3, 225-241

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.

Date: 2001
References: View complete reference list from CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0965-8564(99)00056-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transa:v:35:y:2001:i:3:p:225-241

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part A: Policy and Practice is currently edited by John (J.M.) Rose

More articles in Transportation Research Part A: Policy and Practice from Elsevier
Bibliographic data for series maintained by Catherine Liu ().