Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid

We present a first version of a hybrid metaheuristic that combines a cooperative multi-thread parallel tabu search procedure and a genetic search engine. The two algorithms evolve independently while systematically and asynchronously exchanging solutions. The method appears to be the first to propose a cooperation scheme where the initial population of the genetic algorithm is an elite set of solutions obtained by the parallel metaheuristic, while the best individuals generated during the genetic search enrich the pool of solutions available to all tabu search threads. Experimentation with instances of a multicommodity, capacitated, fixed cost network design formulation leads to an initial assessment of the performances of the method.

[1]  David B. Fogel,et al.  Evolutionary programming: an introduction and some current directions , 1994 .

[2]  Teodor Gabriel Crainic,et al.  SIMPLEX-BASED TABU SEARCH FOR THE MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEM. , 1996 .

[3]  Vipin Kumar,et al.  Parallel search algorithms for discrete optimization problems , 1993, System Modelling and Optimization.

[4]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[5]  Martin Davies,et al.  Computer Science and Operations Research: New Developments in Their Interfaces , 1992 .

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

[7]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[8]  James P. Cohoon,et al.  Population-Oriented Simulated Annealing: A Genetic/Thermodynamic Hybrid Approach to Optimization , 1995, International Conference on Genetic Algorithms.

[9]  David E. Goldberg,et al.  Parallel Recombinative Simulated Annealing: A Genetic Algorithm , 1995, Parallel Comput..

[10]  Teodor Gabriel Crainic,et al.  Communication Issues in Designing Cooperative Multi-Thread Parallel Searches , 1996 .

[11]  Michel Gendreau,et al.  Toward a Taxonomy of Parallel Tabu Search Heuristics , 1997, INFORMS J. Comput..

[12]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[13]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

[14]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[17]  Pablo Moscato,et al.  An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search , 1993, Ann. Oper. Res..

[18]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[19]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[20]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

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

[22]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[23]  Gunar E. Liepins,et al.  Apga: an adaptive Parallel Genetic Algorithm , 1992, Computer Science and Operations Research.

[24]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .