A tabu search approach to an urban transport problem in northern Spain

In this work we analyze an urban transport problem that the City Council of Burgos, a city in northern Spain, has posed to the authors. Given a fleet of buses and drivers, the problem consists in designing routes and assigning buses to the routes such that the service level is optimized. The optimality of the service level is measured in terms of the waiting time at the bus stops and the duration of the trip. Thus, the problem comprises two decision levels (route design and bus assignment) and differs from other urban transport models found in the literature. In order to solve the problem, we propose two algorithms: one with a local search strategy and another with a tabu search strategy. In both cases, the solutions of the two decision levels are modified in alternating steps. The proposed algorithms obtained significantly better results than the tools currently applied by the transport authorities. In addition, the solutions obtained are very robust with respect to variations on demand, as shown by the experiments.

[1]  Avishai Ceder,et al.  User and Operator Perspectives in Transit Network Design , 1998 .

[2]  Chuntian Cheng,et al.  A Parallel Ant Colony Algorithm for Bus Network Optimization , 2007, Comput. Aided Civ. Infrastructure Eng..

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

[4]  Y Wang,et al.  Transit equilibrium assignment: a model and solution algorithm under congested networks in Chinese cities , 2008 .

[5]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[6]  J Potvin,et al.  A tabu search heuristic for the vehicle routing problem with time windows , 1992 .

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

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

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

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

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

[12]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[13]  Hani S. Mahmassani,et al.  TRUST: A LISP PROGRAM FOR THE ANALYSIS OF TRANSIT ROUTE CONFIGURATIONS , 1990 .

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[16]  I. Iervolino,et al.  Computer Aided Civil and Infrastructure Engineering , 2009 .

[17]  Partha Chakroborty,et al.  Genetic Algorithms for Optimal Urban Transit Network Design , 2003 .

[18]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[19]  D. F. Dubois,et al.  A Set of Methods in Transportation Network Synthesis and Analysis , 1979 .

[20]  Arthur M. Geoffrion,et al.  Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems , 1970, Oper. Res..

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

[22]  Avishai Ceder,et al.  Transit Route Design Using Scheduling and Multiobjective Programming Techniques , 1995 .

[23]  Randy B Machemehl,et al.  Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach , 2006 .

[24]  Walter Keudel,et al.  Computer-Aided Line Network Design (DIANA) and Minimization of Transfer Times in Networks (FABIAN) , 1988 .