An improved imperialist competitive algorithm for multi-objective optimization

This article proposes an improved imperialistic competitive algorithm to solve multi-objective optimization problems. The proposed multi-objective imperialistic competitive algorithm (MOICA) uses the elitist strategy, based on the mutation and crossover as in genetic algorithms, and the Pareto concept to store simultaneously optimal solutions of multiple conflicting functions. Three performance metrics are used to evaluate the performance of the new algorithm: convergence to the true Pareto-optimal set, solution diversity and robustness, characterized by the variance over 10 runs. To validate the efficiency of the proposed algorithm, several multi-objective standard test functions with true solutions are used. The obtained results show that the MOICA outperforms most of the methods available in the literature. The proposed algorithm can also handle multi-objective engineering design problems with high dimensions.