Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design

In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along paths between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate that the path relinking procedure offers excellent results. It systematically outperforms the cycle-based tabu search method in both solution quality and computational effort and offers the best current meta-heuristic for this difficult class of problems.

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

[2]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

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

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

[5]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[6]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[8]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[9]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[10]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[11]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

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

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

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

[15]  GraphsCelso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the SteinerProblem in , 2001 .

[16]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[17]  Michel Gendreau,et al.  Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design , 2003, Oper. Res..

[18]  Document DE Synthèse.  CENTRE DE RECHERCHE SUR LES TRANSPORTS , 2003 .

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