QCA & CQCA: Quad Countries Algorithm and Chaotic Quad Countries Algorithm

• Autorzy: Soltani-Sarvestani M. A. , Lotfi S.
• Języki publikacji: EN

Abstrakty

EN

This paper introduces an improved evolutionary algorithm based on the Imperialist Competitive Algorithm (ICA), called Quad Countries Algorithm (QCA) and with a little change called Chaotic Quad Countries Algorithm (CQCA). The Imperialist Competitive Algorithm is inspired by socio-political process of imperialistic competition in the real world and has shown its reliable performance in optimization problems. This algorithm converges quickly, but is easily stuck into a local optimum while solving high-dimensional optimization problems. In the ICA, the countries are classified into two groups: Imperialists and Colonies which Imperialists absorb Colonies, while in the proposed algorithm two other kinds of countries, namely Independent and Seeking Independence countries, are added to the countries collection which helps to more exploration. In the suggested algorithm, Seeking Independence countries move in a contrary direction to the Imperialists and Independent countries move arbitrarily that in this paper two different movements are considered for this group; random movement (QCA) and Chaotic movement (CQCA). On the other hand, in the ICA the Imperialists’ positions are fixed, while in the proposed algorithm, Imperialists will move if they can reach a better position compared to the previous position. The proposed algorithm was tested by famous benchmarks and the compared results of the QCA and CQCA with results of ICA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Particle Swarm inspired Evolutionary Algorithm (PS-EA) and Artificial Bee Colony (ABC) show that the QCA has better performance than all mentioned algorithms. Between all cases, the QCA, ABC and PSO have better performance respectively about 50%, 41.66% and 8.33% of cases.

Słowa kluczowe

EN

optimization; Imperialist Competitive Algorithm (ICA); Independent country; Seeking Independent country; Quad Countries Algorithm (QCA) and Chaotic Quad Countries Algorithm (CQCA)

• Wydawca: Komisja Informatyki Polskiej Akademii Nauk, Oddział w Gdańsku
• Czasopismo: Journal of Theoretical and Applied Computer Science
• Rocznik: 2012
• Tom: Vol. 6, nr 3
• Strony: 3--20
• Opis fizyczny: Bibliogr. 15 poz., rys., tab.

Twórcy

autor

Soltani-Sarvestani M. A.

autor

Lotfi S.

• Computer Engineering Department, University College of Nabi Akram, Tabriz, Iran,

Bibliografia

• [1] Sarimveis H., Nikolakopoulos A.: A Life Up Evolutionary Algorithm for Solving Nonlinear Constrained Optimization Problems. Computer & Operation Research, 32(6):pp.1499-1514 (2005)
• [2] Mühlenbein H., Schomisch M., Born J.: The Parallel Genetic Algorithm as Function Optimizer. Proceedings of The Forth International Conference on Genetic Algorithms, University of California, San Diego, pp. 270-278 (1991)
• [3] Holland J. H.: ECHO: Explorations of Evolution in a Miniature World. In: Farmer J. D., Doyne J., editors, Proceedings of the Second Conference on Artificial Life (1990)
• [4] Melanie M.: An Introduction to Genetic Algorithms. Massachusett's: MIT Press (1999)
• [5] Kennedy J., Eberhart R.C.: Particle Swarm Optimization. In: Proceedings of IEEE, pp. 1942-1948 (1995)
• [6] Atashpaz-Gargari E., Lucas C.: Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition. IEEE Congress on Evolutionary Computation (CEC 2007), pp. 4661-4667 (2007) 20 M. A. Soltani-Sarvestani, Shahriar Lotfi
• [7] Atashpaz-Gargari E., Hashemzadeh F., Rajabioun R., Lucas C.: Colonial Competitive Algorithm: A novel approach for PID controller design in MIMO distillation column process. International Journal of Intelligent Computing and cybernetics (IJICC), Vol. 1 No. 3, pp. 337-355 (2008)
• [8] Zhang Y., Wang Y., Peng C.: Improved Imperialist Competitive Algorithm for Constrained Optimization. International Forum on Computer Science-Technology and Applications (2009)
• [9] Bahrami H., Feaz K., Abdechiri M.: Imperialist Competitive Algorithm using Chaos Theory for Optimization (CICA). Proceedings of the 12th International Conference on Computer Modelling and Simulation (2010)
• [10] Bahrami H., Feaz K., Abdechiri M.: Adaptive Imperialist Competitive Algorithm (AICA). Proceedings of The 9th IEEE international Conference on Cognitive Informatics (ICCI'10) (2010)
• [11] Karaboga D., Basturk B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization, vol. 39, Issue.3, pp. 459-471 (2007)
• [12] Srinivasan D., Seow T.H.: Evolutionary Computation. CEC ’03, 8--12 Dec. 2003, 4, Canberra, Australia, pp. 2292-2297 (2003)
• [13] Schuster H.G.: Deterministic Chaos: An Introduction. 2nd reviseded, Weinheim, Federal Republic of Germany: Physick-Verlag GmnH (1988)
• [14] Zheng W.M.: Kneading plane of the circle map. Chaos, Solitons & Fractals, 4:1221 (1994)
• [15] Soltani-Sarvestani M.A., Lotfi S., Ramezani F.: Quad Countries Algorithm (QCA). In: Proc. of the 4th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2012), Part III, LNAI, pp. 119-129 (2012)