A BRT Network Route Design Model

In this research, a hyper graph of multi-modal urban transit network is developed to describe the architecture of urban transit system; the cost functions of travel strategies is promoted based on the analysis of passengers' strategy-choosing preference, taking travel time reliability, waiting times, seat expectation and a variety of unexpected delay into account. A set of bi-level programming models are proposed for the purpose of finding a feasible solution for BRT network design problem, aiming at diverse performance indexes. A hybrid heuristic algorithm, particle swarm optimization, is employed to solve the models. Finally, a numerical example is presented to verify one of the models proposed and the algorithm designed, in which the algorithms for the lower-level model and those for the upper-level model are compared for performance and searching efficiency, respectively. Conclusions and recommendations are presented based on the analysis of the comparison.

[1]  J D Cea Ch.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFICIENT NEW ALGORITHM , 1989 .

[2]  J D Cea,et al.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM , 1989 .

[3]  William H. K. Lam,et al.  Optimal road tolls under conditions of queueing and congestion , 1996 .

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

[5]  Hai Yang,et al.  TRAFFIC RESTRAINT, ROAD PRICING AND NETWORK EQUILIBRIUM , 1997 .

[6]  Hani S. Mahmassani,et al.  AN AI-BASED APPROACH FOR TRANSIT ROUTE SYSTEM PLANNING AND DESIGN , 1991 .

[7]  Maurizio Bielli,et al.  Genetic algorithms in bus network optimization , 2002 .

[8]  Hai Yang,et al.  Traffic Assignment and Traffic Control in General Freeway-arterial Corridor Systems , 1994 .

[9]  Huijun Sun,et al.  A continuous equilibrium network design model and algorithm for transit systems , 2004 .

[10]  S. B. Pattnaik,et al.  Urban Bus Transit Route Network Design Using Genetic Algorithm , 1998 .

[11]  Tom V. Mathew,et al.  Transit route network design using parallel genetic algorithm , 2004 .

[12]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[13]  Peter G. Furth.  Service Reliability and Hidden Waiting Time : Insights from AVL Data , 2007 .

[14]  Gordon F. Newell,et al.  Some Issues Relating to the Optimal Design of Bus Routes , 1979 .

[15]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[16]  Shing Chung Josh Wong,et al.  Reserve capacity of a signal-controlled road network , 1997 .

[17]  Hai Yang.  Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .

[18]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[19]  Tschangho John Kim,et al.  Advanced Transport and Spatial Systems Models , 1990 .

[20]  Nigel H. M. Wilson,et al.  Bus network design , 1986 .

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

[22]  Terry L. Friesz,et al.  Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints , 1990, Math. Program..

[23]  Jianming Hu.  Study on the optimization methods of transit network based on Ant Algorithm , 2001, IVEC2001. Proceedings of the IEEE International Vehicle Electronics Conference 2001. IVEC 2001 (Cat. No.01EX522).

[24]  Hai Yang,et al.  Traffic assignment and signal control in saturated road networks , 1995 .