Despite the success of the imperialist competitive algorithm(ICA)in solving optimization problems,it still suffers from frequently falling into local minima and low convergence speed.In this paper,a fuzzy version of t...Despite the success of the imperialist competitive algorithm(ICA)in solving optimization problems,it still suffers from frequently falling into local minima and low convergence speed.In this paper,a fuzzy version of this algorithm is proposed to address these issues.In contrast to the standard version of ICA,in the proposed algorithm,powerful countries are chosen as imperialists in each step;according to a fuzzy membership function,other countries become colonies of all the empires.In absorption policy,based on the fuzzy membership function,colonies move toward the resulting vector of all imperialists.In this algorithm,no empire will be eliminated;instead,during the execution of the algorithm,empires move toward one point.Other steps of the algorithm are similar to the standard ICA.In experiments,the proposed algorithm has been used to solve the real world optimization problems presented for IEEE-CEC 2011 evolutionary algorithm competition.Results of experiments confirm the performance of the algorithm.展开更多
文摘Despite the success of the imperialist competitive algorithm(ICA)in solving optimization problems,it still suffers from frequently falling into local minima and low convergence speed.In this paper,a fuzzy version of this algorithm is proposed to address these issues.In contrast to the standard version of ICA,in the proposed algorithm,powerful countries are chosen as imperialists in each step;according to a fuzzy membership function,other countries become colonies of all the empires.In absorption policy,based on the fuzzy membership function,colonies move toward the resulting vector of all imperialists.In this algorithm,no empire will be eliminated;instead,during the execution of the algorithm,empires move toward one point.Other steps of the algorithm are similar to the standard ICA.In experiments,the proposed algorithm has been used to solve the real world optimization problems presented for IEEE-CEC 2011 evolutionary algorithm competition.Results of experiments confirm the performance of the algorithm.
