A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy
The multi-objective particle swarm optimization algorithm (MOPSO) is widely used to solve multi-objective optimization problems. In the article, a multi-objective particle swarm optimization algorithm based on decomposition and multi-selection strategy is proposed to improve the search efficiency. F...
Gespeichert in:
| Veröffentlicht in: | Computers, materials & continua Jg. 82; H. 1; S. 997 - 1026 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Henderson
Tech Science Press
2025
|
| Schlagworte: | |
| ISSN: | 1546-2226, 1546-2218, 1546-2226 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The multi-objective particle swarm optimization algorithm (MOPSO) is widely used to solve multi-objective optimization problems. In the article, a multi-objective particle swarm optimization algorithm based on decomposition and multi-selection strategy is proposed to improve the search efficiency. First, two update strategies based on decomposition are used to update the evolving population and external archive, respectively. Second, a multi-selection strategy is designed. The first strategy is for the subspace without a non-dominated solution. Among the neighbor particles, the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away from the search particle and the global optimal solution is selected as the personal optimal solution to enhance global search. The second strategy is for the subspace with a non-dominated solution. In the neighbor particles, two particles are randomly selected, one as the global optimal solution and the other as the personal optimal solution, to enhance local search. The third strategy is for Pareto optimal front (PF) discontinuity, which is identified by the cumulative number of iterations of the subspace without non-dominated solutions. In the subsequent iteration, a new probability distribution is used to select from the remaining subspaces to search. Third, an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency. Finally, the proposed algorithm is compared with five multi-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems. The results show that the proposed algorithm has better performance. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1546-2226 1546-2218 1546-2226 |
| DOI: | 10.32604/cmc.2024.057168 |