Abstract
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is naturally implemented as a new genetic algorithm, QHFC, under a sustainable evolutionary computation model: the Hierarchical Fair Competition (HFC) Model. By combining the benefits of the temporally continuing search capability of HFC and this spatial niching capability, QHFC is able to achieve much better performance than deterministic crowding and restricted tournament selection in terms of robustness, efficiency, and scalability, simultaneously, as demonstrated using three massively multi-modal benchmark problems. HFC-based genetic algorithms with hierarchical niching seem to be very promising for solving difficult real-world problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldberg, D.E.: Sizing Populations for Serial and Parallel Genetic Algorithms. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, Kaufmann, San Mateo (1989)
Harik, G.R., Lobo, F.G.: A parameter-less genetic algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (1999)
Mahfoud, S.W.: Niching Methods for Genetic Algorithms, Ph.D. Thesis, University of Illinois at Urbana-Champaign (1995)
Hu, J., Goodman, E.D.: Hierarchical Fair Competition Model for Parallel Evolutionary Algorithms. In: Proceedings, Congress on Evolutionary Computation, CEC 2002, IEEE World Congress on Computational Intelligence, Honolulu, Hawaii, May 2002, IEEE Computer Society Press, Los Alamitos (2002)
Hu, J., Goodman, E.D., Seo, K.: Continuous Hierarchical Fair Competition Model for Sustainable Innovation in Genetic Programming. In: Genetic Programming Theory and Practice, pp. 81–98. Kluwer Academic Publishers, Dordrecht (2003)
Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems (Doctoral dissertation, University of Michigan). Dissertation Abstracts International, 36(10),514B (University Microfilms No. 76-9381) (1975)
Mahfoud, S.W.: Crowding and preselection revisited. In: Proc. Parallel problem Solving from Nature, PPSN 1992, Brussels (1992)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette, J.J. (ed.) Proceedings of the 2nd International Conference on Genetic Algorithms, pp. 41–49. Lawrence Erlbaum, Hillsdale (1987)
Beasley, D., Bull, D.R., Martin, R.R.: A sequential niche technique for multimodal function optimization. Evolutionary Computation 1(2), 101–125 (1993)
Harik, G.: Finding multimodal solutions using restricted tournament selection. In: Proceedings of Sixth International Conference on Genetic Algorithms (1995)
Darwen, P., Yao, X.: Every niching method has its niche: Fitness sharing and implicit sharing compared. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature– PPSN IV, pp. 398–407. Springer, Berlin (1996)
Mahfoud, S.M.: A Comparison of Parallel and Sequential Niching Methods. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 136–143 (1995)
Sareni, B., Krahenbuhl, L.: Fitness Sharing and Niching Methods revisited. IEEE Trans. on Evolutionary Computation 2(3), 97–106 (1998)
Ursem, R.K.: When Sharing Fails. In: Proceedings of the Third Congress on Evolutionary Computation, CEC 2001 (2001)
Hutter, M.: Fitness Uniform Selection to Preserve Genetic Diversity. In: Proceedings of the 2002 Congress on Evolutionary (CEC 2002), Hawaii, pp. 783–788 (2002)
Buckling, A., et al.: Adaptation limits diversification of experimental bacterial populations. Science 302, 2107–2109 (2003)
Hu, J., Goodman, E.D., Seo, K., Fan, Z., Rosenberg, R.C.: HFC: a Continuing EA Framework for Scalable Evolutionary Synthesis. In: Proceedings of the 2003 AAAI Spring Symposium - Computational Synthesis: From Basic Building Blocks to High Level Functionality, Stanford, California, March, 24-26, pp. 106–113 (2003)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.E.: BOA: The Bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), vol. I, pp. 525–532 (1999)
Watson, R.: Analysis of recombinative algorithms on a nonseparable building block problem. In: Martin, W., Spears, W. (eds.) Foundations of Genetic Algorithms 6, pp. 69–89. Morgan Kaufmann, San Mateo (2001)
Hu, J., Goodman, E., Seo, K., Fan, Z., Rosenberg, R.: The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms. Evolutionary Computation 13(1) (2005) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, J., Goodman, E. (2004). Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_118
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_118
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive