Abstract
This paper presents a comparative study of several asynchronous policies for updating the population in a cellular genetic algorithm (cGA). Cellular GA’s are regular GA’s with the important exception that individuals are placed in a given geographical distribution (usually a 2-d grid). Operators are applied locally on a set made of each individual and the surrounding neighbors, thus promoting intraneighborhood exploitation and inter-neighborhood exploration of the search space. Here, we analyze the respective advantages and drawbacks of dealing with this decentralized population in the traditional synchronous manner or in several possible asynchronous update policies. Asynchronous behavior has proven to be better in many domains such as cellular automata and distributed GA’s, which, in turn, is also the main conclusion of this work. We will undergo a structured analysis on a set of problems with different features in order to get well grounded conclusions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Alba and J. M. Troya. Cellular evolutionary algorithms: Evaluating the in-fluence of ratio. In M. Schoenauer et al., editor, Parallel Problem Solving from Nature, PPSN VI, volume 1917 of Lecture Notes in Computer Science, pages 29–38. Springer-Verlag, 2000.
E. Alba and J. M. Troya. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Computer Systems, 17:451–465, January 2001.
M. Capcarrère, M. Tomassini, A. Tettamanzi, and M. Sipper. A statistical study of a class of cellular evolutionary algorithms. Evolutionary Computation, 7(3):255–274, 1999.
K. Deb D. E. Goldberg and J. Horn. Massively multimodality, deception and genetic algorithms. In R. Männer and B. Manderick, editors, Proceedings of the PPSN II, pages 37–46. North-Holland, 1992.
M. Gorges-Schleuter. ASPARAGOS an asynchronous parallel genetic optimisation strategy. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 422–427. Morgan Kaufmann, 1989.
M. Gorges-Schleuter. An analysis of local selection in evolution strategies. In Genetic and evolutionary conference, GECCO99, volume 1, pages 847–854. Morgan Kaufmann, San Francisco, CA, 1999.
T. E. Ingerson and R. L. Buvel. Structure in asynchronous cellular automata. Physica D, 10:59–68, 1984.
K. A. De Jong, M. A. Potter, and W. M. Spears. Using problem generators to explore the effects of epistasis. In T. Bäck, editor, Proceedings of the Seventh ICGA, pages 338–345. Morgan Kaufmann, 1997.
B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithms. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 428–433. Morgan Kaufmann, 1989.
D. Corne S. Tsutsui, A. Ghosh and Y. Fujimoto. A real coded genetic algorithm with an explorer and an exploiter populations. In T. Bäck, editor, Proceedings of the Seventh ICGA, pages 238–245. Morgan Kaufmann, 1997.
J. Sarma and K. A. De Jong. An analysis of the effect of the neighborhood size and shape on local selection algorithms. In H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, editors, Parallel Problem Solving from Nature (PPSN IV), volume 1141 of Lecture Notes in Computer Science, pages 236–244. Springer-Verlag, Heidelberg, 1996.
J. Sarma and K. A. De Jong. An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In T. Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 181–186. Morgan Kaufmann, 1997.
B. Schönfisch and A. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123–143, 1999.
M. Sipper, M. Tomassini, and M. S. Capcarrere. Evolving asynchronous and scalable non-uniform cellular automata. In G. D. Smith, N. C. Steele, and R. F. Albrecht, editors, Proceedings of International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA97), pages 67–71. Springer-Verlag, Vienna, 1997.
M. Tomassini. The parallel genetic cellular automata: Application to global function optimization. In R. F. Albrecht, C. R. Reeves, and N. C. Steele, editors, Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pages 385–391. Springer-Verlag, 1993.
D. Whitley. Cellular genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 658. Morgan Kaufmann Publishers, San Mateo, California, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alba, E., Giacobini, M., Tomassini, M., Romero, S. (2002). Comparing Synchronous and Asynchronous Cellular Genetic Algorithms. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_58
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive