Real-time mass passenger transport network optimization problems

Transportation Research Record

Volumn , Issue 1964, 2006, Pages 229-237

  Pagès, Laia ^a   Jayakrishnan, R ^a   Cortés, Cristián E ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; ROUTERS; SCHEDULING; VEHICLE LOCATING SYSTEMS;

MASS TRANSPORT NETWORK DESIGN PROBLEM (MTNDP); MASS TRANSPORT VEHICLE ROUTING PROBLEM (MTVRP); MATHEMATICAL FORMULATIONS; REAL-TIME ROUTING;

MASS TRANSPORTATION;

EID: 33846876133     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1964-25     Document Type: Conference Paper

References (34)

1. Bräysy, O., and M. Gendreau. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, Vol. 39, No. 1, 2005, pp. 104-118.
2. Bodin, L. D. Twenty Years of Routing and Scheduling. Operations Research, Vol. 38, 1990, pp. 571-579.
3. Xu, H., X., Z.-L. Chen, S. Rajagopal, and S. Arunapuram. Solving a Practical Pickup and Delivery Problem. Transportation Science, Vol. 37, No. 3, 2003, pp. 347-364.
4. Psaraftis, H. Dynamic Vehicle Routing Problems. In Vehicle Routing: Methods and Studies (B. L. Golden and A. A. Assad, eds.), Elsevier Science Publishers B.V., 1988.
5. Laporte, G. The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, Vol. 59, 1992, pp. 231-247.
6. Gouveia, L., and S. Voss. A Classification of Formulations for the (Time-Dependent) Traveling Salesman Problem. European Journal of Operational Research, Vol. 83, 1995, pp. 69-82.
7. Jaulet, P. A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited. Operations Research, Vol. 18,1988, pp. 51-70.
8. Gendreau, M., A. Hertz, and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, Vol. 40, No. 6, 1992, pp. 1086-1094.
9. Gendreau, M., A. Hertz, G. Laporte, and M. Stan. A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Operations Research, Vol. 43, No. 3, May-June 1998.
10. Salomon, M., M. M. Solomon, L. N. Van Wasselhove, Y. Dumas, and S. Dauzère-Pérès. Solving the Discrete Lotsizing and Scheduling Problem with Sequence Dependent Set-Up Costs and Set-Up Times Using the Travelling Salesman Problem with Time Windows. European Journal of Operational Research, Vol. 100, 1997, pp. 494-513.
11. Savelsberg, M. W. P., and M. Sol. The General Pickup and Delivery Problem. Transportation Science, Vol. 29, No. 1, 1995, pp. 17-39.
12. Jaw, J. J., A. R. Odoni, H. N. Psaraftis, and N. H. M. Wilson. Heuristic Algorithm for the Multi-Vehicle Advance Request Dial-a-Ride Problem with Time Windows. Transportation Research, Vol. 20B, No. 3, 1986, pp. 243-257.
13. Quadrifoglio, L., M. Dessouky, and K. Palmer. An Insertion Heuristic for Scheduling MAST Services. Presented at UCTC Conference, Irvine, Feb. 2005, and submitted for publication in Journal of Scheduling.
14. Diana, M., and M. Dessouky. New Regret Insertion Heuristic for Solving Large-Scale Dial-a-Ride Problems with Time Windows. Transportation Research, Vol. 38B, No. 6, 2004, pp. 539-557.
15. Horn, M. E. T. Multimodal and Demand-Responsive Passenger Transport Systems: A Modeling Framework with Embedded Control Systems. Transportation Research, Vol. 36A, 2001, pp. 167-188.
16. Horn, M. E. T. Fleet Scheduling and Dispatching for Demand Responsive Passenger Services. Transportation Research, Vol. 10C, No. 1, 2002, pp. 35-63.
17. 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.
18. Cortés, C. E., L. Pagès, and R. Jayakrishnan. Microsimulation of Flexible Transit System Designs in Realistic Urban Networks. In Transportation Research Record: Journal of the Transportation Research Board, No. 1923, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 153-163.
19. Mandl, C. Evaluation and Optimization of Urban Public Transportation Networks. European Journal of Operational Research, Vol. 5, 1980, pp. 396-404.
20. Hasselstrom, D. Public Transportation Planning - A Mathematical Programming Approach. PhD dissertation. Department of Business Administration, University of Gothenburg, Sweden, 1981.
21. Ceder, A., and N. H. M. Wilson. Bus Network Design. Transportation Research, Vol. 20B, 1986, pp. 331-344.
22. Baaj, M. H., and H. S. Mahmassani. Hybrid Route Generation Heuristic Algorithm for the Design of Transit Networks. Transportation Research, Vol. 3, No. 1, 1994, pp. 31-50.
23. Barnhart, C., H. Jin, and P. H. Vance. Railroad Bocking: A Network Design Application. Operations Research, Vol. 48, No. 4, 1998, pp. 603-614.
24. van Nes, R. Multi-User-Class Urban Transit Network Design. Presented at 82nd Annual Meeting of the Transportation Research Board, Washington, D.C., 2003.
25. Newell, G. Some Issues Related to the Optimal Design of Bus Routes. Transportation Science, Vol. 13, 1979, pp. 20-35.
26. Barnhart, C., et al. Composite Variable Formulations for Express Shipment Service Network Design. Transportation Science, Vol. 36, No. 1, 2002, pp. 1-20.
27. Pages, L. Real-Time Mass Transport Vehicle Routing Problem: Hierarchical Global Optimization for Large Networks. PhD dissertation. University of California, Irvine, forthcoming (summer 2006).
28. Karmarkar, N. K. A New Polynomial Time Algorithm for Linear Programming. Combinatorica, Vol. 4, 1984, pp. 373-395.
29. Kennington, J. L. A Survey of Linear Cost Multicommodity Network Flows. Operations Research, Vol. 26, No. 2, 1978, pp. 209-236.
30. Ali, A., R. V. Helgason, J. L. Kennington, and H. Lall. Computational Comparison Among Three Multicommodity Network Flow Algorithms. Operations Research, Vol. 28, 1980, pp. 995-1000.
31. Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice Hall, Englewood Cliffs, N.J., 1993.
32. Kennington, J. L., and R. V. Helgason. Algorithms for Network Programming. John Wiley & Sons, New York, 1980.
33. 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.
34. Pagès, L., and R. Jayakrishnan. Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP). Presented at International Scientific Annual Conference on Operational Research, Bremen, Germany, 9-13 September 2005.