Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints

Abstract We study a hybrid transportation system referred to as mobility allowance shuttle transit (MAST) where vehicles may deviate from a fixed path consisting of a few mandatory checkpoints to serve demand distributed within a proper service area. In this paper we propose a mixed integer programming (MIP) formulation for the static scheduling problem of a MAST type system. Since the problem is NP-Hard, we develop sets of logic cuts, by using reasonable assumptions on passengers’ behavior. The purpose of these constraints is to speed up the search for optimality by removing inefficient solutions from the original feasible region. Experiments show the effectiveness of the developed inequalities, achieving a reduction up to 90% of the CPU solving time for some of the instances.

[1]  Teodor Gabriel Crainic,et al.  Flexible many-to-few + few-to-many = an almost personalized transit system , 2001 .

[2]  Matteo Fischetti,et al.  An Additive Bounding Procedure for Combinatorial Optimization Problems , 1989, Oper. Res..

[3]  Maged Dessouky,et al.  Sensitivity Analyses over the Service Area for Mobility Allowance Shuttle Transit (MAST) Services , 2008 .

[4]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[5]  Laurence A. Wolsey,et al.  Strong formulations for mixed integer programs: valid inequalities and extended formulations , 2003, Math. Program..

[6]  R. Jayakrishnan,et al.  Design and Operational Concepts of High-Coverage Point-to-Point Transit System , 2001 .

[7]  Monique Guignard-Spielberg,et al.  Model tightening for integrated timber harvest and transportation planning , 1998, Eur. J. Oper. Res..

[8]  C. Daganzo.  Checkpoint dial-a-ride systems , 1984 .

[9]  Kelly Blume,et al.  A Method for Scheduling Integrated Transit Service , 2000 .

[10]  Randolph W. Hall,et al.  NETWORK DESIGN FOR A GRID HYBRID TRANSIT SERVICE , 2004 .

[11]  Laurence Wolsey,et al.  Strong formulations for mixed integer programming: A survey , 1989, Math. Program..

[12]  M. Sol.  The general pickup and delivery problem , 2010 .

[13]  Randolph W. Hall,et al.  Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity , 2006, Transp. Sci..

[14]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[15]  Federico Malucelli,et al.  Demand Adaptive Systems: Some Proposals on Flexible Transit1 , 1999 .

[16]  Luca Quadrifoglio,et al.  An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services , 2007, J. Sched..

[17]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[18]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[19]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[20]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[21]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

[22]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[23]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[24]  Maged M. Dessouky,et al.  Hybrid scheduling methods for paratransit operations , 2003, Comput. Ind. Eng..

[25]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[26]  Chelsea C. White,et al.  A decision support system for the bimodal dial-a-ride problem , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[27]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[28]  Monique Guignard-Spielberg,et al.  A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation , 2003, Oper. Res..