Population sizing to go: Online adaptation using noise and substructural measurements

Studies in Computational Intelligence

Volumn 54, Issue , 2007, Pages 205-223

  Yu, Tian Li ^a,b   Sastry, Kumara ^a,c   Goldberg, David E ^a,c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147129878     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-69432-8_10     Document Type: Article

References (28)

1. K. Deb and D. E. Goldberg. Analyzing deception in trap functions. Foundations of Genetic Algorithms 2, pages 93-108, 1993.
2. D. E. Goldberg. Using time efficiently: Genetic-evolutionary algorithms and the continuation problem. Proceedings of the Genetic and Evolutionary Computation Conference, pages 212-219, 1999.
3. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992. (Also IlliGAL Report No. 91010).
4. David E. Goldberg. Sizing populations for serial and parallel genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, pages 70-79, 1989.
5. David E. Goldberg. The race, the hurdle, and the sweet spot: Lessons from genetic algorithms for the automation of design innovation and creativity. In P. Bentley, editor, Evolutionary Design by Computers chapter 4, pages 105-118. Morgan Kaufmann, San Mateo, CA, 1999.
6. David E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Boston, MA, 2002.
7. David E. Goldberg, Kumara Sastry, and Thomas Latoza. On the supply of building blocks. Proceedings of the Genetic and Evolutionary Computation Conference, pages 336-342, 2001.
8. G. Harik. Linkage Learning via Probabilistic Modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Urbana, IL, February 1999.
9. 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, 7(3):231-253, 1999. (Also IlliGAL Report No. 96004).
10. G.R. Harik and F.G. Lobo. A parameter-less genetic algorithm. Proceedings of the Genetic and Evolutionary Computation Conference, pages 258-265, 1999.
11. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.
12. Fernando Lobo. The parameter-less genetic algorithm: Rational and automated parameter selection for simplified genetic algorithm operation phdthesis, University of Lisbon, Portugal, July 2000.
13. M. Munetomo and D. E. Goldberg. Identifying linkage groups by nonlinearity/non-monotonicity detection. Proceedings of the Genetic and Evolutionary Computation Conference 1999: Volume 1, pages 433-440, 1999.
14. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. Bayesian optimization algorithm, population sizing, and time to convergence. Proceedings of the Genetic and Evolutionary Computation Conference, pages 275-282, 2000. (Also IlliGAL Report No. 2000001).
15. M. Pelikan, K. Sastry, and D.E. Goldberg. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258, 2003. (Also IlliGAL Report No. 2002024).
16. Martin Pelikan and Tz-Kai Lin. Parameter-less hierarchical boa. Proceedings of Genetic and Evolutionary Computation Conference 2004 (GECCO-2004), pages 24-35, 2004.
17. Martin Pelikan and Fernando Lobo. Parameter-less genetic algorithm: A worst-case time and space complexity analysis. IlliGAL Report No. 99014, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, 1999.
18. C.R. Reeves. Using genetic algorithms with small populations. Proceedings of the Fifth International Conference on Genetic Algorithms pages 92-99, 1993.
19. K. Sastry and D. E. Goldberg. On extended compact genetic algorithm. Late-Breaking Paper at the Genetic and Evolutionary Computation Conference, pages 352-359, 2000. (Also IlliGAL Report No. 2000026).
20. K. Sastry and D. E. Goldberg. Designing competent mutation operators via probabilistic model building of neighborhoods. Proceedings of the 2004 Genetic and Evolutionary Computation Conference, 2:114-125, 2004. Also IlliGAL Report No. 2004006.
21. D. Sharman, A. Yassine, and P. Carlile. Characterizing modular architectures. ASME 14th International Conference, DTM-34024, Sept. 2002.
22. R. E. Smith and E. Smuda. Adaptively resizing populations: Algorithm, analysis, and first results. Complex Systems, 1(9):47-72, 1995.
23. Robert E. Smith. Adaptively resizing populations: An algorithm and analysis. Proceedings of the Fifth International Conference on Genetic Algorithms, page 653, 1993.
24. Donald V. Steward. The design structure system: A method for managing the design of complex systems. IEEE Transactions on Engineering Managment, 28:77-74, 1981.
25. D. Thierens and D.E. Goldberg. Convergence models of genetic algorithm selection schemes. In Parallel Problem Solving from Nature, PPSN III pages 119-129, 1994.
26. A. Yassine, Donald R. Falkenburg, and Ken Chelst. Engineering design management: An informatoin structure approach. International Journal of production research, 37(13):2957-2975, 1999.
27. T.-L. Yu, A. Yassine, and D.E. Goldberg. A genetic algorithm for developing modular product architectures. Proceedings of the ASME 2003 International Design Engineering Technical Conferences, 15th International Conference on Design Theory and Methodology (DETC 2003) pages DTM-48657, 2003. (Also IlliGAL Report No. 2003024).
28. Tian-Li Yu, David E. Goldberg, Ali Yassine, and Ying-ping Chen. Genetic algorithm design inspired by organizational theory: Pilot study of a dependency structure matrix driven genetic algorithm. Proceedings of Artificial Neural Networks in Engineering 2003 (ANNIE 2003), pages 327-332, 2003. (Also IlliGAL Report No. 2003007).