Abstract
Although the principle of multi-objective particle swarm optimization is simple and the operability is strong, it is still prone to local convergence and the convergence accuracy is not high. In order to solve the above problems, we propose a multi-objective particle swarm optimization algorithm based on multi strategies and archives. This algorithm is mainly divided into three important parts. Firstly, in the phase of sorting the optimal solutions, the solution set is stored in two different archives according to different conditions; secondly, in order to increase the diversity of the optimal solutions, several strategies are adopted in updating archives and maintaining archives’ scale. Finally, Gaussian perturbation strategy is applied to increase the distribution of particles and improve the quality of the optimal solution set. We compare the proposed algorithm with other algorithms and test it with different test indexes, Pareto graphs, and convergence graphs. The results show that this proposed algorithm has remarkable performance and the proposed method has advantages.
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.
