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...

Full description

Saved in:
Bibliographic Details
Published in:Swarm and evolutionary computation Vol. 95; p. 101954
Main Authors: Li, Yongchao, Jia, Heming, Li, Hongguang
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.2025
Subjects:
ISSN:2210-6502
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first