High-coverage point-to-point transit: Study of path-based vehicle routing through multiple hubs

Transportation Research Record

Volumn , Issue 2218, 2011, Pages 78-87

  Jung, Jaeyoung ^a   Jayakrishnan, R ^a  

^a University of California at Irvine ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; VEHICLES;

ADVANCED INFORMATIONS; HEURISTIC RULES; INFORMATION SUPPLIES; MODELING PARAMETERS; OPTIMIZATION APPROACH; OPTIMIZATION MODELS; PATH-BASED; PATH-BASED MODELS; SIMULATION-MODELLING; SMALL VEHICLE;

VEHICLE ROUTING;

EID: 80155163266     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2218-09     Document Type: Article

References (19)

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., A. Nalevanko, and J. Tsai. 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 R. Jayakrishnan. 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 (B. L. Golden and A. A. Assad, eds.), Elsevier Science, Amsterdam, Netherlands, 1988.
7. Jaw, J., A. Odoni, H. Psaraftis, and H. Wilson. 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 G. Righini. Modeling and Optimizing Dynamic Diala- 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., R. Jayakrishnan, and C. E. Cortés. 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 J. Desrosiers. Survey Paper: Time Window Constrained Routing and Scheduling Problems. Transportation Science, Vol. 22, No. 1, 1988, pp. 1-13.
12. Cordeau, J.-F., and G. Laporte. 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 Optimizationand Analysis (A. Bensoussian and J. T. Lions, eds.), Springer, New York, 1979, pp. 210-224.
14. Bertsekas, D. P., and E. M. Gafni. Projection Methods for Variational Inequalities with Application to the Traffic Assignment Problem. Mathematical Programming Study, Vol. 17, 1982, pp. 139-159.
15. Jayakrishnan, R., W. K. Tsai, J. N. Prashker, and S. Rajadhyaksha. 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., C. Barnhart, K. Ware, and G. Reinhardt. Multimodal Express Package Delivery: A Service Network Design Application. Transportation Science, Vol. 33, No. 4, 1999, pp. 391-407.
17. Verter, V., and B. Y. Kara. A Path-Based Approach for Hazmat Transport Network Design. Management Science, Vol. 54, No. 1, 2008, pp. 29-40.
18. Alfa, A. S., and J. Heads. 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., R. E. Stearns, and P. M. Lewis II. An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal of Computing, Vol. 6, No. 3, 1977, pp. 565-581.