A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem

Systematic tabu search based meta-heuristic algorithms are designed and implemented for the transit route network design problem. A multi-objective nonlinear mixed integer model is formulated. Solution methodologies based on three variations of tabu search methods are proposed and tested using a small experimental network as a pilot study. Sensitivity analysis is performed, a comprehensive characteristics analysis is conducted and numerical results indicate that the preferred tabu search method outperforms the genetic algorithm used as a benchmark.

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

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

[3]  Tal Sadeh.  Transit network design , 1988 .

[4]  Hani S. Mahmassani,et al.  Trip Assignment Model for Timed-Transfer Transit Systems , 1997 .

[5]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[6]  Hani S. Mahmassani,et al.  ARTIFICIAL INTELLIGENCE-BASED SYSTEM REPRESENTATION AND SEARCH PROCEDURES FOR TRANSIT ROUTE NETWORK DESIGN , 1992 .

[7]  Randy B Machemehl,et al.  Characterizing bus transit passenger waiting times , 2002 .

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

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[12]  Nigel H. M. Wilson,et al.  The allocation of buses in heavily utilized networks with overlapping routes , 1982 .

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

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

[15]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

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

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

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

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

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

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

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

[23]  Robert B Dial,et al.  TRANSIT PATHFINDER ALGORITHM , 1967 .

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

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

[28]  Larry J. LeBlanc,et al.  Transit system network design , 1988 .