Abstract
Multi-modal Optimization refers to finding multiple global and local optima of a function in one single run, so that the user can have a better knowledge about different optimal solutions. Multiple global/local peaks generate extra difficulties for the optimization algorithms. Many niching techniques have been developed in literature to tackle multi-modal optimization problems. Clearing is one of the simplest and most effective methods in solving multi-modal optimization problems. In this work, an Ensemble of Clearing Differential Evolution (ECLDE) algorithm is proposed to handle multi-modal problems. In this algorithm, the population is evenly divided into 3 subpopulations and each of the subpopulations is assigned a set of niching parameters (clearing radius). The algorithms is tested on 12 benchmark multi-modal optimization problems and compared with the Clearing Differential Evolution (CLDE) with single clearing radius as well as a number of commonly used niching algorithms. As shown in the experimental results, the proposed algorithm is able to generate satisfactory performance over the benchmark functions.
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 (1995), citeseer.ist.psu.edu/mahfoud95niching.html
Koper, K., Wysession, M.: Multimodal function optimization with a niching genetic algorithm: A seis-mological example. Bulletin of the Seismological Society of America 89, 978–988 (1999)
Das, S., Maity, S., Qu, B.-Y., Suganthan, P.N.: Real-parameter evolutionary multimodal optimization — A survey of the state-of-the-art. Swarm and Evolutionary Computation 1(2), 71–88 (2011)
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 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
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: Proceedings of SYNASC 2004, 6th International 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)
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)
Qu, B.Y., Suganthan, P.N.: Modified species-based differential evolution with self –adaptive radius for multi-modal optimization. In: International Conference on Computational Problem Solving (ICCP), China, pp. 326–331 (2010)
Storn, R., Price, K.V.: Differential evolution-Asimple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1995)
Price, K.: An introduction to differential evolution. New Ideas in Optimization, 79–108 (1999)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 67–82 (1997)
Yu, E.L., Suganthan, P.N.: Ensemble of niching algorithms. Information Sciences 180(15), 2815–2833 (2010)
Qu, B.Y., Suganthan, P.N.: Constrained Multi-Objective Optimization Algorithm with Ensemble of Constraint Handling Methods. Engineering Optimization 43(4), 403 (2011)
Qu, B.Y., Gouthanan, P., Suganthan, P.N.: 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.) SEMCCO 2010. LNCS, vol. 6466, pp. 19–28. Springer, Heidelberg (2010)
Li, X.: Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Transactions on Evolutionary Computation 14 (February 2010)
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)
Li, X.: Efficient differential evolution using speciation for multimodal function optimization. In: Proceedings of the Conference on Genetic and Evolutionary Computation, Washington DC, USA, pp. 873–880 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qu, B., Liang, J., Suganthan, P.N., Chen, T. (2012). Ensemble of Clearing Differential Evolution for Multi-modal Optimization. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30976-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-30976-2_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30975-5
Online ISBN: 978-3-642-30976-2
eBook Packages: Computer ScienceComputer Science (R0)