Abstract
Fitness sharing has been shown to be an effective niching mechanism in genetic algorithms (GAs). Sharing allows GAs to maintain multiple, cooperating “species” in a single population for many generations under severe selective pressure. While recent studies have shown that the maintenance time for niching equilibrium is long, it has never been shown that the time it takes to reach equilibrium is sufficiently fast. While experiments indicate that selection under fitness sharing drives the population to equilibrium just as fast and as effectively as selection alone drives the simple GA to a uniform population, we can now show analytically that this is the case.
Professor Horn's efforts were supported by NASA under contract number NGT50873. Professor Goldberg's contribution was sponsored by the Air Force Office of Scientific Research, Air Force Materiel Command, USAF, under grants F49620-94-1-0103, F49620-95-1-0338, and F49620-97-1-0050. The US Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are the authors' and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Air Force Office of Scientific Research or the U. S. Government.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ankenbrandt, C. A. (1991). An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In G. E. Rawlins (Ed.), Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 53–68.
Deb, K. (1989). Genetic algorithms in multimodal function optimization. Masters thesis and TCGA Report No. 89002. Tuscaloosa, AL: Department of Engineering Mechanics, University of Alabama.
Deb, K., & Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 42–50.
Goertzel, B. (1993). The Evolving Mind. Langhorne, PA: Gordon and Breach.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
Goldberg, D. E., & Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In G. E. Rawlins (Ed.), Foundations of Genetic Algorithms (FOGA). San Mateo, CA: Morgan Kaufmann. 69–93.
Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In J. Grefenstette, (Ed.), Proceedings of the Second International Conference on Genetic Algorithms, Hillsdale, NJ: Lawrence Erlbaum Associates, 41–49.
Horn, J. (1993). Finite Markov chain analysis of genetic algorithms with niching. In S. Forrest, (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 110–117.
Horn, J. (1997). The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations. Ph.D. thesis, University of Illinois at Urbana-Champaign, (UMI Dissertation Services, No. 9812622).
Horn, J., Goldberg, D. E., & Deb, K. (1994). Implicit niching in a learning classifier system: nature's way. Evolutionary Computation, 2(1). 37–66.
Horn, J., Nafpliotis, N., & Goldberg, D. E. (1994). A niched Pareto genetic algorithm for multiobjective optimization. Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence, volume 1. Piscataway, NJ: IEEE Service Center, 82–87.
Mahfoud, S. W. (1994). Genetic drift in sharing methods. Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence, volume 1. Piscataway, NJ: IEEE Service Center, 67–72.
Neri, F., & Saitta, L. (1995). Analysis of genetic algorithms evolution under pure selection. In L. J. Eshelman, (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms. San Francisco, CA: Morgan Kaufmann. 32–39.
Smith, R. E., & Valenzuela-Rendón, M. (1989). A study of rule set development in a learning classifier system. In J. D. Schaffer, (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 340–346.
Vose, M. D. (1995). Modeling simple genetic algorithms. Evolutionary Computation, 3(4). 453–472.
Wilson, S. W. (1987). Classifier systems and the animat problem. Machine Learning, 2. 199–228.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horn, J., Goldberg, D.E. (1998). A timing analysis of convergence to fitness sharing equilibrium. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056846
Download citation
DOI: https://doi.org/10.1007/BFb0056846
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive