Treffer: A dual-archive evolutionary algorithm based on multitasking for multimodal multi-objective optimization with local Pareto solutions.

Title:
A dual-archive evolutionary algorithm based on multitasking for multimodal multi-objective optimization with local Pareto solutions.
Source:
Cluster Computing; Nov2025, Vol. 28 Issue 12, p1-25, 25p
Database:
Complementary Index

Weitere Informationen

This paper proposes a dual-archive evolutionary algorithm based on multitasking optimization (DAEAMT) for multimodal multi-objective optimization problems with local Pareto optimal solution sets (MMOPLs). First, To balance the relationship between the global and local Pareto optimal solution set in MMOPLs, a convergence archive relating to the main task of DAEAMT guides the population toward global and local Pareto optimal solution set, and a diversity archive relating to the auxiliary task of DAEAMT enhances the global search capability, and a novel multitasking optimization framework is designed to achieve information transfer between different tasks. Moreover, a binary local convergence indicator is developed, which maintains population diversity by retaining the individuals with well diversity among local non-dominated individuals and strong convergence among local dominated individuals. Additionally, for the different purposes of main and auxiliary tasks in DAEAMT, the two environmental selection strategies are designed. Experimental results demonstrate that DAEAMT has significant advantages over other 9 state-of-the-art algorithms on 34 multimodal multi-objective benchmark problems and a real-world application problem. [ABSTRACT FROM AUTHOR]

Copyright of Cluster Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)