Abstract
The search ability of an Evolutionary Algorithm (EA) depends on the variation among the individuals in the population [1–3]. Maintaining an optimal level of diversity in the EA population is imperative to ensure that progress of the EA search is unhindered by premature convergence to suboptimal solutions. Clearer understanding of the concept of population diversity, in the context of evolutionary search and premature convergence in particular, is the key to designing efficient EAs. To this end, this paper first presents a brief analysis of the EA population diversity issues. Next we present an investigation on a counter-niching EA technique [2] that introduces and maintains constructive diversity in the population. The proposed approach uses informed genetic operations to reach promising, but unexplored or under-explored areas of the search space, while discouraging premature local convergence. Simulation runs on a suite of standard benchmark test functions with Genetic Algorithm (GA) implementation shows promising results.
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
References
Bhattacharya, M.: An informed operator approach to tackle diversity constraints in evolutionary search. In: Proceedings of The International Conference on Information Technology, ITCC 2004, vol. 2, pp. 326–330. IEEE Computer Society Press. ISBN 0-7695-2108-8
Bhattacharya, M.: Counter-niching for constructive population diversity. In: Proceedings of the 2008 IEEE Congress on Evolutionary Computation (CEC 2008), pp. 4174–4179. IEEE Press, Hong Kong. ISBN: 978-1-4244-1823-7
Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Theoretical analysis of diversity mechanisms for global exploration. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 945–952 (2008)
Friedrich, T., Hebbinghaus, N., Neumann, F.: Rigorous analyses of simple diversity mechanisms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1219–1225 (2007)
Ganv’an-L’opez, E., McDermott, J., O’Neill, M., Brabazon, A.: Towards an understanding of locality in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 901–908 (2010)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor, MI, Dissertation Abstracts International 36(10), 5140B, University Microfilms Number 76–9381 (1975)
Leung, Y., Gao, Y., Xu, Z.B.: Degree of population diversity-a perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Trans. Neural Netw. 8(5), 1165–1176 (1997)
Liang, Y., Leung, K.S.: Genetic algorithm with adaptive elitist-population strategies for multimodal function optimization. Appl. Soft Comput. 11(2), 2017–2034 (2011)
Ursem, R.K.: Diversity-guided evolutionary algorithms. In: Proceedings of Parallel Problem Solving from Nature VII (PPSN-2002), pp. 462–471 (2002)
Thomsen, R., Rickers, P.: Introducing spatial agent-based models and self-organised criticality to evolutionary algorithms. Master’s thesis, University of Aarhus, Denmark (2000)
Bäck, T., Fogel, D.B., Michalewicz, Z., et al. (eds.): Handbook on Evolutionary Computation. IOP Publishing Ltd and Oxford University Press (1997)
Bhattacharya, M., Nath, B.: Genetic programming: a review of some concerns. In: Computational Science-ICCS 2001, pp. 1031–1040. Springer, Heidelberg (2001)
Adra, S.F., Fleming, P.J.: Diversity management in evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 15(2), 183–195 (2011)
Araujo, L., Merelo, J.J.: Diversity through multiculturality: assessing migrant choice policies in an island model. IEEE Trans. Evol. Comput. 15(4), 456–468 (2011)
Chow, C.K., Yuen, S.Y.: An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans. Evol. Comput. 15(6), 741–769 (2011)
Curran, D., O’Riordan, C.: Increasing population diversity through cultural learning. Adapt. Behav. 14(4), 315–338 (2006)
Gao, H., Xu, W.: Particle swarm algorithm with hybrid mutation strategy. Appl. Soft Comput. 11(8), 5129–5142 (2011)
Jia, D., Zheng, G., Khan, M.K.: An effective memetic differential evolution algorithm based on chaotic local search. Inf. Sci. 181(15), 3175–3187 (2011)
Bhattacharya, M.: Meta model based EA for complex optimization. Int. J. Comput. Intell. 4, 1 (2008)
Bhattacharya, M.: Surrogate based EA for expensive optimization problems. In: IEEE Congress on Evolutionary Computation (2007)
Bhattacharya, M.: Reduced computation for evolutionary optimization in noisy environment. In: Proceedings of the 10th annual Conference Companion on Genetic and Evolutionary Computation. ACM (2008)
Bhattacharya, M.: Expensive optimization, uncertain environment: an EA-based solution. In: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation. ACM (2007)
Bhattacharya, M.: Meta model based EA for complex optimization. Int. J. Comput. Intell. 4, 1 (2008)
Bhattacharya, M.: Exploiting landscape information to avoid premature convergence in evolutionary search. In: IEEE Congress on Evolutionary Computation (2006)
Ishibuchi, H., Narukawa, K., Tsukamoto, N., Nojima, Y.: An empirical study on similarity-based mating for evolutionary multi-objective combinatorial optimization. Eur. J. Oper. Res. 188(1), 57–75 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bhattacharya, M. (2016). Evolutionary Landscape and Management of Population Diversity. In: Hatzilygeroudis, I., Palade, V., Prentzas, J. (eds) Combinations of Intelligent Methods and Applications. Smart Innovation, Systems and Technologies, vol 46. Springer, Cham. https://doi.org/10.1007/978-3-319-26860-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-26860-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26858-3
Online ISBN: 978-3-319-26860-6
eBook Packages: EngineeringEngineering (R0)