The impact of the mutation strategy on the quality of solution of parallel genetic algorithms

The paper is aimed at investigating the influence of the mutation strategy on the quality of solution of parallel evolutionary algorithms. Parallel computational model based on independent subpopulation evolutions on multicomputer platform is suggested. Several parallel strategies for variable mutation rate at subpopulation and individual levels are investigated and their impact on the quality of the solution is evaluated and analyzed for the case study of the traveling salesman problem. Hybrid programming model utilizing both message passing (MPI) and multithreading (OpenMP) is applied. Parallelism profiling and solution quality analysis are made for the purpose of estimating the efficiency of several parallel mutation strategies.

[1]  P. Borovska,et al.  Ieee International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications Migration Policies for Island Genetic Models on Multicomputer Platform , 2022 .

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

[3]  Marco Tomassini,et al.  Experimental Study of Multipopulation Parallel Genetic Programming , 2000, EuroGP.

[4]  Ron Shonkwiler,et al.  Parallel Genetic Algorithms , 1993, ICGA.

[5]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[6]  Prabhas Chongstitvatana,et al.  Parallel genetic algorithm with parameter adaptation , 2002, Inf. Process. Lett..

[7]  Colin R. Reeves,et al.  Genetic Algorithms: Principles and Perspectives: A Guide to Ga Theory , 2002 .

[8]  Eric Goodman,et al.  Investigations in meta-GAs: panaceas or pipe dreams? , 2005, GECCO '05.

[9]  Erick Cantú-Paz,et al.  Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms , 1999, GECCO.

[10]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[11]  Erick Cantú-Paz,et al.  Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms , 2001, J. Heuristics.

[12]  Jason M. Daida,et al.  An Individually Variable Mutation-Rate Strategy for Genetic Algorithms , 1997, Evolutionary Programming.

[13]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[14]  Joanna Lis,et al.  Parallel genetic algorithm with the dynamic control parameter , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[15]  William Rand,et al.  The problem with a self-adaptative mutation rate in some environments: a case study using the shaky ladder hyperplane-defined functions , 2005, GECCO '05.

[16]  Thomas Bäck,et al.  Evolutionary Algorithms: The Role of Mutation and Recombination , 2000 .

[17]  Kiyoshi Tanaka,et al.  Parallel cooperative-competitive self-adaptive mutation in genetic algorithms , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).