Abstract
Particle swarm optimization is a very competitive swarm intelligence algorithm for multi-objective optimization problems, but because of it is easy to fall into local optimum solution, and the convergence and accuracy of Pareto solution set is not satisfactory. So we proposed a multi-swarm multi-objective particle swarm optimization based on decomposition (MOPSO_MS), in the algorithm each sub-swarm corresponding to a sub-problem which decomposed by multi-objective decomposition method, and we constructed a new updates strategy for the velocity. Finally, through simulation experiments and compare with the state-of-the-art multi-objective particle swarm algorithm on ZDT test function proved the convergence and the accuracy of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
