Imperialist Competitive Algorithm (ICA), also known as Colonial Competitive Algorithm (CCA), is a sociopolitical metaheuristics, inspired by historical colonization process and competition among imperialists, to capture more colonies. Set of countries (solutions) in ICA, is partitioned to form several Empires, which contains a single Imperialist and several other weaker countries, called Colonies. This algorithm is proposed by Esmaeil Atashpaz Gargari and Caro Lucas, in 2007, in this paper.
The algorithm consists of two competition mechanisms: (a) Intra-Empire Competition, which is the competition among the members of an empire, and (b) Inter-Empire Competition, which is the competition among empires, according to overall objective value of the empire. Inside the empire, the strongest country will be the imperialist (leader) of the whole empire; this is the intra-empire competition.
To evaluate the overall objective for an empire, a linear combination of imperialist’s objective value and mean of objective values of colonies in the empire, is used. After all empires are evaluated, the weakest empire can be determined. After that, all other empires compete to capture the weakest colony of the weakest empire; this is the inter-empire competition. For more information on the Imperialist Competitive Algorithm (ICA), you can refer to the related article on Wikipedia, located here.
In this post, we are going to share with you, a structured open-source implementation of Imperialist Competitive Algorithm (ICA) in MATLAB. If you are familiar with MATLAB programming language, you will find it easy, to use the provided source codes, in your research and projects.
The download link of this project follows.
Implementation of Imperialist Competitive Algorithm (ICA) in MATLABDownload