Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem

A GRASP embedded Scatter Search is developed for the multicommodity capacitated network design problem. Difficulty for this problem arises from the fact that selection of the optimal network design is an NP-complete combinatorial problem. There exist no polynomial exact algorithms which can solve this problem in a reasonable period of time for realistically sized instances. In such cases, heuristic procedures are commonly used. Two strategies were designed for GRASP: a traditional approach and a memory based technique. As for Scatter Search, 5 different strategies were used to update the reference set. Computational results on a large set of randomly generated instances show the convenience of the proposed procedures.

[1]  Michel Gendreau,et al.  A Simplex-Based Tabu Search Method for Capacitated Network Design , 2000, INFORMS J. Comput..

[2]  Arie Segev,et al.  Analysis of a flow problem with fixed charges , 1989, Networks.

[3]  Teodor Gabriel Crainic,et al.  PARALLEL IMPLEMENTATIONS OF BOUNDING PROCEDURES FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[4]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

[5]  Varadharajan Sridhar,et al.  Benders-and-cut algorithm for fixed-charge capacitated network design problem , 2000, Eur. J. Oper. Res..

[6]  Pierre Chardaire,et al.  Application of GRASP to the Multiconstraint Knapsack Problem , 2001, EvoWorkshops.

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

[8]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[9]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[10]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[11]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[12]  Gang Yu,et al.  A Grasp for Aircraft Routing in Response to Groundings and Delays , 1997, J. Comb. Optim..

[13]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

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

[15]  J. Herrmann,et al.  A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem , 1996 .

[16]  Teodor Gabriel Crainic,et al.  BOUNDING PROCEDURES FOR MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEMS. , 1995 .

[17]  Joaquín A. Pacheco,et al.  Solving two location models with few facilities by using a hybrid heuristic: a real health resources case , 2005, Comput. Oper. Res..

[18]  Manuel Laguna,et al.  Assigning Proctors to Exams with Scatter Search , 2001 .

[19]  Rafael Martí,et al.  GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps , 1999, J. Heuristics.

[20]  Joaquín A. Pacheco,et al.  Minimizing Labor Requirements in a Periodic Vehicle Loading Problem , 2005, Comput. Optim. Appl..

[21]  Teodor Gabriel Crainic,et al.  RELAXATIONS FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[22]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[23]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[24]  M. Laguna,et al.  Scatter search for the linear ordering problem , 1999 .

[25]  Manuel Laguna,et al.  Lessons from Applying and Experimenting with Scatter Search , 2005 .

[26]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[27]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[28]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .