Abstract
Fitness sharing genetic algorithm is one of the most common used methods to deal with multimodal optimization problems. The algorithm requires peaks radii as the predefined parameter. It is very difficult to guess peaks radii for designers and decision makers in the real world applications. A novel self-adaptive annealing peaks radii control method has been suggested in this paper to deal with the problem. Peaks radii are coded into chromosomes and evolved while fitness sharing genetic algorithm optimizes the problem. The empirical results tested on the benchmark problems show that fitness sharing genetic algorithm with self-adaptive annealing peaks radii control method can find and maintain nearly all peaks steadily. This method is especially suitable for the problems whose peaks radii are difficult to estimate beforehand.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, J.E.: Reducing Bias and Inefficiency in the Selection Algorithm. In: Grefenstette, J.J. (ed.) Proceedings Of the Second International Conference on Genetic Algorithms and Their Applications, pp. 14–21. Lawrence Erlbaum, Hillsdale (1987)
Deb, K., Goldberg, D.E.: An Investigation of Niche and Species Formation in Genetic Function Optimization. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms and their Applications, pp. 42–50. Morgan Kaufmann, San Mateo (1989)
Eiben, E., Hiterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, New York (1989)
Goldberg, D.E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: Grefenstette, J.J. (ed.) Proceedings Of the Second International Conference on Genetic Algorithms and Their Applications, pp. 41–49. Lawrence Erlbaum, Hillsdale (1987)
Goldberg, D.E., Wang, L.: Adaptive Niching via Coevolutionary Sharing. IlliGAL Report No. 97007 (1997)
Mahfoud, S.W.: Crossover Interactions among Niches. In: Proceedings of the first IEEE Conference on Evolutionary Computation, pp. 188–193. IEEE Press, Piscataway (1994)
Mahfoud, S.W.: Genetic Drift in Sharing Methods. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 67–72. IEEE Press, Piscataway (1994)
Mahfoud, S.W.: Niching Methods for Genetic Algorithms. Ph.D. Dissertation, University of Illinois, Urbana-Champaign (1995)
Miller, B.L., Shaw, M.J.: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. In: Proceedings of the third IEEE Conference on Evolutionary Computation, pp. 786–791. IEEE Press, Piscataway (1996)
Petrowski, A.: A Clearing Procedure as a Niching Method for Genetic Algorithms. In: Proceedings of the third IEEE Conference on Evolutionary Computation, pp. 798–803. IEEE Press, Piscataway (1996)
Sareni, B., Krahenbuhl, L.: Fitness Sharing and Niching Methods Revisited. IEEE Transactions on Evolutionary Computation 2(3), 97–106 (1998)
Yin, X., Germay, N.: A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization. In: Albrecht, R.F. (ed.) Proceedings of International Conference on Artificial Neural Nets and Genetic Algorithms, pp. 450–457. Springer, New York (1993)
Yu, X., Wang, Z.: The Fitness Sharing Genetic Algorithms with Adaptive Power Law Scaling. System Engineering Theory and Practice 22(2), 42–48 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, X. (2005). Fitness Sharing Genetic Algorithm with Self-adaptive Annealing Peaks Radii Control Method. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_145
Download citation
DOI: https://doi.org/10.1007/11539117_145
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28325-6
Online ISBN: 978-3-540-31858-3
eBook Packages: Computer ScienceComputer Science (R0)