Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies
Abstract In this paper, we propose a novel multi-objective particle swarm optimization algorithm with a task allocation and archive-guided mutation strategy (TAMOPSO), which effectively solves the problem of inefficient search in traditional algorithms by assigning different evolutionary tasks to pa...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-05-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-99730-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849312122230538240 |
|---|---|
| author | Jianjie Chen Yanmin Liu Yi Luo Aijia Ouyang Jie Yang Wuer Bai |
| author_facet | Jianjie Chen Yanmin Liu Yi Luo Aijia Ouyang Jie Yang Wuer Bai |
| author_sort | Jianjie Chen |
| collection | DOAJ |
| description | Abstract In this paper, we propose a novel multi-objective particle swarm optimization algorithm with a task allocation and archive-guided mutation strategy (TAMOPSO), which effectively solves the problem of inefficient search in traditional algorithms by assigning different evolutionary tasks to particles with different characteristics. First, TAMOPSO divides multiple subpopulations according to the particle distribution status of each iteration of the population and designs a new task allocation mechanism to improve the evolutionary search efficiency. Second, TAMOPSO adopts an adaptive Lévy flight strategy according to the population growth rate, automatically increasing the global variation probability to expand the search range when the population converges and enhancing the local variation to conduct fine search when the population disperses to realize the dynamics of global and local variations. Finally, TAMOPSO measures the contribution of particles to the population optimization through the particle evolution contribution rate index and filters out valuable historical solutions for subsequent reuse to accelerate the convergence speed; in addition, TAMOPSO improves the individual optimal particle selection mechanism, changes the bias of the traditional algorithm, ensures that each particle has an equal opportunity, and enhances the fairness of the selection process. The fairness of the selection process is enhanced at the same time. The performance of TAMOPSO is compared with ten existing algorithms on 22 standard test problems, and the experimental results show that TAMOPSO outperforms the other algorithms in several standard test problems and has better performance in solving multi-objective problems. |
| format | Article |
| id | doaj-art-762fec8605a84097ab9891d795bb1e31 |
| institution | Kabale University |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-05-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-762fec8605a84097ab9891d795bb1e312025-08-20T03:53:12ZengNature PortfolioScientific Reports2045-23222025-05-0115113210.1038/s41598-025-99730-1Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategiesJianjie Chen0Yanmin Liu1Yi Luo2Aijia Ouyang3Jie Yang4Wuer Bai5School of Data Science and Information Engineering, Guizhou Minzu UniversitySchool of Mathematics, Zunyi Normal CollegeSchool of Mathematics and Statistics, Guizhou UniversitySchool of Mathematics, Zunyi Normal CollegeSchool of Mathematics, Zunyi Normal CollegeSchool of Data Science and Information Engineering, Guizhou Minzu UniversityAbstract In this paper, we propose a novel multi-objective particle swarm optimization algorithm with a task allocation and archive-guided mutation strategy (TAMOPSO), which effectively solves the problem of inefficient search in traditional algorithms by assigning different evolutionary tasks to particles with different characteristics. First, TAMOPSO divides multiple subpopulations according to the particle distribution status of each iteration of the population and designs a new task allocation mechanism to improve the evolutionary search efficiency. Second, TAMOPSO adopts an adaptive Lévy flight strategy according to the population growth rate, automatically increasing the global variation probability to expand the search range when the population converges and enhancing the local variation to conduct fine search when the population disperses to realize the dynamics of global and local variations. Finally, TAMOPSO measures the contribution of particles to the population optimization through the particle evolution contribution rate index and filters out valuable historical solutions for subsequent reuse to accelerate the convergence speed; in addition, TAMOPSO improves the individual optimal particle selection mechanism, changes the bias of the traditional algorithm, ensures that each particle has an equal opportunity, and enhances the fairness of the selection process. The fairness of the selection process is enhanced at the same time. The performance of TAMOPSO is compared with ten existing algorithms on 22 standard test problems, and the experimental results show that TAMOPSO outperforms the other algorithms in several standard test problems and has better performance in solving multi-objective problems.https://doi.org/10.1038/s41598-025-99730-1Multi-objective particle swarm optimizationSubpopulation partitioningTask allocationLévy flight strategyIndividual optimal selection |
| spellingShingle | Jianjie Chen Yanmin Liu Yi Luo Aijia Ouyang Jie Yang Wuer Bai Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies Scientific Reports Multi-objective particle swarm optimization Subpopulation partitioning Task allocation Lévy flight strategy Individual optimal selection |
| title | Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| title_full | Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| title_fullStr | Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| title_full_unstemmed | Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| title_short | Multi-objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| title_sort | multi objective particle swarm optimization algorithm for task allocation and archived guided mutation strategies |
| topic | Multi-objective particle swarm optimization Subpopulation partitioning Task allocation Lévy flight strategy Individual optimal selection |
| url | https://doi.org/10.1038/s41598-025-99730-1 |
| work_keys_str_mv | AT jianjiechen multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies AT yanminliu multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies AT yiluo multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies AT aijiaouyang multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies AT jieyang multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies AT wuerbai multiobjectiveparticleswarmoptimizationalgorithmfortaskallocationandarchivedguidedmutationstrategies |