Abstract

In the past few decades, multi-objective particle swarm optimization (PSO) has increasingly attracted attention from scientists. To obtain a set of more accurate and well-distributed solutions, many variations of multi-objective PSO algorithms have been proposed. However, for complicated multi-objective problems, existing multi-objective PSO algorithms are prone to falling into local optima because of their weak global search capability. In this study, a modified multi-objective particle swarm optimization algorithm based on levy flight and double-archive mechanism (MOPSO-LFDA) is proposed to alleviate this problem. On one hand, in the evolution process of the particles, levy flight is combined with PSO to avoid the algorithm falling into local optima. By expanding the search scope of the particles, levy flight can improve the global search ability of the particles and make them jump out of local optima with a high probability. On the other hand, when maintaining external archives, in addition to the primary external archive, a secondary external archive is created to avoid unnecessary removal of the particles that may be generated by traditional maintenance approaches. With the proposed double-archive mechanism, more useful particles can be kept, and thus the diversity of the solutions is increased. Moreover, in terms of accelerating the convergence rate, a novel leader selection strategy is presented, which selects particles closer to the boundary of the attainable objective set and with larger crowding distance as leaders in optimization. The proposed algorithm outperforms existing state-of-the-art multi-objective algorithms on benchmark test functions for its fast convergence and excellent accuracy.

Highlights

  • Traditional single-objective optimization algorithm such as genetic algorithm (GA) and particle swarm optimization (PSO) could find the optimal solution to a problem quickly and efficiently in most cases

  • It is necessary to compare the performance of multi-objective particle swarm optimization algorithm (MOPSO)-LFDA and MOQPSO-DSCT to test the performance of the levy flight strategy in convergence performance and double-archive mechanism in diversity

  • Because MOPSO-LFDA adopts the strategy in speed-constrained Multi-objective Particle Swarm Optimization (SMPSO) to constrain the velocity, it is necessary to compare the performance of MOPSO-LFDA and SMPSO to test whether the addition of levy flight strategy, doublearchive mechanism and the novel leader selection strategy can increase the convergence and diversity of the solutions

Read more

Summary

Introduction

Traditional single-objective optimization algorithm such as genetic algorithm (GA) and particle swarm optimization (PSO) could find the optimal solution to a problem quickly and efficiently in most cases. The appropriate optimal solutions for these MOPs. In MOPs, the objectives to be optimized are normally in conflict with respect to each other, and the optimization of one of the objectives must be substituted by other objectives, so it is difficult to evaluate the merits of the solutions of MOPs. We aim to find good trade-off solutions that represent the best possible compromises among the objectives [3]. We aim to find good trade-off solutions that represent the best possible compromises among the objectives [3] To solve these MOPs, many kinds of multi-objective evolutionary algorithms (MOEAs) such as NSGA-II [4], PAES [5] and SPEA2 [6] have been proposed.

Objectives
Results
Conclusion

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 call

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.