Handling Constrained Multiobjective Optimization Problems via Bidirectional Coevolution

doi:10.1109/TCYB.2021.3056176

2022-10-01

109

PRE

DOI：10.1109/TCYB.2021.3056176

原文链接

原文求助

摘要

En 中文

Constrained multiobjective optimization problems (CMOPs) involve both conflicting objective functions and various constraints. Due to the presence of constraints, CMOPs' Pareto-optimal solutions are very likely lying on constraint boundaries. The experience from the constrained single-objective optimization has shown that to quickly obtain such an optimal solution, the search should surround the boundary of the feasible region from both the feasible and infeasible sides. In this article, we extend this idea to cope with CMOPs and, accordingly, we propose a novel constrained multiobjective evolutionary algorithm with bidirectional coevolution, called BiCo. BiCo maintains two populations, that is: 1) the main population and 2) the archive population. To update the main population, the constraint-domination principle is equipped with an NSGA-II variant to move the population into the feasible region and then to guide the population toward the Pareto front (PF) from the feasible side of the search space. While for updating the archive population, a nondominated sorting procedure and an angle-based selection scheme are conducted in sequence to drive the population toward the PF within the infeasible region while maintaining good diversity. As a result, BiCo can get close to the PF from two complementary directions. In addition, to coordinate the interaction between the main and archive populations, in BiCo, a restricted mating selection mechanism is developed to choose appropriate mating parents. Comprehensive experiments have been conducted on three sets of CMOP benchmark functions and six real-world CMOPs. The experimental results suggest that BiCo can obtain quite competitive performance in comparison to eight state-of-the-art-constrained multiobjective evolutionary optimizers.

Keyword:

Statistics

Sociology

Optimization

Linear programming

Sorting

Search problems

Transforms

Angle-based selection

bidirectional coevolution

constrained multiobjective optimization problems (CMOPs)

constraint-handling technique (CHT)

evolutionary algorithms

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics

IF:

10.5

论文数:

1.1W

被引数:

5.0W

机构

Central South University

学者数:

10.0W

论文数: 7.2W

被引数: 10.9W

引用论文

Self-Assembling Polymer–Nanodiamond Composite Coatings for Vacuum Cathodes

Journal of Surface Investigation: X-ray, Synchrotron and Neutron Techniques

IF0

2018-04-02

PREAI

P. V. Lebedev-Stepanov; A. T. Dideykin; S. N. Chvalun; A. L. Vasiliev; T. E. Grigoryev; A. N. Korovin; S. I. Belousov; S. P. Molchanov; G. A. Yurasik; A. Ya. Vul’

Ly‐1 B (B‐1) cells are the main source of B cell‐derived interleukin 10

European Journal of Immunology

IF0

2005-11-17

PREAI

Anne O'garra; Ray Chang; Ning Go; Robin Hastings; Geoffrey Haughton; Maureen Howard

A Cooperative Evolutionary Framework Based on an Improved Version of Directed Weight Vectors for Constrained Multiobjective Optimization With Deceptive Constraints

IEEE TRANSACTIONS ON CYBERNETICS

IF10.5

2021-11-01

PREAI

Peng, Chaoda; Liu, Hai-Lin; Goodman, Erik D.