A modified colonial competitive algorithm for optimizing convex functions

Abstract

Purpose – This article is going to introduce a modified variant of the imperialist competitive algorithm (ICA). The paper aims to discuss these issues. Design/methodology/approach – ICA is a meta-heuristic algorithm that is introduced based on a socio-politically motivated global search strategy. It is a population-based stochastic algorithm to control more countries. The most powerful countries are imperialists and the weakest countries are colonies. Colonies movement toward their relevant imperialist, and making a competition among all empires to posses the weakest colonies of the weakest empires, form the basis of the ICA. This fact that the imperialists also need to model and they move towards top imperialist state is the most common type of political rules from around the world. This paper exploits these new ideas. The modification is the empire movement toward the superior empire for balancing the exploration and exploitation abilities of the ICA. Findings – The algorithms are used for optimization that have shortcoming to deal with accuracy rate and local optimum trap and they need complex tuning procedures. MICA is proposed a way for optimizing convex function with high accuracy and avoiding to trap in local optima rather than using original ICA algorithm by implementing some modification on it. Originality/value – Therefore, several solution procedures, including ICA, modified ICA, and genetic algorithm and particle swarm optimization algorithm are proposed. Finally, numerical experiments are carried out to evaluate the effectiveness of models as well as solution procedures. Test results present the suitability of the proposed modified ICA for convex functions with little fluctuations.