Abstract
Cellular evolutionary algorithms (cEAs) use structured populations whose evolutionary cycle is governed by local interactions among individuals. This helps to prevent the premature convergence to local optima that usually takes place in panmictic populations. The present work extends cEAs by means of a message passing phase whose main effect is a more effective exploration of the search space. The mutated offspring that potentially replaces the original individual under cEAs is considered under message passing cellular evolutionary algorithms (MPcEAs) as a message sent from the original individual to itself. In MPcEAs, unlike in cEAs, a new message is sent from the original individual to each of its neighbors, representing a neighbor’s mutated offspring whose second parent is selected from the neighborhood of the original individual. Thus, every individual in the population ultimately receives one additional candidate for replacement from each of its neighbors rather than having a unique candidate. Experimental tests conducted in the domain of real function optimization for continuous search spaces show that, in general, MPcEAs significantly outperform cEAs in terms of effectiveness. Specifically, the best solution obtained through MPcEAs has an importantly improved fitness quality in comparison with that obtained by cEAs.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Availability of data and material
Upon request to the author.
References
Alba E, Dorronsoro B (2008) Cellular genetic algorithms. Springer, Berlin
Alba E, Troya JM (2000) Cellular evolutionary algorithms: Evaluating the influence of ratio. In: Proceedings of the international conference on parallel problem solving from nature (PPSN VI), pp 29–38
Alba E, Troya JM (2002) Improving flexibility and efficiency by adding parallelism to genetic algorithms. Stat Comput 12(2):91–114
Alba E, Dorronsoro B, Alfonso H (2005) Cellular memetic algorithms. J Comput Sci Technol 5(4):257–263
Alba E, Dorronsoro B, Luna F, Nebro AJ, Bouvry P, Hogie L (2007) A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs. Comput Commun 30(4):685–697
Bäck T, Fogel DB, Michalewicz Z (eds) (2000a) Evolutionary computation 1: basic algorithms and operators. Institute of Physics Publishing, Bristol
Bäck T, Fogel DB, Michalewicz Z (eds) (2000b) Evolutionary computation 2: advanced algorithms and operators. Institute of Physics Publishing, Bristol
Chiong R, Weise T, Michalewicz Z (2012) Variants of evolutionary algorithms for real-world applications. Springer, Berlin
Coello CA, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, Dordrecht
Collins RJ, Jefferson DR (1991) Selection in massively parallel genetic algorithms. In: Proceedings of the 4th international conference on genetic algorithms (ICGA-91), pp 249–256
de Jong KA (2006) Evolutionary computation: a unified approach. The MIT Press, Cambridge
Dittrich T, Elmenreich W (2015) Comparison of a spatially-structured cellular evolutionary algorithm to an evolutionary algorithm with panmictic population. In: Proceedings of the 12th international workshop on intelligent solutions in embedded systems (WISES 2015), pp 145–149
Dorronsoro B (2006) Diseño e implementación de algoritmos genéticos celulares para problemas complejos. PhD thesis, Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga
Dorronsoro B, Alba E (2006) A simple cellular genetic algorithm for continuous optimization. In: Proceedings of the 2006 IEEE congress on evolutionary computation (IEEE CEC 2006), pp 16–21
Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, Berlin
Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval schemata. In: Whitley LD (ed) Foundations of Genetic Algorithms 2. Morgan Kaufmann, San Mateo, CA, pp 187–202
Folino G, Pizzuti C, Spezzano G (1998) Combining cellular genetic algorithms and local search for solving satisfiability problems. In: Proceedings of the 10th IEEE international conference on tools with artificial intelligence (ICTAI 1998), pp 192–198
Gordon VS, Pirie R, Wachter A, Sharp S (1999) Terrain-based genetic algorithm (TBGA): Modeling parameter space as terrain. In: Proceedings of the genetic and evolutionary computation conference (GECCO 1999), pp 229–235
Gorges-Schleuter M (1989) ASPARAGOS: An asynchronous parallel genetic optimization strategy. In: Proceedings of the 3rd international conference on genetic algorithms (ICGA-89), pp 422–427
Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artif Intell Rev 12(4):265–319
Huy NQ, Soon OY, Hiot LM, Krasnogor N (2009) Adaptive cellular memetic algorithms. Evolut Comput 17(2):231–256
Janson S, Alba E, Dorronsoro B, Middendorf M (2006) Hierarchical cellular genetic algorithm. In: Proceedings of the 6th European conference on evolutionary computation in combinatorial optimization (EvoCOP 2006), pp 111–122
Liang JJ, Qu BY, Suganthan PN, Chen Q (2014) Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical Report 201411A, Computational Intelligence Laboratory, Zhengzhou University, China and Technical Report, Nanyang Technological University, Singapore
Luque G, Alba E, Dorronsoro B (2009a) Analyzing parallel cellular genetic algorithms. In: Alba E, Blum C, Asasi P, Coromoto L, Gómez JA (eds) Optimization Techniques for Solving Complex Problems. Wiley, New Jersey, pp 49–62
Luque G, Alba E, Dorronsoro B (2009b) An asynchronous parallel implementation of a cellular genetic algorithm for combinatorial optimization. In: Proceedings of the genetic and evolutionary computation conference (GECCO 2009), pp 1395–1402
Manderick B, Spiessens P (1989) Fine-grained parallel genetic algorithms. In: Proceedings of the 3rd international conference on genetic algorithms (ICGA-89), pp 428–433
Michalewicz Z (1992) Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, New York
Mühlenbein H (1989) Parallel genetic algorithms, population genetics, and combinatorial optimization. In: Proceedings of the 3rd international conference on genetic algorithms (ICGA-89), pp 416–421
Pettey CC (2000) Diffusion (cellular) models. In: Bäck T, Fogel DB, Michalewicz Z (eds) Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol, pp 125–133
Spiessens P, Manderick B (1991) A massively parallel genetic algorithm: Implementation and first analysis. In: Proceedings of the 4th international conference on genetic algorithms (ICGA-91), pp 279–286
Tomassini M (2005) Spatially structured evolutionary algorithms: artificial evolution in space and time. Springer, Berlin
Tomassini M (2010) Cellular evolutionary algorithms. In: Hoekstra AG, Kroc J, Sloot PMA (eds) Simulating Complex Systems by Cellular Automata. Springer, Berlin, pp 167–191
Whitley D (1993) Cellular genetic algorithms. In: Proceedings of the 5th international conference on genetic algorithms (ICGA-93), p 658
Wilensky U (1999) NetLogo. http://ccl.northwestern.edu/netlogo/, Center for Connected Learning and Computer Science, Northwestern University, Evanston, IL
Funding
No funding was received for conducting this study.
Author information
Authors and Affiliations
Contributions
Not applicable.
Corresponding author
Ethics declarations
Conflict of interest
The author has no conflicts of interest to declare that are relevant to the content of this article.
Code availability
Upon request to the author.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Galán, S.F. Extending cellular evolutionary algorithms with message passing. Soft Comput 25, 6271–6282 (2021). https://doi.org/10.1007/s00500-021-05612-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-021-05612-9