Elitism-based compact genetic algorithms

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 4, 2003, Pages 367-385

  Ahn, Chang Wook ^a   Ramakrishna, R S ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

Author keywords

Compact genetic algorithms; Elitism; Genetic diversity; Selection pressure; Speedup

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; COSTS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; PROBLEM SOLVING; VECTORS;

ELITISM;

GENETIC ALGORITHMS;

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

References (32)

1. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
2. T. Bäck, D. B. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation. New York: Inst. Physics Publishing and Oxford Univ. Press, 1997.
3. D. E. Goldberg and M. Rundnick, "Genetic algorithms and the variance of fitness," Complex Syst., vol. 5, no. 3, pp. 265-278, 1991.
4. D. E. Goldberg, K. Deb, and J. H. Clark, "Genetic algorithms, noise, and the sizing of populations," Complex Syst., vol. 6, no. 4, pp. 333-362, 1992.
5. G. Harik, E. Cantǔ-Paz, D. E. Goldberg, and B. L. Miller, "The Gambler's ruin problem, genetic algorithms, and the sizing of populations," Evol. Comput., vol. 7, pp. 231-253, 1999.
6. K. Sastry and D. E. Goldberg, "Modeling tournament selection with replacement using apparent added noise," in Intelligent Engineering Systems Through Artificial Neural Networks. New York: ASME, 2001, vol. 11, pp. 129-134.
7. C. W. Ahn and R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations," IEEE Trans. Evol. Comput., vol. 6, pp. 566-579, Dec. 2002.
8. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, pp. 495-511, Oct. 2002.
9. G. Harik, F. G. Lobo, and D. E. Goldberg, "The compact genetic algorithm," IEEE Trans. Evol. Comput., vol. 3, pp. 287-297, Nov. 1999.
10. S. Tsutsui, "Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram," in Parallel Problem Solving from Nature - PPSN VII (Lecture Notes in Computer Science, Vol. 2439), J. J. M. Guervós, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 2002, pp. 224-233.
11. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Boston, MA: Kluwer, 2002.
12. G. Harik, "Linkage learning via probabilistic modeling in the ECGA," Univ. Illinois at Urbana-Champaign, Illinois Genetic Algorithms Lab., Urbana, IL, IlliGAL Rep. 99010, 1999.
13. K. Sastry and D. E. Goldberg, "On extended compact genetic algorithm," in Proc. Late Breaking Papers in Genetic and Evolutionary Computation Conf. (GECCO). San Francisco, CA, 2000, pp. 352-359.
14. R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol Comput., vol. 5, pp. 613-622, Dec. 2001.
15. J. I. Hidalgo, J. Lanchars, A. Ibarra, and R. Hermida, "A hybrid evolutionary algorithm for multi-FPGA systems design," in Proc. Euromicro Symp. Digital System Design (DSD), 2002, pp. 60-67.
16. D. Dumitrescu, B. Lazzerini, L. C. Jain, and A. Dumitrescu, Evolutionary Computation. Boca Raton, FL: CRC Press, 2000.
17. P. M. Reed, B. S. Minsker, and D. E. Goldberg, "The practitioner's role in competent search and optimization using genetic algorithms," presented at the World Water and Environmental Resources Congress, Washington, DC, 2001. ISBN 0-7844-0569-7.
18. A. Rogers and A. P. Bennett, "Genetic drift in genetic algorithm selection schemes," IEEE Trans. Evol. Comput., vol. 3, pp. 298-303, Nov. 1999.
19. G. Rudolph, "Self-adaptive mutations may lead to premature convergence," IEEE Trans. Evol. Comput., vol. 5, pp. 410-414, Aug. 2001.
20. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, pp. 82-102, July 1999.
21. C. Y. Lee and X. Yao, "Evolutionary algorithms with adaptive lévy mutations," Proc. IEEE Congress on Evol. Comput. (CEC), pp. 568-575, 2001.
22. H. Mülenbein and D. Schlierkamp-Voosen, "Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization," Evol. Comput., vol. 1, no. 1, pp. 25-49, 1993.
23. T. Bäck, "Generalized convergence models for tournament- and (μ, λ)-selection," in Proc. 6th Int. Conf. Genetic Algorithms. San Francisco, CA, 1995, pp. 2-8.
24. D. Thierens, "Selection schemes, elitist recombination, and selection intensity," in Proc. 7th Int. Conf. Genetic Algorithms. San Francisco, CA, 1997, pp. 152-159.
25. H. Mülenbein and D. Schlierkamp-Voosen, "The science of breeding and its application to the breeder genetic algorithm (BGA)," Evol. Comput., vol. 1, no. 4, pp. 335-360, 1993.
26. E. Cantǔ-Paz, Efficient and Accurate Parallel Genetic Algorithms, Norwell, MA: Kluwer, 2000.
27. K. Deb and D. E. Goldberg, "Analyzing deception in trap functions," in Foundations of Genetic Algorithms, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 93-108.
28. S. D. Müller, J. Marchetto, S. Airaghi, and P. Koumoutsakos, "Optimization based on bacterial chemotaxis," IEEE Trans. Evol. Comput., vol. 6, pp. 16-29, Feb. 2002.
29. J. D. Schanffer, R. A. Caruana, L. J. Eshelman, and R. Das, "A study of control parameters affecting online performance of genetic algorithms for function optimization," in Proc. 3rd Int. Conf. Genetic Algorithms, J. D. Schaffer, Ed., San Francisco, CA, 1989, pp. 51-59.
30. M. Pelikan, D. E. Goldberg, and E. Cantǔ-Paz, "Linkage Problem, Distribution Estimation, and Bayesian Networks," Univ. Illinois at Urbana-Champaign, Illinois Genetic Algorithms Lab., Urbana, IL, IlliGAL Rep. 98013, 1998.
31. C. V. Hoyweghen, "Detecting spin-flip symmetry in optimization problems," in Theoretical Aspects of Evolutionary Computing (Natural Computing Series), L. Kallel, B. Naudts, and A. Rogers, Eds, Berlin, Germany: Springer-Verlag, 2001, pp. 423-437.
32. [Online]. Available: http://www.informatik.uni-koeln.de/ls-juenger/pro jects/sgs.html