Building-block supply in real-coded genetic algorithms: A first step on the population-sizing model

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 7, 2006, Pages 2072-2078

  Ahn, Chang Wook ^a,b   Ramakrishna, Rudrapatna S ^a  

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

^b Samsung Advanced Institute of Technology (SAIT)   (South Korea)

Author keywords

Absorbing set; Building block supply; Real coded genetic algorithms; The population sizing model; Virtual cardinality

Indexed keywords

ADAPTIVE SYSTEMS; CODES (SYMBOLS); COMPUTER SCIENCE; MATHEMATICAL MODELS; SCHEMATIC DIAGRAMS;

ABSORBING SET; BUILDING-BLOCK SUPPLY; REAL-CODED GENETIC ALGORITHMS (RGAS); THE POPULATION-SIZING MODEL; VIRTUAL CARDINALITY;

GENETIC ALGORITHMS;

EID: 33747876399     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.7.2072     Document Type: Article

References (25)

1. R.L. Haupt and S.E. Haupt, Practical Genetic Algorithms, John Wiley & Sons, 1998.
2. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
3. D.E. Goldberg, "Real-coded genetic algorithms, virtual alphabets, and blocking," Complex Systems, vol.5, pp.139-167, 1991.
4. L.J. Eshelman and J.D. Schaffer, "Real-coded genetic algorithms and interval-schemata," Foundations of Genetic Algorithms, vol.2, pp.187-202, 1993.
5. X. Qi and F. Palmieri, "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, Part I: Basic properties of selection and mutation," IEEE Trans. Neural Netw., vol.5, no.1, pp.102-119, Jan. 1994.
6. X. Qi and F. Palmieri, "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, Part II: Analysis of the diversification role of crossover," IEEE Trans. Neural Netw., vol.5, no.1, pp.120-129, Jan. 1994.
7. H. Kita, I. Ono, and S. Kobayashi, "Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms," Proc. IEEE ICEC, pp.529-534, 1998.
8. I. Ono and S. Kobayashi, "A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover," Proc. 7th ICGA, pp.246-253, 1997.
9. S. Tsutsui, D.E. Goldberg, and K. Sastry, "Linkage learning in real-coded GAs with simplex crossover," Proc. EA'01, pp.73-84, 2001.
10. K. Deb, A. Anand, and D. Joshi, "A computationally efficient evolutionary algorithm for real-parameter optimization," Evolutionary Computation, vol.10, no.4, pp.371-395, 2002.
11. Q. Zhang and H. Mühlenbein, "On the convergence of a class of estimation of distribution algorithms," IEEE Trans. Evol. Comput., vol.8, no.2, pp.127-136, 2004.
12. D.E. Goldberg, K. Sastry, and T. Latoza, "On the supply of building blocks," Proc. GECCO'01, pp.336-342, 2001. [Online] Available: ftp://ftp-illigal.ge.uiuc.edU/pub/papers/IlliGALs/2001015.ps.Z
13. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
14. D.E. Goldberg, "Sizing populations for serial and parallel genetic algorithms," Proc. Third International Conference on Genetic Algorithms, pp. 70-79, 1989.
15. C. Reeves, "Using genetic algorithms with small populations," Proc. Fifth International Conference on Genetic Algorithms, pp.92-99, 1993.
16. K. Sastry, U.M. O'Reilly, D.E. Goldberg, and D. Hill, "Building-block supply in genetic programming," IlliGAL Report no.200312, University of Illinois at Urbana-Champaign, April 2003.
17. W.G. Macready and D.H. Wolpert, "Bandit problems and the exploration/exploitation tradeoff," IEEE Trans. Evol. Comput., vol.2, no.1,pp.2-22, 1998.
18. K.A. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Doctoral Dissertation, University of Michigan, Ann Arbor, MI, 1975.
19. D.E. Goldberg, K. Deb, and J.H. Clark, "Genetic algorithms, noise, and the sizing of populations," Complex Systems, vol.6, no.4, pp.333-362, 1992.
20. D.E. Goldberg and M. Rudnick, "Genetic algorithms and the variance of fitness," Complex Systems, vol.5, no.3, pp.265-278, 1991.
21. G. Harik, E. Cantú-Paz, D.E. Goldberg, and B.L. Miller, "The gambler's ruin problem, genetic algorithms, and the sizing of populations," Evolutionary Computation, vol.7, no.3, pp.231-253, 1999.
22. 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, no.6, pp.566-579, 2002.
23. C.W. Ahn, R.S. Ramakrishna, and D.E. Goldberg, "The real-coded Bayesian optimization algorithm: Bringing the strength of BOA into the continuous world," Genetic and Evolutionary Computation Conference - GECCO, Lecture Notes in Computer Science 3102, pp.840-851, 2004.
24. M. Pelikan, K. Sastry, and D.E. Goldberg, "Scalability of the Bayesian optimization algorithm," International Journal of Approximation Reasoning, vol.31, pp.221-258, 2002.
25. P.A.N. Bosman, Design and Application of Iterated Density-Estimation Evolutionary Algorithms, Ph.D. Dissertation, Utrecht University, TB Utrecht, The Netherlands, 2003.