Abstract
In order to enhance the convergence and distribution of multi-objective particle swarm algorithm, an improved multi-objective particle swarm optimization algorithm was proposed. Linear decreasing inertia weight was used to update. The method can improve the deficiency that the algorithm falls into local optimal easily. The improved Logistic mapping was used to increase ergodicity of the particles. The method can expand the search scope. At the same time, the elite archiving mechanism and the mutation probability were introduced to increase the disturbance. The method can improve the local optimal. Compared with the real Pareto front, NSGA-II and MOEAD algorithm, the simulation shows that the algorithm proposed in the paper is effective.
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 callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: 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.
