Comparative analysis of operation strategies in schedule design for a fixed bus route

This paper proposes a general model for the bus route schedule design (BRSD) problem considering the uncertainty in the bus travel times to minimize the expected total schedule deviation from a reliability standpoint. The preferences of bus operators are considered in the objective function. Based on the general model, four stochastic linear programming models are subsequently developed by successively incorporating different operation strategies; they include (1) no control strategy (NCS), (2) bus drivers’ schedule recovery (DSR), (3) holding control strategy (HCS), and (4) both DSR and HCS (BRHS). Then, a Monte Carlo simulation based solution method is designed to solve these four models, respectively. Finally, numerical tests based on a real bus route are used for a comparative analysis of different operation strategies used in the BRSD. The results show that HCS and BRHS outperform other operation strategies in terms of the schedule deviation of the buses. Interestingly, HCS performs slightly better than BRHS when bus operators assume that later arrival at scheduled point is more harmful than earlier arrival. Compared to NCS, HCS can save objective function approximately 67.9% in all cases. In addition, operation strategies that could better fit a particular scenario are suggested.

[1]  Kristin Graham Saling,et al.  Integrating probabilistic design and rare-event simulation into the requirements engineering process for high-reliability systems , 2013, Int. Trans. Oper. Res..

[2]  Xiaobo Liu,et al.  Dynamic Prediction Method with Schedule Recovery Impact for Bus Arrival Time , 2005 .

[3]  Gordon F. Newell,et al.  Unstable Brownian Motion of a Bus Trip , 1977 .

[4]  Peter G Furth,et al.  INTEGRATING BUS SERVICE PLANNING WITH ANALYSIS, OPERATIONAL CONTROL AND PERFORMANCE MONITORING , 2000 .

[5]  Oded Cats,et al.  Bus-Holding Control Strategies , 2012 .

[6]  Robert L. Bertini,et al.  Modeling schedule recovery processes in transit operations for bus arrival time prediction , 2004 .

[7]  Yunlong Zhang,et al.  Analyzing Urban Bus Service Reliability at the Stop, Route and Network Levels , 2009 .

[8]  S. C. Wirasinghe,et al.  A simulation model of reliable schedule design for a fixed transit route , 2001 .

[9]  R. Pine,et al.  Transit Scheduling: Basic and Advanced Manuals , 1998 .

[10]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[11]  Peter G. Furth,et al.  Optimality conditions for public transport schedules with timepoint holding , 2009, Public Transp..

[12]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[13]  Kazuhiro Kobayashi,et al.  Applying path-counting methods for measuring the robustness of the network-structured system , 2009, Int. Trans. Oper. Res..

[14]  Graham Currie,et al.  Efficient Transit Schedule Design of timing points: A comparison of Ant Colony and Genetic Algorithms , 2012 .

[15]  S. C. Wirasinghe,et al.  Determination of the number and locations of time points in transit schedule design — Case of a single run , 1995, Ann. Oper. Res..

[16]  Satish T. S. Bukkapatnam,et al.  Optimal Slack Time for Schedule-Based Transit Operations , 2006, Transp. Sci..

[17]  Randolph W. Hall,et al.  Bus dispatching at timed transfer transit stations using bus tracking technology , 1999 .

[18]  Michael J Demetsky,et al.  MODELING SCHEDULE DEVIATIONS OF BUSES USING AUTOMATIC VEHICLE-LOCATION DATA AND ARTIFICIAL NEURAL NETWORKS , 1995 .

[19]  Y. Yoshitomi,et al.  A genetic algorithm and the Monte Carlo method for stochastic job‐shop scheduling , 2003 .

[20]  Qiang Meng,et al.  Robust optimization model of schedule design for a fixed bus route , 2012 .

[21]  Paul Schonfeld,et al.  OPTIMAL SLACK TIME FOR TIMED TRANSFERS AT A TRANSIT TERMINAL , 1991 .