emcso: an elitist multi-objective cat swarm optimization

This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimization algorithm (emcso) and its application to solve a multi-objective knapsack problem. the multi-objective optimizers try to find the closest solutions to true pareto front (pof) where it will be achieved by finding the less-crowded non-dominated solutions. the proposed method applies cat swarm optimization (cso), a swarm-based algorithm with ability of exploration and exploitation, to produce offspring solutions and uses the nondominated sorting method to find the solutions as close as to pof and crowding distance technique to obtain a uniform distribution among the non-dominated solutions. also, the algorithm is allowed to keep the elites of population in reproduction process and use an oppositionbased learning method for population initialization to enhance the convergence speed. the proposed algorithm is tested on standard test functions (zitzler’ functions: zdt) and its performance is compared with traditional algorithms and is analyzed based on performance measures of generational distance (gd), inverted gd, spread, and spacing. the simulation results indicate that the proposed method gets the quite satisfactory results in comparison with other optimization algorithms for functions of zdt1 and zdt2. moreover, the proposed algorithm is applied to solve multi-objective knapsack problem.