Imperialist competitive algorithm explained

In computer science, imperialist competitive algorithms are a type of computational method used to solve optimization problems of different types.^{[1] [2]} Like most of the methods in the area of evolutionary computation, ICA does not need the gradient of the function in its optimization process. From a specific point of view, ICA can be thought of as the social counterpart of genetic algorithms (GAs). ICA is the mathematical model and the computer simulation of human social evolution, while GAs are based on the biological evolution of species.

Metaphor

Figure 1 shows the flowchart of the Imperialist Competitive Algorithm. This algorithm starts by generating a set of candidate random solutions in the search space of the optimization problem. The generated random points are called the initial Countries. Countries in this algorithm are the counterpart of Chromosomes in GAs and Particles in Particle Swarm Optimization (PSO) and it is an array of values of a candidate solution of the optimization problem. The cost function of the optimization problem determines the power of each country. Based on their power, some of the best initial countries (the countries with the least cost function value), become Imperialists and start taking control of other countries (called colonies) and form the initial Empires.

The two main operators of this algorithm are Assimilation and Revolution. Assimilation makes the colonies of each empire get closer to the imperialist state in the space of socio-political characteristics (optimization search space). Revolution brings about sudden random changes in the position of some of the countries in the search space. During assimilation and revolution a colony might reach a better position and has the chance to take the control of the entire empire and replace the current imperialist state of the empire.^[3]

Imperialistic Competition is another part of this algorithm. All the empires try to win this game and take possession of colonies of other empires. In each step of the algorithm, based on their power, all the empires have a chance to take control of one or more of the colonies of the weakest empire.

Algorithm continues with the mentioned steps (Assimilation, Revolution, Competition) until a stop condition is satisfied.

Algorithm

The above steps can be summarized as the below pseudocode. 0) Define objective function:

f( x ), x = (x _{1,x} _{2,...,x} _{d);} 1) Initialization of the algorithm. Generate some random solution in the search space and create initial empires. 2) Assimilation: Colonies move towards imperialist states in different directions. 3) Revolution: Random changes occur in the characteristics of some countries. 4) Position exchange between a colony and Imperialist. A colony with a better position than the imperialist, has the chance to take the control of empire by replacing the existing imperialist. 5) Imperialistic competition: All imperialists compete to take possession of colonies of each other. 6) Eliminate the powerless empires. Weak empires lose their power gradually and they will finally be eliminated. 7) If the stop condition is satisfied, stop, if not go to 2. 8) End

See also

• List of metaphor-based metaheuristics

Notes and References

1. Atashpaz-Gargari. E.. Lucas. C. Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation. 2007. 7. 4661–4666.
2. Hosseini. S.. Al Khaled. A.. A survey on the Imperialist Competitive Algorithm metaheuristic: Implementation in engineering domain and directions for future research. Applied Soft Computing. 2014. 24. 1078–1094. 10.1016/j.asoc.2014.08.024.
3. Nazari-Shirkouhi. S.. Eivazy. H.. Ghodsi. R.. Rezaie. K.. Atashpaz-Gargari. E.. Solving the Integrated Product Mix-Outsourcing Problem by a Novel Meta-Heuristic Algorithm: Imperialist Competitive Algorithm. Expert Systems with Applications. 2010. 37. 12. 7615–7626. 10.1016/j.eswa.2010.04.081.