.png){kind=icon}
.png){kind=icon}
Return
An Open Framework for Constructing Continuous Optimization Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2018.2825343.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many artificial benchmark problems have been proposed for different kinds of continuous optimization, e.g., global optimization, multimodal optimization, multiobjective optimization, dynamic optimization, and constrained optimization. However, there is no unified framework for constructing these types of problems and possible properties of many problems are not fully tunable. This will cause difficulties for researchers to analyze strengths and weaknesses of an algorithm. To address these issues, this paper proposes a simple and intuitive framework, which is able to construct different kinds of problems for continuous optimization. The framework utilizes the k-d tree to partition the search space and sets a certain number of simple functions in each subspace. The framework is implemented into global/multimodal optimization, dynamic single objective optimization, multiobjective optimization, and dynamic multiobjective optimization, respectively. Properties of the proposed framework are discussed and verified with traditional evolutionary algorithms.
Keywords:
Continuous optimization
dynamic optimization
free peaks (FPs)
global optimization
multimodal optimization
multiobjective optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W