Improved Niching Multi-objective Particle Swarm Optimization Algorithm
Yuan Yong-quan · Jisuanji gongcheng · 2011
This paper describes a niching multi-objective Particle Swarm Optimization(PSO) algorithm.The algorithm applies ring neighborhood topology,which does not require any niching parameters.Hence,it can resolve the problem of traditional parameters setting.Non-dominated sorting and dynamic weight method are used to select the best particles.To enhance the global exploratory capability,a mutation operation is to operate when the crowding-distance decreases to the required precision.The proposed algorithm is tested by five well-known benchmark test functions ZDT1~ZDT4 and ZDT6.Simulation results prove that this algorithm performs better than those classical algorithms do in convergence and diversity.