Yousef ABDI, Mahmoud LAK, Yousef SEYFARI

GICA: Imperialist competitive algorithm with globalization mechanism for optimization problems

The imperialist competitive algorithm (ICA) is a recent global search strategy developed based on human social evolutionary phenomena in the real world. However, the ICA has the drawback of trapping in local optimum solutions when used for high-dimensional or complex multimodal functions. In order to deal with this situation, in this paper an improved ICA, named GICA, is proposed that can enhance ICA performance by using a new assimilation method and establishing a relationship between countries inspired by the globalization concept in the real world. The proposed algorithm is evaluated using a set of well-known benchmark functions for global optimization. Obtained results show the efficiency and effectiveness of the method and show that this strategy can deal with the local optimum problem.

PDF

___

[1] Mitchell M. An Introduction to Genetic Algorithms. Cambridge, MA, USA: MIT Press, 1998.
[2] Kennedy J, Eberhart RC. Particle swarm optimization. In: IEEE 1995 International Conference on Neural Networks; 27 November 1995; Perth, Australia. New York, NY, USA: IEEE. pp. 1942-1948.
[3] Dorigo M, Maniezzo V, Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE T Syst Man Cyb 1996; 26: 29-41.
[4] Karaboga D. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06 2005. Kayseri, Turkey: Erciyes University, Engineering Faculty, Computer Engineering Department.
[5] Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE 2007 Congress on Evolutionary Computation; 2528 September 2008; Singapore. New York, NY, USA: IEEE. pp. 4661-4667.
[6] Ardalan Z, Karimi S, Poursabzi O, Naderi B. A novel imperialist competitive algorithm for generalized traveling salesman problems. Appl Soft Comput 2015; 26: 546-555.
[7] Hosseini S, Al-Khaled A. A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl Soft Comput 2014; 24: 1078-1094.
[8] Duan H, Huang L. Imperialist competitive algorithm optimized artificial neural networks for ucav global path planning. Neurocomputing 2014; 125: 166-171.
[9] Abdechiri M, Faez K, Bahrami H. Adaptive imperialist competitive algorithm (AICA). In: IEEE 9th International Conference on Cognitive Informatics; 79 July 2010; Beijing, China. New York, NY, USA: IEEE. pp. 940-945.
[10] Talatahari S, Azar B F, Sheikholeslami R, Gandomi AH. Imperialist competitive algorithm combined with chaos for global optimization. Commun Nonlinear Sci 2012; 17: 1312-1319.
[11] Lin JL, Chuan HC, Tsai YH, Cho CW. Improving imperialist competitive algorithm with local search for global optimization. In: 7th Asia Modelling Symposium; 2325 July 2013; Hong Kong. New York, NY, USA: IEEE. pp. 61-64.
[12] Behnamian J, Zandieh MA. Discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst Appl 2011; 38: 14490-14498.
[13] Ramezani F, Lotfi S. Social-based algorithm (SBA). Appl Soft Comput 2013; 13: 2837-2856.
[14] Ghodrati A, Malakooti V, Soleimani M. A hybrid ICA/PSO algorithm by adding independent countries for large scale global optimization. Lect Notes Comput Sc 2012; 7198: 99-108.
[15] Lin JL, Tsai YH, Yu CY, Li MS. Interaction enhanced imperialist competitive algorithms. Algorithms 2012; 5: 433-448.
[16] Cooper F. What is the concept of globalization good for? An African historians perspective. Afr Affairs 2001; 100: 189-213.
[17] Wright AH. Genetic algorithms for real parameter optimization. In: Rawlins G, editor. Foundations of Genetic Algorithms. San Mateo, CA: USA: Morgan Kaufmann Publishers Inc., 1991. pp. 205-218.
[18] Karaboga D, Akay B. A comparative study of artificial bee colony algorithm. Appl Math Comput 2009; 214: 108-132.
[19] Qin AK, Suganthan PN. Self-adaptive differential evolution algorithm for numerical optimization. In: IEEE Congress on Evolutionary Computation; 25 September 2005; Edinburgh, UK. New York, NY, USA: IEEE. pp. 1785-1791.
[20] Wilcoxon F. Individual comparisons by ranking methods. Biometrics 1945; 1: 80-83.
[21] Derrac J, Garc´ıa S, Molina D, Herrera F. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 2011; 1: 3-18.