The influence of grid shape and asynchronicity on cellular evolutionary algorithms

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 2, Issue , 2004, Pages 2152-2158

  Dorronsoro, Bernabé ^a   Alba, Enrique ^a   Giacobini, Mario ^b   Tomassini, Marco ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSITY OF LAUSANNE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA (CA); CELLULAR EVOLUTIONARY ALGORITHMS; GRID SHAPE;

AUTOMATA THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; POPULATION STATISTICS; PROBLEM SOLVING; SYNCHRONIZATION; TOPOLOGY;

EVOLUTIONARY ALGORITHMS;

EID: 4344693922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Gorges-Schleuter, " ASPARAGOS an asynchronous parallel genetic optimisation strategy," in Proc. of the 3th Int. Conference on Genetic Algorithms, ICGA89, J. D. Schaffer, Ed. 1989, pp. 422-427, Morgan Kaufmann.
2. B. Manderick and P. Spiessens, " Fine-grained parallel genetic algorithms," in Proc. of the 3th Int. Conference on Genetic Algorithms, ICGA89, J. D. Schaffer, Ed. 1989, pp. 428-433, Morgan Kaufmann.
3. E. Alba and M. Tomassini, " Parallelism and evolutionary algorithms," IEEE Trans. on Evolutionary Computation, vol. 6, no. 5, pp. 443-462, October 2002.
4. M. Gorges-Schleuter, " An analysis of local selection in evolution strategies," in Proc. of the Genetic and Evolutionary Computation Conference, GECCO99. 1999, vol. 1, pp. 847-854, Morgan Kaufmann, San Francisco, CA.
5. J. Sarma and K. A. De Jong, " An analysis of local selection algorithms in a spatially structured evolutionary algorithm," in Proc. of the 7th Int. Conference on Genetic Algorithms, ICGA97, T. Back, Ed. 1997, pp. 181-186, Morgan Kaufmann.
6. J. Sarma and K. A. De Jong, " An analysis of the effect of the neighborhood size and shape on local selection algorithms," in Parallel Problem Solving from Nature, PPSN IV, H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, Eds. 1996, vol. 1141 of Lecture Notes in Computer Science, pp. 236-244, Springer-Verlag, Heidelberg.
7. E. Alba and J. M. Troya, " Cellular evolutionary algorithms: Evaluating the influence of ratio," in Parallel Problem Solving from Nature, PPSN VI, M. Schoenauer et al., Ed. 2000, vol. 1917 of Lecture Notes in Computer Science, pp. 29-38, Springer-Verlag.
8. M. Tomassini, " The parallel genetic cellular automata: Application to global function optimization," in Proc. of the Int. Conference on Artificial Neural Networks and Genetic Algorithms, ICANNGA93, R. F. Albrecht, C. R. Reeves, and N. C. Steele, Eds. 1993, pp. 385-391, Springer-Verlag.
9. D. Whitley, " Cellular genetic algorithms," in Proc. of the 5th Int. Conference on Genetic Algorithms, ICGA93, S. Forrest, Ed. 1993, p. 658, Morgan Kaufmann Publishers, San Mateo, California.
10. B. Schönfisch and A. de Roos, " Synchronous and asynchronous updating in cellular automata," BioSystems, vol. 51, pp. 123-143, 1999.
11. M. Sipper, M. Tomassini, and M. S. Capcarrere, " Evolving asynchronous and scalable non-uniform cellular automata," in Proc. of Int. Conference on Artificial Neural Networks and Genetic Algorithms, ICANNGA97. 1998, pp. 67-71, Springer-Verlag KG, Vienna.
12. F. Herrera and M. Lozano, " Gradual distributed real-coded genetic algorithms," IEEE Trans. on Evolutionary Computation, vol. 4, no. 1, pp. 43-62, April 2000.
13. P. Adamidis and V. Petridis, " Co-operating populations with different evolution behaviours," in 3rd IEEE Conference Evolutionary Computation, CEC96. 1996, pp. 188-191, IEEE Press.
14. P. Moscato, Handbook of Applied Optimization, chapter Memetic Algorithms, Oxford University Press, 2000.
15. D. E. Goldberg and K. Deb, " A comparative analysis of selection schemes used in genetic algorithms," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. 1991, pp. 69-93, Morgan Kaufmann.
16. M. Giacobini, E. Alba, and M. Tomassini, " Selection intensity in asynchronous cellular evolutionary algorithms," in Proc. of the Genetic and Evolutionary Computation Conference, GECCO03, E. Cantú-Paz et al., Ed. 2003, pp. 955-966, Springer Verlag, Berlin.
17. D. Whitley, S. Rana, J. Dzubera, and K. E. Mathias, " Evaluating evolutionary algorithms," Artif. Intelligence, vol. 85, pp. 245-276, 1997.
18. D. E. Goldberg, K. Deb, and J. Horn, " Massively multimodality, deception and genetic algorithms," in Parallel Problem Solving from Nature, PPSN II, R. Männer and B. Manderick, Eds. 1992, pp. 37-46, North-Holland.
19. K. A. De Jong, M. A. Potter, and W. M. Spears, " Using problem generators to explore the effects of epistasis," in Proc. of the 7th Int. Conference on Genetic Algorithms, ICGA97, T. Bäck, Ed. 1997, pp. 338-345, Morgan Kaufmann.
20. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
21. H. Chen, N. S. Flann, and D. W. Watson, " Parallel genetic simulated annealing: A massively parallel SIMD algorithm," IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 2, pp. 126-136, 1998.
22. S. Khuri, T. Bäck, and J. Heitkötter, " An evolutionary approach to combinatorial optimization problems," in Proc. of the 22nd ACM Comp. Science Conference, Phoenix, Arizona, 1994, pp. 66-73, ACM Press.
23. G. Folino, C. Pizzuti, and G. Spezzano, " Parallel hybrid method for SAT that couples genetic algorithms and local search," IEEE Trans. on Evolutionary Computation, vol. 5, no. 4, pp. 323-334, Aug. 2001.
24. E. Alba and B. Dorronsoro, " The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms," Submitted, 2003.