High-Coverage Point-to-Point Transit: Study of Path-Based Vehicle Routing Through Multiple Hubs
Abstract
This study focuses on the optimization and simulation modeling associated with the design of alternative transportation, the high-coverage point-to-point transit (HCPPT), which involves a sufficient number of deployed small vehicles with advanced-information supply schemes. This paper identifies the inefficiency of the existing heuristic rules for vehicle routing and proposes a new optimization approach for an HCPPT solution. A path-based model for routing through multiple hubs as opposed to a single pair of hubs is formulated to improve HCPPT operational schemes. This study also develops a simulation framework for the application of the proposed algorithm. To illustrate the system and computational performances of the proposed model, simulations are conducted with different sets of scenarios and model parameters. The path-based model shows reasonable performance over the various demand patterns in level of service and ride time index. It is also shown that, with the use of constraint-driven schemes and model parameters, the scale of the problem is reduced. The computational times are shown to be quite small, and demonstrate the viability in real-time operations.
Get full access to this article
View all access and purchase options for this article.
References
1. Cervero R. Paratransit in America: Redefining Mass Transportation. Praeger, Westport, Conn., 1997.
2. Dial R. B. Autonomous Dial-a-Ride Transit Introductory Overview. Transportation Research Part C, Vol. 3, No. 5, 1995, pp. 261–275.
3. Stone J. R., Nalevanko A., and Tsai J. Assessment of Software for Computerized Paratransit Operations. In Transportation Research Record 1378, TRB, National Research Council, Washington, D.C., 1993, pp. 1–9.
4. Cortés C. E., and Jayakrishnan R. Design and Operational Concepts of High-Coverage Point-to-Point Transit System. In Transportation Research Record: Journal of the Transportation Research Board, No. 1783, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 178–187.
5. Cortés C. E. High-Coverage Point-to-Point Transit (HCPPT): A New Design Concept and Simulation–Evaluation of Operational Schemes for Future Technological Deployment. PhD dissertation. University of California, Irvine, 2003.
6. Psaraftis H. N. Dynamic Vehicle Routing Problems. In Vehicle Routing: Methods and Studies (Golden B. L., and Assad A. A., eds.), Elsevier Science, Amsterdam, Netherlands, 1988.
7. Jaw J., Odoni A., Psaraftis H., and Wilson H. A Heuristic Algorithm for the Multi-Vehicle Advance Request Dial-a-Ride Problem with Time Windows. Transportation Research Part B, Vol. 20, No. 3, 1986, pp. 243–257.
8. Colorni A., and Righini G. Modeling and Optimizing Dynamic Dial-a-Ride Problems. International Transactions in Operations Research, Vol. 8, No. 2, 2001, pp. 155–166.
9. Black A. Urban Mass Transportation Planning. McGraw-Hill, New York, 1995.
10. Pagés L., Jayakrishnan R., and Cortés C. E. Real-Time Mass Transport Network Optimization Problems. In Transportation Research Record: Journal of the Transportation Research Board, No. 1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 229–237.
11. Solomon M. M., and Desrosiers J. Survey Paper: Time Window Constrained Routing and Scheduling Problems. Transportation Science, Vol. 22, No. 1, 1988, pp. 1–13.
12. Cordeau J.-F., and Laporte G. The Dial-a-Ride Problems: Models and Algorithms. Annals of Operations Research. Vol. 153, No. 1, 2007, pp. 29–46.
13. Bertsekas D. P. Algorithms for Non-linear Multicommodity Network Flow Problems. In International Symposium on System Optimization and Analysis (Bensoussian A., and Lions J. T., eds.), Springer, New York, 1979, pp. 210–224.
14. Bertsekas D. P., and Gafni E. M. Projection Methods for Variational Inequalities with Application to the Traffic Assignment Problem. Mathematical Programming Study, Vol. 17, 1982, pp. 139–159.
15. Jayakrishnan R., Tsai W. K., Prashker J. N., and Rajadhyaksha S. A Faster Path-Based Algorithm for Traffic Assignment. In Transportation Research Record 1443, TRB, National Research Council, Washington, D.C., 1994, pp. 75–83.
16. Kim D., Barnhart C., Ware K., and Reinhardt G. Multimodal Express Package Delivery: A Service Network Design Application. Transportation Science, Vol. 33, No. 4, 1999, pp. 391–407.
17. Verter V., and Kara B. Y. A Path-Based Approach for Hazmat Transport Network Design. Management Science, Vol. 54, No. 1, 2008, pp. 29–40.
18. Alfa A. S., and Heads J. Boarding and Alighting Times for Elderly Persons Using Special Bus Service. Journal of Advanced Transportation, Vol. 20, No. 1, 1986, pp. 89–95.
19. Rosenkrantz D. J., Stearns R. E., and Lewis P. M. II An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal of Computing, Vol. 6, No. 3, 1977, pp. 565–581.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published online: January 1, 2011
Issue published: January 2011
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 54
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 18
- A bimodal transit system for large cities: cost efficiency and environ...
- A Simulation Sandbox to Compare Fixed-Route, Semi-flexible Transit, an...
- The taxi sharing practices: Matching, routing and pricing methods
- The pickup and delivery problem with synchronized en-route transfers f...
- Design and Implementation of Zone-to-Zone Demand Responsive Transporta...
- Battery electric vehicles in China: ownership and usage
- An agent-based day-to-day adjustment process for modeling ‘Mobility as...
- Agent-based day-to-day adjustment process to evaluate dynamic flexible...
- Dynamic Shared-Taxi Dispatch Algorithm with Hybrid-Simulated Annealing
- A scalable non-myopic dynamic dial-a-ride and pricing problem
- Redesign of Curricula in Transit Systems Planning to Meet Data-Driven ...
- A methodology for choosing between fixed-route and flex-route policies...
- Policy analysis of third party electronic coupons for public transit f...
- Simulation Framework for Modeling Large-Scale Flexible Transit Systems
- Integrating bus services with mixed fleets
- Conventional, Flexible, and Variable-Type Bus Services
- High-Coverage Point-to-Point Transit: Electric Vehicle Operations
- High coverage point-to-point transit: Local vehicle routing problem wi...
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
