Competitive Multitasking for Computational Resource Allocation in Evolutionary-Constrained Multiobjective Optimization

Constrained multiobjective optimization problems (CMOPs) have multiple objective functions that need to be optimized and constraints need to be satisfied, making them difficult to solve. Based on the multitasking optimization, the optimization of the original CMOP can be transformed into multiple re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on evolutionary computation Jg. 29; H. 3; S. 809 - 821
Hauptverfasser: Chu, Xiaoliang, Ming, Fei, Gong, Wenyin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2025
Schlagworte:
Competitive multitasking
computational resource allocation
constrained multiobjective optimization
evolutionary algorithms
evolutionary transfer optimization
Linear programming
Multitasking
Optimization
Resource management
Sociology
Statistics
Task analysis
ISSN:1089-778X, 1941-0026
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Constrained multiobjective optimization problems (CMOPs) have multiple objective functions that need to be optimized and constraints need to be satisfied, making them difficult to solve. Based on the multitasking optimization, the optimization of the original CMOP can be transformed into multiple related subtasks. Existing multitasking-based constrained multiobjective optimization evolutionary algorithms assist the evolution of the original problem by adopting auxiliary tasks. However, this approach may waste computational resources on tasks that are unsuitable for evolutionary states and dynamics. In this article, a new competitive multitasking-based framework is proposed for CMOPs. We maintain an archive for the constrained Pareto front (CPF) and multiple subtasks as auxiliaries. In each iteration, one of the subtasks is selected as the main task, and offspring are generated from its evolution. The offspring are viewed as knowledge and fed back to auxiliary tasks. The reward is mapped to a selection probability to control the main task selection in each iteration. Computational resources are saved by allocating only to the main task that is better suited for different evolutionary stages of different problems. The effectiveness of our approach is validated through experiments on four CMOP benchmark suites compared to 11 state-of-the-art methods.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2024.3376729