A coevolutionary algorithm for constrained multi-objective optimization with dynamic relaxation

To effectively address constrained multi-objective problems, algorithms need to strike a balance between objectives and constraints. This article introduces a method that utilizes two separate populations to investigate the exploration of the constrained Pareto front (CPF) and the unconstrained Pare...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Swarm and evolutionary computation Jg. 95; S. 101954
Hauptverfasser:	Li, Yongchao, Jia, Heming, Li, Hongguang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.06.2025
Schlagworte:	Coevolutionary algorithm Constrained multi-objective optimization DR tournament selection model Entropy selection evolution strategy Constrained multi-objective optimization Coevolutionary algorithm Entropy selection evolution strategy DR tournament selection model
ISSN:	2210-6502
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!