Return
Evolutionary Constrained Multiobjective Optimization: Test Suite Construction and Performance Comparisons
DOI:10.1109/TEVC.2019.2896967.png)
Abstract
En 中文
For solving constrained multiobjective optimization problems (CMOPs), many algorithms have been proposed in the evolutionary computation research community for the past two decades. Generally, the effectiveness of an algorithm for CMOPs is evaluated by artificial test problems. However, after a brief review of current artificial test problems, we have found that they are not well-designed and fail to reflect the characteristics of real-world applications (e.g., small feasibility ratio). Thus, in this paper, we first propose a new constraint construction method to facilitate the systematic design of test problems. Then, on the basis of this method, we design a new test suite consisting of 14 instances, which covers diverse characteristics extracted from real-world CMOPs and can be divided into four types. Considering that the comprehensive performance comparisons among the constraint-handling techniques (CHTs) remain scarce, we choose several representative CHTs and compare their performance on our test suite. The performance comparisons identify the strengths and weaknesses of different CHTs on different types of CMOPs and provide guidelines on how to select/design a CHT in a specific scenario.
Keywords:
Pareto optimization
Geometry
Convergence
Evolutionary computation
Systematics
Indexes
Constrained multiobjective optimization
constraint-handling techniques (CHTs)
evolutionary algorithms (EAs)
performance comparisons
test suite
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
Cited Papers
FORECASTING CRYPTOCURRENCY PRICE MOVEMENT USING MOVING AVERAGE METHOD : A CASE STUDY OF BITCOIN CASH

