Transit Bus Route Network Design: A Model and its Application in a Real Network

This paper will discuss the Transit Bus Route Network Design (TBRND) and proposes a new heuristic model for its resolution. Planning a bus network is a coordinate and logical process that leads to the definition of routes, frequencies, timetable plans, vehicles and bus driver scheduling. Routes and frequencies are the most important phases of the planning. Therefore, a model defining a complex objective function has been structured to determine routes and frequencies. This model considers many interesting parameters related to the public transportation network. For its resolution, a complex two-phase heuristic algorithm has been used. In the first one, the route lines are characterized whilst in the second, the frequencies are determined, respecting geometric, operative and congruence constraints. Greedy resolution techniques were employed in the first part, while the second part of the algorithm has been resolved through a random optimization process. The method was implemented and resolved using JAVA language. This model has been experimented on a medium-sized city in Italy, and it has provided some interesting results that make the adopted procedure valid in comparison to the existing network. In particular, they proved effective with specific regard to the business service, standing out for shorter distances covered by the lines, and a 22% reduction of the total travel time against the present scenario.

[1]  Christoph E. Mandl,et al.  Evaluation and optimization of urban public transportation networks , 1980 .

[2]  L. A. Silman,et al.  Planning the route system for urban buses , 1974, Comput. Oper. Res..

[3]  J C Rea.  Designing urban transit systems : an approach to the route-technology selection problem , 1971 .

[4]  Steven I-Jy Chien,et al.  OPTIMAL FEEDER BUS ROUTES ON IRREGULAR STREET NETWORKS , 2000 .

[5]  Shinya Kikuchi.  Relationship between the number of stops and headway for a fixed-route transit system , 1985 .

[6]  Vukan R Vuchic,et al.  PUBLIC TRANSPORTATION LINE POSITIONS AND HEADWAYS FOR MINIMUM COST , 1972 .

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

[8]  Kay W. Axhausen,et al.  EVALUATION OF HEURISTIC TRANSIT NETWORK OPTIMIZATION ALGORITHMS , 1984 .

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

[10]  Richard H Pratt,et al.  A SYSTEMS APPROACH TO SUBAREA TRANSIT SERVICE DESIGN , 1972 .

[11]  Randy B Machemehl,et al.  Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem , 2006 .

[12]  B Montella,et al.  A general bus network design model and its application , 1998 .

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Peter G Furth,et al.  SETTING FREQUENCIES ON BUS ROUTES: THEORY AND PRACTICE , 1981 .

[15]  Tiong An Chua,et al.  The planning of urban bus routes and frequencies: A survey , 1984 .

[16]  S. Pallottino,et al.  Hyperpaths and shortest hyperpaths , 1989 .

[17]  Hani S. Mahmassani,et al.  Hybrid route generation heuristic algorithm for the design of transit networks , 1995 .

[18]  C. B. Quak,et al.  A passenger-oriented approach of the construction of a global line network and an ecien t timetable , 2003 .

[19]  W. Lampkin,et al.  The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study , 1967 .

[20]  Rob van Nes,et al.  DESIGN OF PUBLIC TRANSPORT NETWORKS , 1988 .

[21]  Steven I-Jy Chien,et al.  GENETIC ALGORITHM APPROACH FOR TRANSIT ROUTE PLANNING AND DESIGN , 2001 .

[22]  Randy B Machemehl,et al.  A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem , 2008 .

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

[24]  Stefano Carrese,et al.  An Urban Bus Network Design Procedure , 2002 .