Imperialist Competitive Algorithms with Perturbed Moves for Global Optimization

Article Preview

Abstract:

Imperialist Competitive Algorithm (ICA) is a new population-based evolutionary algorithm. Previous works have shown that ICA converges quickly but often to a local optimum. To overcome this problem, this work proposed two modifications to ICA: perturbed assimilation move and boundary bouncing. The proposed modifications were applied to ICA and tested using six well-known benchmark functions with 30 dimensions. The experimental results indicate that these two modifications significantly improve the performance of ICA on all six benchmark functions.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3135-3139

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. Atashpaz-Gargari and C. Lucas: IEEE Congress on Evolutionary Computation, (2007), pp.4661-4667.

Google Scholar

[2] L.D.S. Coelho, L.D. Afonso and P. Alotto: IEEE Trans. Magn. Vol. 48 No. 2 (2012), pp.579-582.

Google Scholar

[3] T. Jain and M.J. Nigam: Expert Syst. Appl. Vol. 37 No. 5 (2010), pp.3706-3713.

Google Scholar

[4] S. Talatahari, B.F. Azar, R. Sheikholeslami and A.H. Gandomi: Commun. Nonlinear Sci. 17 (2012), no. 3, pp.1312-1319.

Google Scholar

[5] Matlab code on http://www.mathworks.com/matlabcentral/fileexchange/22046-imperialist-competitive-algorithm-ica

Google Scholar

[6] Z. Yang, W. Yong and P. Cheng: IFCSTA (2009), pp.204-207.

Google Scholar

[7] H. Bahrami, K. Faez and M. Abdechiri: 12th International Conference on Computer Modelling and Simulation, (2010), pp.98-103.

Google Scholar