01372938

Component

https://doi.org/10.3141/2283-06

http://scholar.google.com...+Noh&publication_year=2012

This paper presents an efficient algorithm that finds the intermodal optimal tour (origin to origin) in a time-dependent transportation network while the algorithm implicitly solves the park-and-ride facility choice problem with the inherent park-and-ride constraints for a traveler with a sequence of destinations to visit. To solve the problem, a network expansion technique that captures the constraints of park-and-ride behavior in the model and that transforms the park-and-ride choice problem into a dynamic network flow problem is introduced. An efficient iterative labeling algorithm that finds the optimal intermodal tour to serve the sequence of activities is also introduced. Multisource shortest-path runs are used in the iterative labeling algorithm to find the optimal tour with several intermediate destinations in an efficient manner. The performance of the algorithm is compared with the performance of existing approaches, and improvement is indicated. The solution method proposed benefits from the advantages of Dijkstra’s shortest-path algorithm, which is made possible by (a) a nontrivial transformation of the original problem into a dynamic network flow problem and (b) an innovative use of a multisource shortest path in the context of origin–destination choice. The solution algorithm integrates time-dependent auto and transit shortest-path algorithms to find the optimal tour. The algorithm is implemented, coded, and tested on a real network, and the results are promising.

01450929

12-3481

English

pp 57–66

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

Figures; References

Intermodal transportation; Origin and destination; Park and ride; Shortest path algorithms; Travel time

Multiple destinations

Highways; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Feb 8 2012 5:17PM

• Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices
• Case Study–Based Evaluation of Stochastic Multicommodity Emergency Inventory Management Model
• Demand and Supply Calibration of Dynamic Traffic Assignment Models: Past Efforts and Future Challenges
• Distance-Based Dynamic Pricing Strategy for Managed Toll Lanes
• Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application
• Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
• Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds
• Model for Optimization of Locations of Schools and Student Transportation in Rural Areas
• Model to Locate Sensors for Estimation of Static Origin–Destination Volumes Given Prior Flow Information
• Path-Constrained Traffic Assignment: Model and Algorithm
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem: Computational Study
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks