Scheduling multiple vehicle mobility allowance shuttle transit (m-MAST) services

The mobility allowance shuttle transit (MAST) system is an innovative hybrid transit system in which vehicles are allowed to deviate from a fixed route to serve flexible demand. In this paper, we develop an insertion heuristic that economically inserts the deviation requests into the schedule for multiple-vehicle MAST system, which has never been addressed in the literature. The proposed heuristic is validated and evaluated by a set of simulations performed at different demand levels and with different control parameters. By comparing its performance versus the optimal solutions, the effectiveness and quality of the heuristic is confirmed. Compared to its single-vehicle counterpart, the multiple-vehicle MAST prevails in terms of rejection rate, passenger waiting time and overall objective function, among other performance indices.

[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..