The exploration/exploitation tradeoff in dynamic cellular genetic algorithms

IEEE Transactions on Evolutionary Computation

Volumn 9, Issue 2, 2005, Pages 126-142

  Alba, Enrique ^a   Dorronsoro, Bernabé ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Cellular genetic algorithm (cGA); Dynamic adaptation; Evolutionary algorithm (EA); Neighborhood to population ratio

Indexed keywords

AUTOMATA THEORY; CELLULAR ARRAYS; EVOLUTIONARY ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

CELLULAR AUTOMATA; CELLULAR GENETIC ALGORTHM; DYNAMIC ADAPTATION; NEIGHBORHOOD-TO-POPULATION RATIO;

GENETIC ALGORITHMS;

EID: 17644380954     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2005.843751     Document Type: Article

References (40)

1. T. Bäck. D. Fogel, and Z. Michalewicz. Eds., Handbook of Evolutionary Computation. London. U.K.: Oxford Univ. Press. 1997.
2. E. Cantú-Paz, Efficient and Accurate Parallel Genetic Algorithms 2nd ed. ser. Book Series on Genetic Algorithms and Evolutionary Computation. Norwell, MA: Kluwer, 2000, vol. I.
3. E. Alba and M. Tomassini, "Parallelism and evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 443-462, Oct. 2002.
4. E. Alba and J. Troya, "Improving flexibility and efficiency by adding parallelism to genetic algorithms," Statist. Comput., vol. 12, no. 2, pp. 91-114, 2002.
5. B. Manderick and P. Spiessens, "Fine-grained parallel genetic algorithm," in Proc. 3rd Int. Conf. Genetic Algorithms, J. Schaffer, Ed., 1989, pp. 428-133.
6. Q. Zhang and H. Muhlenbein, "On the convergence of a class of estimation of distribution algorithms," IEEE Trans. Evol.. Comput. vol. 8, no. 2, pp. 127-136, Apr. 2004.
7. P. Spiessens and B. Manderick, "A massively parallel genetic algorithm," in Proc. 4th Int. Conf. Genetic Algorithms, R. Bclew and L. Booker, Eds., 1991, pp. 279-286.
8. S. Baluja, "Structure and performance of fine-grain parallelism in genetic search," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest. Ed., 1993, pp. 155-162.
9. H. Mühlenbein, M. Schomish, and J. Born, "The parallel genetic algorithm as a function optimizer," Parallel Comput., vol. 17, pp. 619-632, 1991.
10. K. Ku, M. Mak, and W. Siu, "Adding learning to cellular genetic algorithms for training recurrent neural networks," IEEE Trans. Neural Netw., vol. 10, no. 2, pp. 239-252, Mar. 1999.
11. G. Folino, C. Pizzuti, and G. Spezzano, "Parallel hybrid method for SAT that couples genetic algorithms and local search," IEEE Trans. Evol. Comput., vol. 5, no. 4, pp. 323-334, Aug. 2001.
12. M. Tomassini, "The parallel genetic cellular automata: Application to global function optimization," in Proc. Int. Conf. Artif. Neural Netw. Genetic Algorithms, R. Albrecht, C. Reeves, and N. Steele, Eds, 1993, pp. 385-391.
13. D. Whitley, "Cellular genetic algorithms," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed., 1993, p. 658.
14. V. Gordon and D. Whitley, "Serial and parallel genetic algorithms as function optimizers," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed., 1993, pp. 177-183.
15. J. Sarma and K. De Jong, "An analysis of the effect of the neighborhood size and shape on local selection algorithms," in Lecture Notes in Computer Science, H. Voigt, W. Ebeling, I. Rechenberg, and H. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. 1141, Proc. Int. Conf. Parallel Prob. Solving from Nature IV, pp. 236-244.
16. J. Sarma and K. De Jong, "An analysis of local selection algorithms in a spatially structured evolutionary algorithm," in Proc. 7th Int. Conf. Genetic Algorithms, T. Bäck, Ed., 1997, pp. 181-186.
17. E. Alba and J. Troya, "Cellular evolutionary algorithms: Evaluating the influence of ratio," in Lecture Notes in Computer Science, vol. 1917, Proc. Int. Conf. Parallel Prob. Solving from Nature VI, M. Schoenauer, Ed.. Berlin, Germany, 2000, pp. 29-38.
18. M. Giacobini, E. Alba, and M. Tomassini, "Selection intensity in asynchronous cellular evolutionary algorithms," in Proc. Genetic Evol. Comput. Conf., 2003, pp. 955-966.
19. F. Herrera and M. Lozano, "Gradual distributed real-coded genetic algorithms," IEEE Trans. Evol. Comput., vol. 4, no. 1, pp. 43-62, Apr. 2000.
20. P. Adamidis and V. Petridis, "Co-operating populations with different evolution behaviors," in Proc. 3rd IEEE Conf. Evol. Comput., 1996, pp. 188-191.
21. Handbook of Applied Optimization. Memetic Algorithms. P. Pardalos and M. Resende. Eds., Oxford Univ. Press, London, U.K., 2000. P. Moscato.
22. Y. Ong and A. Keane, "Meta-Lamarckian teaming in memetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
23. R. Hinterding, Z. Michalewicz, and A. Eiben, "Adaptation in evolutionary computation: A survey," in Proc. IEEE Conf. Evol. Comput., IEEE World Congr. Comput. Intell., 1997, pp. 65-69.
24. T. Bäck, "Introduction to the special issue: Self-adaptation," Evol. Comput., vol. 9, no. 2, pp. iii-iv, 2001.
25. P. Angeline, "Adaptive and self-adaptive evolutionary computations," in Computational Intelligence: A Dynamic Systems Perspective, M. Palaniswami and Y. Attikiouzel, Eds. Piscataway, NJ: IEEE Press, 1995, pp. 152-163.
26. L. Davis, "Adapting operator probabilities in genetic algorithms," in Proc. 3rd Int. Conf. Genetic Algorithms, J. Schaffer. Ed., 1989. pp. 61-69.
27. J. Arabas, Z. Michalewicz, and J. Mulawka, "GAVaPS-A genetic algorithm with varying population size," in Proc. IEEE Conf. Evol. Comput., vol. 1, 1994, pp. 73-78.
28. D. Schlierkamp-Voosen and H. Mühlenbein, "Adaption of population sizes by competing subpopulations," in Proc. IEEE Conf. Evol. Comput., 1996, pp. 330-335.
29. D. Whitley, S. Rana, J. Dzubera, and K. Mathias, "Evaluating evolutionary algorithms," Artif. Intell., vol. 85, pp. 245-276, 1997.
30. D. Goldberg, K. Deb, and J. Horn, "Massively multimodaliry, deception, and genetic algorithms," in Proc. Int. Conf. Parallel Prob. Solving from Nature II, R. Männer and B. Manderick, Eds., 1992, pp. 37-46.
31. S. Tsutsui and Y. Fujimoto, "Forking genetic algorithm with blocking and shrinking modes," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed., 1993, pp. 206-213.
32. K. De Jong, M. Potter, and W. Spears, "Using problem generators to explore the effects of epistasis," in Proc. 7th Int. Conf. Genetic Algorithms, T. Bäck, Ed., 1997, pp. 338-345.
33. S. Droste, T. Jansen, and I. Wegener, "A natural and simple function which is hard for all evolutionary algorithms," in Proc. 3rd Asia-Pacific Conf. Simulated Evol. Learning, 2000, pp. 2704-2709.
34. C. Papadimitriou, Computational Complexity. Reading, MA: Addison-Wesley, 1994.
35. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.
36. H. Chen, N. Flann, and D. Watson, "Parallel genetic simulated annealing: A massively parallel SIMD algorithm," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 2, pp. 126-136, 1998.
37. S. Khuri, T. Bäck, and J. Heitkötter, "An evolutionary approach to combinatorial optimization problems," in Proc. 22nd ACM Comput. Sci. Conf., 1994, pp. 66-73.
38. D. Stinson, An Introduction to the Design and Analysis of Algorithms 2nd ed. Winnipeg, MB, Canada: The Charles Babbage Research Center, 1985, 1987.
39. J. Smith and F. Vavak, "Replacement strategies in steady state genetic algorithms: Static environments," in Foundations of Genetic Algorithms V, W. Banzhaf and C. Reeves, Eds: Morgan Kaufmann, 1998, pp. 219-234.
40. D. Wolpert and W. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.