arrow
Return

Multiple landscape measure-based approach for dynamic optimization problems

delete2024-07-01
delete2
delete
OA
AI
K
Kangjing Li *
S
Saber Elsayed
R
Ruhul Sarker
D
Daryl Essam
DOI:10.1016/j.swevo.2024.101578delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Many practical decision -making problems involve dynamic scenarios, where the decision variables, conditions and/or parameters of their optimization models change over time. Such problems are known as dynamic optimization problems (DOPs). Although evolutionary algorithms (EAs) have been effective in solving static optimization problems, they face challenges in handling DOPs. To improve the performance of EAs in dealing with DOPs, this paper proposes a new evolutionary framework that uses different landscape measures to analyze problem landscapes and utilizes the information gained from this to improve the searching process. The proposed method is adopted in three EAs to deal with dynamic functions from IEEE-CEC2009 and two real -world problems. According to the experimental results, LIDOA with multi -measure methods improves the performance of GA, jDE and CMA-ES, on average by 6.71%, 3.03% and 7.78% on benchmark problems, respectively.
Keywords:
Dynamic optimization problems
Evolutionary algorithms
Fitness landscape analysis
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.1K
Citations:
1.0W

Organization

No organization information available