Hybrid meta-heuristic algorithms for solving network design problem

Network design problem has been, and is, an important problem in transportation. Following an earlier effort in designing a meta-heuristic search technique by an ant system, this paper attempts to hybridize this concept with other meta-heuristic concepts such as genetic algorithm, simulated annealing, and tabu search. Seven hybrids have been devised and tested on the network of Sioux Falls. It has been observed that the hybrids are more effective to solve the network design problem than the base ant system. Application of the hybrid containing all four concepts on a real network of a city with over 2 million population has also proved to be more effective than the base network, in the sense of finding better solutions sooner.

[1]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[2]  Nazim U. Ahmed.  An analytical decision model for resource allocation in highway maintenance management , 1983 .

[3]  Chi-Kang Lee,et al.  NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING , 2005 .

[4]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[5]  Rajendra S. Solanki,et al.  Using decomposition in large-scale highway network design with a quasi-optimization heuristic , 1998 .

[6]  Ben Paechter,et al.  THE CONTINUOUS EQUILIBRIUM OPTIMAL NETWORK DESIGN PROBLEM: A GENETIC APPROACH , 1998 .

[7]  Mitsuo Gen,et al.  A method for maintenance scheduling using GA combined with SA , 1994 .

[8]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[9]  Mark S. Daskin,et al.  NETWORK DESIGN APPLICATION OF AN EXTRACTION ALGORITHM FOR NETWORK AGGREGATION. , 1983 .

[10]  H. Poorzahedy,et al.  Application of Ant System to network design problem , 2005 .

[11]  H. Hoc.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders decomposition , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[12]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[13]  G. E. Cantarella.  HEURISTICS FOR THE NETWORK DESIGN PROBLEM , 2003 .

[14]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[15]  Peter A. Steenbrink,et al.  Transport network optimization in the Dutch integral transportation study , 1974 .

[16]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[17]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[18]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[19]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[20]  George B. Dantzig,et al.  Formulating and solving the network design problem by decomposition , 1979 .

[21]  S. N. Sivanandam,et al.  Genetic Algorithm Optimization in C/C++ , 2008 .

[22]  Godfrey C. Onwubolu,et al.  Emerging optimization techniques in production planning and control , 2002 .

[23]  Patrick Siarry,et al.  Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions , 2003, Eur. J. Oper. Res..

[24]  R T Wong.  INTRODUCTION AND RECENT ADVANCES IN NETWORK DESIGN: MODELS AND ALGORITHMS , 1984 .

[25]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[26]  Peter Salamon,et al.  Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .

[27]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[28]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[29]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

[30]  É. Taillard,et al.  Adaptive memories for the Quadratic Assignment Problems , 1997 .

[31]  P H Mijjer,et al.  OPTIMIZATION OF TRANSPORT NETWORK , 1989 .

[32]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[33]  Daniel Costa,et al.  An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem , 1995 .

[34]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[35]  Panos M. Pardalos,et al.  Parallel Metaheuristics for Combinatorial Optimization , 2002 .

[36]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..

[37]  A. Stathopoulos,et al.  Joint pricing and design of urban highways with spatial and user group heterogeneity , 2009 .

[38]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[39]  M. Florian.  Transportation planning models , 1984 .

[40]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[41]  Ric,et al.  Adaptive Memories for the Quadratic Assignment Problem , 1997 .

[42]  Adel W. Sadek,et al.  Hybrid Simulated Annealing and Case-Based Reasoning Approach for Computationally Intensive Transportation Problems: Rationale and Design Issues , 2001 .

[43]  Hoang Hai Hoc,et al.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .

[44]  D. Werra,et al.  Tabu search: a tutorial and an application to neural networks , 1989 .

[45]  Yafeng Yin,et al.  Genetic-Algorithms-Based Approach for Bilevel Programming Models , 2000 .

[46]  Peter Greistorfer,et al.  Hybrid Genetic Tabu Search for a Cyclic Scheduling Problem , 1999 .

[47]  Terry L. Friesz,et al.  A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..