Abstract
This work presents a niching method based on the concept of repelling subpopulations for multimodal optimization. It utilizes several existing concepts and techniques in order to develop a new multimodal optimization algorithm that does not make any of specific assumptions on the shape, size, and distribution of minima. In the proposed method, several subpopulations explore the search space in parallel. Offspring of weaker subpopulations are forced to maintain a distance from the fitter subpopulations and the previously identified niches. This defines taboo regions to hinder the exploration of the same regions of the search space and previously identified niches. The size of each taboo region is adapted independently so that the method can handle challenges of minima with dissimilar basin sizes and irregular distribution. The local shape of a basin is approximated by the distribution of the subpopulation members converging to that basin. The proposed niching strategy is incorporated into the state-of-the-art evolution strategies, and the resulting method is compared with some of the most successful multimodal optimization methods on composite test problems. A comparison of numerical results demonstrates the superiority of our proposed method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Some materials in Sects. 1 and 2 of this work have been excerpted from our previously published paper: "Ali Ahrari, Kalyanmoy Deb, and Mike Preuss, ’Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations’, Evolutionary Computation, 25:3 (Fall, 2017), pp. 439–471. ©2017 by the Massachusetts Institute of Technology, published by the MIT Press". Permission to excerpt the materials from our previous work has been granted by The MIT Press.
References
Ahrari, A., Kramer, O.: Finite life span for improving the selection scheme in evolution strategies. Soft Comput. 1–13 (2015)
Bäck, T., Foussette, C., Krause, P.: Contemporary Evolution Strategies. Springer Science & Business Media (2013)
Basak, A., Das, S., Tan, K.C.: Multimodal optimization using a biobjective differential evolution algorithm enhanced with mean distance-based selection. IEEE Trans. Evolut. Comput. 17(5), 666–685 (2013)
Beyer, H.G., Sendhoff, B.: Robust optimization-a comprehensive survey. Comput. Methods Appl. Mech. Eng. 196(33), 3190–3218 (2007)
Beyer, H.G., Sendhoff, B.: Covariance matrix adaptation revisited–the CMSA evolution strategy–. In: Parallel Problem Solving from Nature–PPSN X, pp. 123–132. Springer (2008)
Biswas, S., Kundu, S., Das, S.: An improved parent-centric mutation with normalized neighborhoods for inducing niching behavior in differential evolution. IEEE Trans. Cybernet 44(10), 1726–1737 (2014)
Coello, C.A.C., Lamont, G.B.: Applications of Multi-objective Evolutionary Algorithms, vol. 1. World Scientific (2004)
Das, S., Maity, S., Qu, B.Y., Suganthan, P.N.: Real-parameter evolutionary multimodal optimization - a survey of the state-of-the-art. Swarm Evolut. Comput. 1(2), 71–88 (2011)
De Jong, K.A.: Analysis of the behavior of a class of genetic adaptive systems (1975)
Deb, K., Goldberg, D.E.: In: An investigation of niche and species formation in genetic function optimization, pp. 42–50. Morgan Kaufmann Publishers Inc. (1989)
Debski, R., Dreżewski, R., Kisiel-Dorohinicki, M.: Maintaining population diversity in evolution strategy for engineering problems. In: New Frontiers in Applied Artificial Intelligence, pp. 379–387. Springer (2008)
Fieldsend, J.E.: Running up those hills: Multi-modal search with the niching migratory multi-swarm optimiser. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2593–2600. IEEE (2014)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 41–49. Lawrence Erlbaum, Hillsdale, NJ (1987)
Hansen, N.: Benchmarking a bi-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. pp. 2389–2396. ACM (2009)
Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2010: Experimental setup. Technical Report RR-7215, INRIA (2010)
Hansen, N., Kern, S.: Evaluating the cma evolution strategy on multimodal test functions. In: Parallel Problem Solving from Nature-PPSN VIII. pp. 282–291. Springer (2004)
Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolut. Comput. 9(2), 159–195 (2001)
Jin, Y.: Surrogate-assisted evolutionary computation: Recent advances and future challenges. Swarm Evolut. Comput. 1(2), 61–70 (2011)
Li, X., Engelbrecht, A., Epitropakis, M.G.: Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization. Evolutionary Computation and Machine Learning Group, RMIT University, Technical report (2013)
Li, X., Epitropakis, M.G., Deb, K., Engelbrecht, A.: Seeking multiple solutions: an updated survey on niching methods and their applications. IEEE Trans. Evolut. Comput. 21(4), 518–538 (2017)
Mahfoud, S.W.: Niching methods for genetic algorithms. Urbana 51(95001), 62–94 (1995)
Mengshoel, O.J., Goldberg, D.E.: The crowding approach to niching in genetic algorithms. Evolut. Comput. 16(3), 315–354 (2008)
Preuss, M.: Niching the CMA-ES via nearest-better clustering. In: Proceedings ofthe 12th annual conference companion on Genetic and evolutionary computation, pp. 1711–1718. ACM (2010)
Qu, B.Y., Suganthan, P.N.: Novel multimodal problems and differential evolution with ensemble of restricted tournament selection. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1–7. IEEE (2010)
Qu, B.Y., Suganthan, P.N., Das, S.: A distance-based locally informed particle swarm model for multimodal optimization. IEEE Trans. Evolut. Comput. 17(3), 387–402 (2013)
Qu, B.Y., Suganthan, P.N., Liang, J.J.: Differential evolution with neighborhood mutation for multimodal optimization. IEEE Trans. Evolut. Comput. 16(5), 601–614 (2012)
Schwefel, H.P., Rudolph, G.: Contemporary Evolution Strategies. Springer (1995)
Shir, O.M., Bäck, T.: Niching with derandomized evolution strategies in artificial and real-world landscapes. Nat. Comput. 8(1), 171–196 (2009)
Shir, O.M., Emmerich, M., Bäck, T.: Adaptive niche radii and niche shapes approaches for niching with the CMA-ES. Evolut. Comput. 18(1), 97–126 (2010)
Siarry, P., Berthiau, G.: Fitting of tabu search to optimize functions of continuous variables. Int. J. Numer. Methods Eng. 40(13), 2449–2457 (1997)
Singh, G., Deb, K.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006), New York. pp. 1305–1312. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006), New York (2006)
Stoean, C., Preuss, M., Stoean, R., Dumitrescu, D.: Multimodal optimization by means of a topological species conservation algorithm. EEE Trans. Evolut. Comput. 14(6), 842–864 (2010)
Ursem, R.K.: Multinational evolutionary algorithms. In: Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99. vol. 3. IEEE (1999)
Acknowledgements
Permission to excerpt some parts of this article from the following publication was granted by MIT Press: Ali Ahrari, Kalyanmoy Deb, and Mike Preuss, ‘Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations’, Evolutionary Computation, 25:3 (Fall, 2017), pp. 439–471. ©2017 by the Massachusetts Institute of Technology, published by the MIT Press.
Computational work in support of this research was performed at Michigan State University’s High-Performance Computing Facility. The source codes for NSDE and LIPS and the tested composite functions were provided by Ponnuthurai N. Suganthan. The source code of PNPCDE was provided by Subhodip Biswas. The source code of NMMSO was provided by Jonathan Fieldsend. The authors would like to thank them for sharing their source codes and providing guidelines to tune the control parameters. The source code of RS-CMSA-ES (in MATLAB) can be found at the COIN lab website: https://coin-lab.org and https://www.researchgate.net/profile/Ali_Ahrari/research.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ahrari, A., Deb, K. (2021). Multimodal Optimization by Evolution Strategies with Repelling Subpopulations. In: Preuss, M., Epitropakis, M.G., Li, X., Fieldsend, J.E. (eds) Metaheuristics for Finding Multiple Solutions. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-79553-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-79553-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79552-8
Online ISBN: 978-3-030-79553-5
eBook Packages: Computer ScienceComputer Science (R0)