AN EXTENDED MODEL AND PROCEDURAL FRAMEWORK FOR PLANNING MULTI-MODAL PASSENGER JOURNEYS
land use - planning, mode - mass transit, mode - pedestrian, planning - signage/information, ridership - commuting, ridership - demand, technology - passenger information
Walking, Travel time, Transit, Shortest path algorithms, Public transit, Passenger information systems, Origin and destination, Optimization, Optimisation, O&D, Multimodal transportation, Multimodal systems, Mathematical models, Mass transit, Local transit, Journey time, Demand responsive transportation
This paper presents a comprehensive cost-minimizing formulation for use in planning multi-modal passenger journeys using public transportation services. The journey-planning problem to be solved is defined by a request to travel at minimal generalized cost from a given origin to a given destination, subject to timing constraints. The public transportation services include walking, fixed-schedule services such as buses and trains, and demand-responsive modes such as taxis. The formulation allows for the possibility of non-linear generalized-cost functions. For problems involving an early-departure style of travel, an optimization procedure based on Dijkstra's label-setting shortest-path algorithm is outlined. The new procedure can be inverted to meet the needs of a late-arrival style of travel. An adaptation of the procedure is also suggested for the dilatory style of travel, but remains somewhat speculative. Findings do indicate that the Dijkstra-forward and Dijkstra-backward procedures appear to be very suitable for the early-departure and late-arrival problems, with computation performance likely to be an improvement over a branch-and-bound procedure.
Permission to publish the abstract has been given by Elsevier, copyright remains with them.
Horn, MET, (2003). AN EXTENDED MODEL AND PROCEDURAL FRAMEWORK FOR PLANNING MULTI-MODAL PASSENGER JOURNEYS. Transportation Research Part B: Methodological, Volume 37, Issue 7, p. 641-660.