Scheduling multiple vehicle mobility allowance shuttle transit (m-MAST) services
暂无分享,去创建一个
Wei Lu | Luca Quadrifoglio | Lu Lu | L. Quadrifoglio | Wei-Zong Lu | Lu Lu
[1] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[2] Maged M. Dessouky,et al. An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..
[3] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[4] Luca Quadrifoglio,et al. An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services , 2007, J. Sched..
[5] Gilbert Laporte,et al. Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..
[6] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[7] Martín Matamala,et al. The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..
[8] Jiamin Zhao,et al. Service capacity design problems for mobility allowance shuttle transit systems , 2008 .
[9] David Koffman,et al. Operational Experiences with Flexible Transit Services , 2004 .
[10] M. Sol. The general pickup and delivery problem , 2010 .
[11] Randolph W. Hall,et al. Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity , 2006, Transp. Sci..
[12] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[13] Maged Dessouky,et al. Sensitivity Analyses over the Service Area for Mobility Allowance Shuttle Transit (MAST) Services , 2008 .
[14] Martin W. P. Savelsbergh,et al. Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..
[15] Luca Quadrifoglio,et al. Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints , 2008, CPAIOR.
[16] Maged M. Dessouky,et al. A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..