The Hierarchical Fair Competition (HFC) framework for sustainable Evolutionary Algorithms

Evolutionary Computation

Volumn 13, Issue 2, 2005, Pages 241-277

  Hu, Jianjun ^a   Goodman, Erik ^b   Seo, Kisung ^b   Fan, Zhun ^b   Rosenberg, Rondal ^a  

^a Michigan State University   (United States)

^b Department of Electrical and Computer Engineering ^*  (United States)

Author keywords

Building blocks; Diversity; Fair competition; Genetic programming; Hierarchical problem solving; Premature convergence; Sustainable evolutionary algorithms

Indexed keywords

BUILDING BLOCKS; DIVERSITY; FAIR COMPETITION; GENETIC PROGRAMMING; HIERARCHICAL FAIR COMPETITION (HFC) MODEL; HIERARCHICAL PROBLEM SOLVING; NON-CONVERGENT SEARCH PROCESSES; PREMATURE CONVERGENCE; SUSTAINABLE EVOLUTIONARY ALGORITHMS;

CONTROL SYSTEMS; ECOSYSTEMS; GENETIC ALGORITHMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; NETWORKS (CIRCUITS); OPTIMIZATION; PROBLEM SOLVING;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; BIOLOGICAL MODEL; BIOLOGY; COMPUTER ANALYSIS; COMPUTER PROGRAM; COMPUTER SIMULATION; EVOLUTION; GENETIC SELECTION; GENOTYPE; MATHEMATICAL COMPUTING; METHODOLOGY; MOLECULAR EVOLUTION; PHENOTYPE; STATISTICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; COMPUTING METHODOLOGIES; EVOLUTION; EVOLUTION, MOLECULAR; GENOTYPE; MATHEMATICAL COMPUTING; MODELS, GENETIC; MODELS, STATISTICAL; MODELS, THEORETICAL; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED; PHENOTYPE; SELECTION (GENETICS); SOFTWARE;

EID: 21244498631     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/1063656054088530     Document Type: Article

References (40)

1. Aickenlin, U. and Dowsland, K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3(3):139-153.
2. Angeline, P.J. and Pollack, J. B. (1994). Coevolving high-level representations. In Proceedings of Artificial Life III. Addison-Wesley.
3. Bonner, J. T. (2000). First Signals: The Evolution of Multicellular Development. Princeton University Press.
4. Cobb, H. and Grefenstette, J. J. (1993). Genetic algorithms for tracking changing environments. In Proc. Fifth Int. Conf. on Genetic Algorithms, pages 523-530.
5. Darwen, P. (1996). Co-evolutionary Learning by Automatic Modularisation with Speciation. PhD thesis, University of New South Wales.
6. Eby, D., Averill, R. C., Goodman, E., and Punch, W. (1999). Optimal design of flywheels using an injection island genetic algorithm. Artificial Intelligence in Engineering Design, Analysis and Manufacturing, 13:389-402.
7. Goldberg, D. E. (1989). Sizing populations for serial and parallel genetic algorithms. In Proc. Third Internal. Conf. on Genetic Algorithms, pages 70-79.
8. Goldberg, D. E. (1999). Using time efficiently: Genetic-evolutionary algorithms and the continuation problem. Technical report, University of Illinois at Urbana-Champaign.
9. Goldberg, D. E. (2002). The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Boston, MA.
10. Goldberg, D. E., Deb, K., and Horn, J. (1992). Massive multimodality, deception, and genetic algorithms. In Manderick, R. M. B., editor, Parallel Problem Solving From Nature II, pages 37-46. Amsterdam, North-Holland.
11. Goldberg, D. E., Deb, K., Kargupta, H., and Harik, G. (1993). Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In Fifth Int. Conf. on Genetic Algorithms.
12. Harvey, I. (1992). Species adaptation genetic algorithms: A basis for a continuing saga. In Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, pages 346-354, Cambridge, MA. MIT Press/Bradford Books.
13. Harvey, I., Husbands, P., Cliff, D., Thompson, A., and Jakobi, N. (1997). Evolutionary robotics: the Sussex approach. Robotics and Autonomous Systems, 20:205-224.
14. Holland, J. H. (2000). Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evolutionary Computation, 8(4):373-391.
15. Hsu, W. H. and Gustafson, S. M. (2002). Genetic programming and multi-agent layered learning by reinforcements. In Langdon, W. B. e. a., editor, Proceeding of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann.
16. Hu, J., Goodman, E. D., and Seo, K. (2003). Continuous hierarchical fair competition model for sustainable innovation in genetic programming. In Riolo, R. and Worzel, W., editors, Genetic Programming Theory and Practice, chapter 6. Kluwer Publishers, Boston, MA.
17. Hu, J., Goodman, E. D., Seo, K., and Pei, M. (2002). Adaptive hierarchical fair competition (ahfc) model for parallel evolutionary algorithms. In Proc. 2002 Genetic and Evolutionary Computation Conference. New York.
18. Koza, J. H. (1994). Genetic Programming II. MIT Press, Cambridge, MA.
19. Koza, J. H., Bennett III, B. N., Andre, D., and Keane, M. A. (1999). Genetic Programming III: Darwinian Invention and Problem Solving. MIT Press, Cambridge, Massachusetts.
20. Koza, J. R., Keane, M. A., Yu, J., Bennett III, F., and Mydlowec, W. (2000). Automatic creation of human-competitive programs and controllers by means of genetic programming. Journal of Genetic Programming And Evolvable Machines, 1:121-164.
21. Li, J. P., Balazs, M., Parks, G. T., and Clarkson, P. J. (2002). A species-conserving genetic algorithm for multimodal function optimization. Evolutionary Computation, 10(3):207-234.
22. Lin, S.-C., Goodman, E. D., and Punch, W. (1994). Coarse-grain parallel genetic algorithms: Categorization and new approach. In IEEE Conf. on Parallel and Distribributed Processing, volume 11.
23. Luke, S. (2001). When short runs beat long runs. In et al., L. S., editor, Proc. 2001 Genetic and Evolutionary Computation Conference. Morgan Kaufmann.
24. Mahfoud, S. (1992). Crowding and preselection revisited. In Parallel Problem Solving from Nature, pages 27-36. North-Holland.
25. Mahfoud, S. W. (1995). Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign.
26. Pelikan, M. and Goldberg, D. E. (2001). Escaping hierarchical traps with competent genetic algorithms. In et. al., I. L. S., editor, Proc. GECCO-2001 Genetic and Evolutionary Computation Conference. Morgan Kaufmann.
27. Poli, R. and Page, J. (2000). Solving high-order boolean parity problems with smooth uniform crossover, sub-machine-code gp and demes. Genetic programming and evolvable machines, 1:37-56.
28. Potter, M. and De Jong, K. (2000). Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evolutionary Computation, 8(1):1-29.
29. Rosca, J. and Ballard, D. (1994). Hierarchical self-organization in genetic programming. In 11th Internat. Conf. on Machine Learning. Morgan Kaufmann.
30. Ryan, C. (1996). Reducing premature convergence in evolutionary algorithms. PhD thesis, National University of Ireland.
31. Seo, K., Hu, J., Fan, Z., Goodman, E., and Rosenberg, R. (2002). Automated design approaches for multi-domain dynamic systems using bond graphs and genetic programming. The International Journal of Computers, Systems and Signals, 3:55-70.
32. Simon, H. (1973). The organization of complex systems. In Pattee, H. H., editor, Hierarchy Theory - The Challenge of Complex Systems. George Braziller Publisher, New York.
33. Stanley, K. and Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10:99-127.
34. Torresen, J. (2002). A scalable approach to evolvable hardware. Genetic Programming and Evolvable Machines, 3:259-282.
35. Tsutsui, S. and Ghosh, A. (1998). Search space division in gas using phenotypic squares estimates. Information Sciences, 109(1-4):119-133.
36. Vassilev, V. and Miller, J. (2000). Scalability problems of digital circuit evolution. In Proc. 2nd NASA/DOD Workshop on Evolvable Hardware. Los Alamitos, California.
37. Waddington, C. (1942). The canalization of development and the inheritance of acquired characters. Nature, 150:563-565.
38. Watson, R. and Pollack, J. (1999). Hierarchically-consistent test problems for genetic algorithms. In Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proc. 1999 Congress on Evolutionary Computation.
39. Whitley, D., Mathias, K., and Fitzhorn, P. (1991). Delta-coding: An iterative search strategy for genetic algorithms. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 77-84.
40. Yao, X. and Higuchi, T. (1998). Promises and challenges of evolvable hardware. IEEE Trans. Systems, Man, and Cybernetics, Part C, 28(4):55-78.