An Improved Multi-Objective Particle Swarm Optimization Algorithm Based on Adaptive Local Search
This paper demonstrates a novel local search approach based on an adaptive (time variant) search space index improving the exploration ability as well as diversity in multi-objective Particle Swarm Optimization. The novel strategy searches for the neighbourhood particles in a range which gradually increases with iterations. Particles get updated according to the rules of basic PSO and the non-dominated particles are subjected to Evolutionary update archiving. To improve the diversity, the archive is truncated based on crowding distance parameter. The leader is chosen among the candidates in the archive based on another local search. From the simulation results, it is clear that the implementation of the new scheme results in better convergence and diversity as compared to NSGA-II, CMPSO, and SMPSO reported in literature. Finally, the proposed algorithm is used to solve machine design based engineering problems from literature and compared with existing algorithms.