Abstract
This study introduces a multi-objective version of the recently proposed colonial competitive algorithm (CCA) called multi-objective colonial competitive algorithm. In contrast to original CCA, which used the combination of the objective functions to solve multi-objective problems, the proposed algorithm incorporates the Pareto concept to store simultaneously optimal solutions of multiple conflicting functions. Another novelty of this paper is the integration of the variable neighborhood search as an assimilation strategy, in order to improve the performance of the obtained solutions. To prove the effectiveness of the proposed algorithm, a set of standard test functions with high dimensions and some multi-objective engineering design problems are investigated. The results obtained amply demonstrate that the proposed approach is efficient and is able to yield a wide spread of solutions with good convergence to true Pareto fronts, compared with other proposed methods in the literature.