4.7 Article

A novel two-phase evolutionary algorithm for solving constrained multi-objective optimization problems

Journal

SWARM AND EVOLUTIONARY COMPUTATION
Volume 75, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.swevo.2022.101166

Keywords

Coevolution; Constraints; Evolutionary algorithms; Optimization algorithms

Funding

  1. National Natural Science Foundation of China [61876164, 62176228]
  2. Natural Science Foundation of Hunan Province, China [2020JJ4590]
  3. Education Department Major Project of Hunan Province, China [17A212]
  4. MOEA Key Laboratory of Intelligent Computing and Information Processing
  5. Science and Technology Plan Project of Hunan Province, China [2016TP1020]
  6. Provinces and Cities Joint Foundation Project, China [2017JJ4001]
  7. Hunan province science and technology project, China funds [2018TP1036]

Ask authors/readers for more resources

Balancing convergence and diversity in constrained multi-objective optimization problems is challenging. Existing evolutionary algorithms are insufficient, hence a novel algorithm named DTAEA is proposed. DTAEA divides the population's evolutionary process into two phases to improve exploration capability and guide population distribution in feasible regions.
It is challenging to balance convergence and diversity in constrained multi-objective optimization problems (CMOPs) since the complex constraints will disperse the feasible regions into many diverse, small parts of the entire search region. Although there has been some research on CMOPs, existing evolutionary algorithms still cannot cause the evolutionary population to converge a diversified feasible Pareto-optimal front. In order to solve this problem, we propose a novel two-phase evolutionary algorithm for solving CMOPs, named DTAEA. DTAEA divides the population's coevolutionary process into two phases. In the first phase, the dual population weak coevolution is combined with the complementary environmental selection strategy to improve the algorithm's exploration under constraints, which makes the evolutionary population quickly traverse the infeasible regions and search for all of the feasible regions. When the proportion of feasible solutions in the population reaches a certain threshold or the convergence of feasible solutions reaches a certain level, the population's evolutionary process enters the second phase, that is, the progressive phase. In the second phase, a feasibility-oriented method guides a single population to distribute itself widely in the feasible regions explored in the first phase. Comparative experiments show that the DTAEA is more competitive than other algorithms on CMOP benchmarks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available