Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service
ridership - mode choice, mode - car, mode - pedestrian, mode - park and ride, mode - mass transit, mode - rail, mode - bus
multi-modal, auto, bus, rail, travel cost, private-side cost, public-side travel cost, transfer cost, park-and-ride
A simple but efficient algorithm is proposed for finding the optimal path in an intermodal urban transportation network. The network is a general transportation network with multiple modes (auto, bus, rail, walk, etc.) divided into the two major categories of private and public, with proper transfer constraints. The goal was to find the optimal path according to the generalized cost, including private-side travel cost, public-side travel cost, and transfer cost. A detailed network model of transfers between modes was used to improve the accounting of travel times during these transfers. The intermodal path algorithm was a sequential application of specific cases of transit and auto shortest paths and resulted in the optimal intermodal path, with the optimal park-and-ride location for transferring from private to public modes. The computational complexity of the algorithm was shown to be a significant improvement over existing algorithms. The algorithm was applied to a real network within a dynamic traffic and transit assignment procedure and integrated with a sequential activity choice model.
Permission to publish the abstract has been given by Transportation Research Board, Washington, copyright remains with them.
Khani, A., Lee, S., Hickman, M., Noh, H., & Nassir N. (2012). Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service. Transportation Research Record, Vol. 2284, pp. 40-46.