Imperialist Competitive Algorithm with Updated Assimilation for the Solution of Real Valued Optimization Problems

Abstract

In this paper, an improved imperialistic competitive algorithm is presented for real-valued optimization problems. A new method is introduced for the movement of colonies towards their imperialist, which is called assimilation. The proposed method uses Euclidean distance along with Pearson correlation coefficient as an operator for assimilating colonies with respect to their imperialists. Applications of the proposed algorithm to classical and recently published hard benchmark problems, and statistical analysis associated with the corresponding experimental results illustrated that the achieved success is significantly better than a number of state-of-the art methods.