Abstract
In recent years, multi-modal optimization has become an important area of active research. Many algorithms have been developed in literature to tackle multi-modal optimization problems. In this work, a dynamic grouping crowding differential evolution (DGCDE) with ensemble of parameter is proposed. In this algorithm, the population is dynamically regrouped into 3 equal subpopulations every few generations. Each of the subpopulations is assigned a set of parameters. The algorithms is tested on 12 classical benchmark multi-modal optimization problems and compared with the crowding differential evolution (Crowding DE) in literature. As shown in the experimental results, the proposed algorithm outperforms the Crowding DE with all three different parameter settings on the benchmark problems.
This is a preview of subscription content, log in via an institution to check access.
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
Mahfoud, S.W.: Niching methods for genetic algorithms. Ph.D. dissertation, Urbana, IL, USA, citeseer.ist.psu.edu/mahfoud95niching.html (1995)
Koper, K., Wysession, M.: Multimodal function optimization with a niching genetic algorithm: A seis-mological example. Bulletin of Seismological Society of America 89, 978–988 (1999)
Cavicchio, D.J.: Adaptive search using simulated evolution, Ph.D. dissertation, University of Michigan, Ann Arbor (1970)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems, Ph.D. dissertation, University of Michigan (1975)
Mahfoud, S.W.: Crowding and preselection revisited. In: Manner, R., Manderick, B. (eds.) Parallel problem solving from nature, vol. 2, pp. 27–36
Harik, G.R.: Finding multimodal solutions using restricted tournament selection. In: Proceedings of the sixth International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco
Pétrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proc. of the IEEE Int. Conf. on Evolutionary Computation, New York, USA, pp. 798–803 (1996)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette, J. (ed.) Proceedings of the Second International Conference on Genetic Algorithms, pp. 41–49 (1987)
Li, J.P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evol. Comput. 10(3), 207–234 (2002)
Zaharie, D.: Extensions of differential evolution algorithms for multimodal optimization. In: Proc. of 6th Int. Symposium of Symbolic and Numeric Algorithms for Scientific Computing, pp. 523–534 (2004)
Hendershot, Z.: A differential evolution algorithm for automatically discovering multiple global optima in multidimensional, discontinues spaces. In: Proceedings of MAICS 2004, Fifteenth Midwest Artificial Intelligence and Cognitive Sciences Conference, pp. 92–97 (2004)
Qu, B.Y., Suganthan, P.N.: Novel Multimodal Problems and Differential Evolution with Ensemble of Restricted Tournament Selection. In: IEEE Congress on Evolutionary Computation, Barcelona, Spain, pp. 3480–3486 (July 2010)
Thomsen, R.: Multi-modal optimization using crowding-based differential evolution. In: Proceedings of the 2004 Congress on Evolutionary Computation, vol. 2, pp. 1382–1389 (2004)
Storn, R., Price, K.V.: Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. J. of Global Optimization 11, 341–359 (1995)
Price, K.: An introduction to differential evolution. New Ideas in Optimization, 79–108 (1999)
Das, S., Suganthan, P.N.: Differential Evolution: A Survey of the State-of-the-art. IEEE Trans. on Evolutionary Computation, doi:10.1109/TEVC.2010.2059031
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Ackley, D.: An empirical study of bit vector function optimization. In: Genetic Algorithms Simulated Annealing, pp. 170–204. Pitman, London (1987)
Deb, K.: Genetic algorithms in multimodal function optimization, the Clearinghouse for Genetic Algorithms. M.S Thsis and Rep. 89002, Univ. Alabama, Tuscaloosa (1989)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1996)
Shir, O., Back, T.: Niche radius adaptation in the CMA-ES niching algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 142–151. Springer, Heidelberg (2006)
Mallipeddi, R., Suganthan, P.N., Pan, Q.K., Tasgetiren, M.F.: Differential evolution algorithm with ensemble of parameters and mutation strategies. Applied Soft Computing (accepted) doi:10.1016/j.asoc.2010.04.024
Qin, A.K., Huang, V.L., Suganthan, P.N.: Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans. on Evolutionary Computations, 398–417 (April 2009), doi:10.1109/TEVC.2008.927706
Yu, E.L., Suganthan, P.N.: Ensemble of niching algorithms. Information Sciences 180(15), 2815–2833 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qu, B.Y., Gouthanan, P., Suganthan, P.N. (2010). Dynamic Grouping Crowding Differential Evolution with Ensemble of Parameters for Multi-modal Optimization. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17562-6
Online ISBN: 978-3-642-17563-3
eBook Packages: Computer ScienceComputer Science (R0)