Subpopulation Diversity Based Setting Success Rate of Migration for Distributed Evolutionary Algorithms

In most of distributed evolutionary algorithms (DEAs), migration interval is used to decide the frequent of migration. Nevertheless, a predetermined interval cannot match the dynamic situation of evolution. Consequently, migration may happen at a wrong moment and just exert a negative influence to evolution. In this paper, a scheme of setting the success rate of migration based on subpopulation diversity is proposed. In the scheme, migration still happens at intervals, but the probability of immigrants entering the target subpopulation will be decided by the diversity of this subpopulation. An analysis shows that the extra time consumption for our scheme in a DEA is acceptable. In our experiments, outcomes of the DEA based on the proposed scheme are compared with those of a traditional DEA on six benchmark instances of the Traveling Salesman Problem. The results show that the former performs better than its peer. Moreover, the DEA based on our scheme shows an advantage in stability.

[1]  W Bossert,et al.  Mathematical optimization: are there abstract limits on natural selection? , 1967, The Wistar Institute symposium monograph.

[2]  Evandro Parente,et al.  A hybrid shared/distributed memory parallel genetic algorithm for optimization of laminate composites , 2014 .

[3]  Pei-Chann Chang,et al.  Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems , 2010, Expert Syst. Appl..

[4]  Conor Ryan,et al.  Promoting diversity using migration strategies in distributed genetic algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  Dana S. Richards,et al.  Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.

[6]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[7]  Khaled Ghedira,et al.  Distributed genetic algorithm for disaster relief planning , 2013, Int. J. Comput. Commun. Control.

[8]  Francisco Herrera,et al.  Hierarchical distributed genetic algorithms , 1999 .

[9]  U. Tosun,et al.  A robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem , 2013 .

[10]  Jörg Denzinger,et al.  Improving migration by diversity , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[11]  Ruben Usamentiaga,et al.  A Parallel Genetic Algorithm for Optimizing an Industrial Inspection System , 2013, IEEE Latin America Transactions.

[12]  Jeng-Shyang Pan,et al.  Ant colony system with communication strategies , 2004, Inf. Sci..

[13]  Cai Zhi,et al.  An Improved Evolutionary Algorithm for the Traveling Salesman Problem , 2005 .

[14]  Samuel Eilon,et al.  AN EVALUATION OF ALTERNATIVE INVENTORY CONTROL POLICIES , 1968 .

[15]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

[16]  Chengjun Li,et al.  Global migration strategy with moving colony for hierarchical distributed evolutionary algorithms , 2014, Soft Comput..

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[18]  Jeng-Shyang Pan,et al.  A Parallel Particle Swarm Optimization Algorithm with Communication Strategies , 2005, J. Inf. Sci. Eng..

[19]  Zbigniew Skolicki,et al.  The influence of migration sizes and intervals on island models , 2005, GECCO '05.

[20]  Paul S. Moorhead,et al.  Mathematical challenges to the neo-Darwinian interpretation of evolution , 1967 .

[21]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

[22]  Ludovic Duponchel,et al.  Simultaneous data pre-processing and SVM classification model selection based on a parallel genetic algorithm applied to spectroscopic data of olive oils. , 2014, Food chemistry.

[23]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .