PARMETAOPT — Parallel metaheuristics framework for combinatorial optimization problems

The paper presents an experimental parallel metaheuristics framework for solving combinatorial optimization of grand challenge scientific and engineering problems that has been developed based on biologically inspired metaheuristics, modeling of social behavior and cultural evolution as well as trajectory-based methods. A prototype class library for metaheuristics is developed and several parallel computational models of metaheuristics for solving combinatorial optimization problems are implemented. The library contains implementations in C++ of parallel computational models for both population based and trajectory based metaheuristics. Some improvements in the parallel models are suggested and implemented in the library PARMETAOPT. The influence of the parameters on the performance of some of the parallel algorithms is analyzed using the developed parallel metaheuristics framework and performance tuning rules are suggested. The implementations are based on message passing with MPICH2 for the flat programming models and OpenMP API is used for multithreading in the hybrid programming models.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  Fred Glover,et al.  Solving Combinatorial Optimization Problems Via Reformulation and Adaptive Memory Metaheuristics , 2004 .

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

[4]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[5]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[6]  Johann Dréo,et al.  Metaheuristics for Hard Optimization: Methods and Case Studies , 2005 .

[7]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[8]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[9]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[10]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[11]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[12]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[13]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[14]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[16]  S. E. Karisch,et al.  QAPLIB-A quadratic assignment problem library , 1991 .

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

[18]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[19]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[20]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[21]  Russell C. Eberhart,et al.  Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization , 2002 .

[22]  Constantino Tsallis,et al.  Optimization by Simulated Annealing: Recent Progress , 1995 .

[23]  Andreas Fink.  Reusable Metaheuristic Software Components and their Application via Software Generators , 2001 .

[24]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[25]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

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