A model for setting services on auxiliary bus lines under congestion

In this paper, a mathematical programming model and a heuristically derived solution is described to assist with the efficient planning of services for a set of auxiliary bus lines (a bus-bridging system) during disruptions of metro and rapid transit lines. The model can be considered static and takes into account the average flows of passengers over a given period of time (i.e., the peak morning traffic hour). Auxiliary bus services must accommodate very high demand levels, and the model presented is able to take into account the operation of a bus-bridging system under congested conditions. A general analysis of the congestion in public transportation lines is presented, and the results are applied to the design of a bus-bridging system. A nonlinear integer mathematical programming model and a suitable approximation of this model are then formulated. This approximated model can be solved by a heuristic procedure that has been shown to be computationally viable. The output of the model is as follows: (a) the number of bus units to assign to each of the candidate lines of the bus-bridging system; (b) the routes to be followed by users passengers of each of the origin–destination pairs; (c) the operational conditions of the components of the bus-bridging system, including the passenger load of each of the line segments, the degree of saturation of the bus stops relative to their bus input flows, the bus service times at bus stops and the passenger waiting times at bus stops. The model is able to take into account bounds with regard to the maximum number of passengers waiting at bus stops and the space available at bus stops for the queueing of bus units. This paper demonstrates the applicability of the model with two realistic test cases: a railway corridor in Madrid and a metro line in Barcelona.

[1]  Lorenzo Meschini,et al.  Schedule-based transit assignment: new dynamic equilibrium model with vehicle capacity constraints , 2009 .

[2]  Luis Ferreira,et al.  Relating bus dwell time and platform crowding at a busway station , 2008 .

[3]  Per-Åke Andersson,et al.  A mathematical model of an urban bus route , 1981 .

[4]  Michael Florian,et al.  L’Optimisation Des Fréquences D’un Réseau De Transport En Commun Moyennement Congestionné , 2003 .

[5]  Fang Zhao,et al.  Optimization of transit route network, vehicle headways and timetables for large-scale transit networks , 2008, Eur. J. Oper. Res..

[6]  Gyeongjoon Yoo,et al.  Frequency design in urban transit networks with variable demand: Model and algorithm , 2010 .

[7]  R Fernandez MODELLING OF BUS-STOP OPERATIONS , 2000 .

[8]  Karel Brookhuis,et al.  Advanced OR and AI methods in transportation , 2005 .

[9]  Warren B. Powell,et al.  Approximate, Closed Form Moment Formulas for Bulk Arrival, Bulk Service Queues , 1986, Transp. Sci..

[10]  Terry Williams,et al.  Probability and Statistics with Reliability, Queueing and Computer Science Applications , 1983 .

[11]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[12]  Klaus Nökel,et al.  Schedule-based dynamic transit assignment , 2009 .

[13]  Nick Tyler,et al.  Effect of Passenger–Bus–Traffic Interactions on Bus Stop Operations , 2005 .

[14]  V. Bhat Approximation for the variance of the waiting time in a GI/G/1 queue , 1993 .

[15]  N. K. Jaiswal,et al.  A Bulk‐Service Queueing Problem with Variable Capacity , 1961 .

[16]  Arnold O. Allen Probability, Statistics, and Queueing Theory , 1978 .

[17]  Konstantinos Kepaptsoglou,et al.  Bus Bridging Problem in Metro Operations: Mathematical Framework and Decision Support System , 2008 .

[18]  Kumares C. Sinha,et al.  MODELING BUS DELAYS DUE TO PASSENGER BOARDINGS AND ALIGHTINGS , 1983 .

[19]  Joti Jain,et al.  A Course on Queueing Models , 2006 .

[20]  O. Adebisi,et al.  A MATHEMATICAL MODEL FOR HEADWAY VARIANCE OF FIXED-ROUTE BUSES , 1986 .

[21]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[22]  Michael Florian,et al.  Optimizing frequencies in a transit network: a nonlinear bi-level programming approach , 1995 .

[23]  Randy B Machemehl,et al.  OPTIMAL TRANSIT ROUTE NETWORK DESIGN PROBLEM: ALGORITHMS, IMPLEMENTATIONS, AND NUMERICAL RESULTS , 2004 .

[24]  Shing Chung Josh Wong,et al.  Schedule-based dynamic user optimal trip assignment model for congested transit networks , 1997 .

[25]  Roberto Cominetti,et al.  A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria , 2006 .

[26]  Jonghyun Kim,et al.  Advanced OR and AI Methods in Transportation META-HEURISTIC ALGORITHMS FOR A TRANSIT ROUTE DESIGN , 2005 .

[27]  Norman T. J. Bailey,et al.  On Queueing Processes with Bulk Service , 1954 .