INFORMATION CHANGE THE WORLD

International Journal of Intelligent Systems and Applications(IJISA)

ISSN: 2074-904X (Print), ISSN: 2074-9058 (Online)

Published By: MECS Press

IJISA Vol.7, No.4, Mar. 2015

A Comparison of Crowding Differential Evolution Algorithms for Multimodal Optimization Problems

Full Text (PDF, 435KB), PP.1-10


Views:100   Downloads:1

Author(s)

O. Tolga Altinoz

Index Terms

Differential Evolution, Random Scale, Multimodal Optimization, Time Varying, Crowding

Abstract

Multimodal problems are related to locating multiple, redundant global optima, as opposed to single solution. In practice, generally in engineering problems it is desired to obtain many redundant solutions instead of single global optima since the available resources cannot be enough or not possible to implement the solution in real-life. Hence, as a toolbox for finding multimodal solutions, modified single objective algorithms can able to use. As one of the fundamental modification, from one of the niching schemes, crowding method was applied to Differential Evolution (DE) algorithm to solve multimodal problems and frequently preferred to compared with developed methods. Therefore, in this study, eight different DE are considered/evaluated on ten benchmark problems to provide best possible DE algorithm for crowding operation. In conclusion, the results show that the time varying scale mutation DE algorithm outperforms against other DE algorithms on benchmark problems.

Cite This Paper

O. Tolga Altinoz,"A Comparison of Crowding Differential Evolution Algorithms for Multimodal Optimization Problems", International Journal of Intelligent Systems and Applications(IJISA), vol.7, no.4, pp.1-10, 2015. DOI: 10.5815/ijisa.2015.04.01

Reference

[1]B.Y. Qu, P.N. Suganthan, S. Das, “A distance-based locally informed particle swarm model for multimodal optimization,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 3, pp. 387-402, 2013.

[2]S.W. Mahfoud, Niching methods for genetic algorithms. PhD Thesis, Department of Computer Sciences, University of Illinois Urbana-Champaign, 1995.

[3]N.N. Glibovets, N.M. Gulayeva, “A review of niching genetic algorithms for multimodal function optimization,” Cybernetics and Systems Analysis, vol. 49, no. 6, pp. 815-820, 2013.

[4]X. Zhang, L. Wang, B. Huang, “An improved niche ant colony algorithm for multi-modal function optimization,” International Conference on Instrumentation & Measurement Sensor Network and Automation, pp. 403-406, 2012.

[5]B.Y. Qu, J.J. Liang, P.N. Suganthan, “Niching particle swarm optimization with local search for multi-modal optimization,” Information Sciences, vol. 197, pp. 131-143, 2012.

[6]S.C. Esquivel, C. Coello Coello, “On the use of particle swarm optimization with multimodal functions,” The Congress on Evolutionary Computation, pp. 1130-1136, 2003. 

[7]L. Yu, X. Ling, Y. Liang, M. lv, G. Liu, “Artificial bee colony algorithm for multimodal function optimization,” Advances Science Letters, vol. 11, no. 1, pp. 503-506, 2012.

[8]S. Biswas, S. Kundu, S. Das, “Inducing niching behavior in differential evolution through local information sharing,” IEEE Transactions on Evolutionary Computation, Early Access.

[9]R. Thomsen, “Multimodal optimization using crowding-based differential evolution,” The Congress on Evolutionary Computation, pp. 1382-1389, 2004.

[10]D. Shen, Y. Li, “Multimodal optimization using crowding differential evolution with spatially neighbors best search,” Journal of Software, vol. 8, no. 4, pp. 932-938, 2013.

[11]B. Sareni, L. Krahenbuhl, “Fitness sharing and niching methods revisited,” IEEE Transactions on Evolutionary Computation, vol.2, no. 3, pp. 1382-1389, 2004.

[12]O. Mengsheal, D. Goldberg, “Probabilistic crowding, deterministic crowding with probabilistic replacement,” GECCO, pp. 409-416, 1999.

[13]J.E. Vitela, o. Castona, “A real-coded niching memetic algorithm for continuous multimodal function optimization,” The Congress on Evolutionary Computation, pp. 2170-2177, 2008.

[14]D. Cavicchio, Adapting search using simulated evolution. PhD Thesis, Department of Industrial Engineering, University of Michigan Ann Arbor, 1970.

[15]B.L. Miller, M.J. Shaw, “Genetic algorithms with dynamic niche sharing for multimodal function optimization,” International Conference on Evolutionary Computation, pp. 786-791, 1996.

[16]D.E. Goldberg, J. Richardson, “Genetic algorithms with sharing for multimodal function optimization,” International Conference on Genetic Algorithms, pp. 41-49, 1987.

[17]L. Qing, W. Gang, Y. Zaiyve, W. Qiuping, “Crowding clustering genetic algorithm for multimodal function optimization,” Applied Soft Computing, vol. 8, no. 1, pp. 88-95, 2008.

[18]S. Kamyab, M. Eftekhari, “Using a self-adaptive neighborhood scheme with crowding replacement memory in genetic algorithm for multimodal optimization,” Swarm and Evolutionary Computation, vol. 12, pp. 1-17, 2013.

[19]R. Storn, K. Price, Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous space. International Computer Science Institute, Technical Report, TR-95-012, 1995.

[20]R. Storn, Differential evolution design of an IIR-filter with requirements for magnitude and group delay. International Computer Science Institute, Technical Report, TR-95-026, 1995.

[21]R. Storn, “Differential evolution design of an IIR-filter with requirements for magnitude and group delay,” International Conference on Evolutionary Computation, pp. 268-273, 1995.

[22]R. Storn, “On the usage of differential evolution for function optimization,” North America Fuzzy Information Processing Society, pp. 519-523, 1996.

[23]H.Y. Fan, J. Lampinen, “A trigonometric mutation operation to differential evolution,” Journal of Global Optimization, vol. 27, no. 1, pp. 105-129, 2003.

[24]S. Das, A. Konar, U.K. Chakrabarty, “Two improved differential evolution schemes for faster global search,” GECCO, pp. 991-998, 2005.

[25]X. Li, A. Engelbrecht, M.G. Epitropakis, Benchmark function for CEC2013 Special Session and competition on niching methods for multimodal function optimization. Technical Report, Evolutionary Computation and Machine Learning Group, RMIT University, Australia, 2012.