Swarm optimization based on utopia point guided search

This article demonstrates the implementation of a novel local search approach based on Utopia point guided search, thus improving the exploration ability of multi- objective Particle Swarm Optimization. This strategy searches for best particles based on the criteria of seeking solutions closer to the Utopia point, thus improving the convergence to the Pareto-optimal front. The elite non-dominated selected particles are stored in an archive and updated at every iteration based on least crowding distance criteria. The leader is chosen among the candidates in the archive using the same guided search. From the simulation results based on many benchmark tests, the new algorithm gives better convergence and diversity when compared to existing several algorithms such as NSGA-II, CMOPSO, SMPSO, PSNS, DE+MOPSO and AMALGAM. Finally, the proposed algorithm is used to solve mechanical design based multi-objective optimization problems from the literature, where it shows the same advantages.