.png){kind=icon}
Return
An orthogonal predictive model-based dynamic multi-objective optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-014-1470-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new dynamic multi-objective optimization evolutionary algorithm is proposed for tracking the Pareto-optimal set of time-changing multi-objective optimization problems effectively. In the proposed algorithm, to select individuals which are best suited for a new time from the historical optimal sets, an orthogonal predictive model is presented to predict the new individuals after the environment change is detected. Also, to converge to optimal front more quickly, an modified multi-objective optimization evolutionary algorithm based on decomposition is adopted. The proposed method has been extensively compared with other three dynamic multi-objective evolutionary algorithms over several benchmark dynamic multi-objective optimization problems. The experimental results indicate that the proposed algorithm achieves competitive results.
Keywords:
Dynamic environment
Multi-objective optimization
Decomposition
Forecasting model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSaveArtificial immune system in dynamic environments solving time-varying non-linear constrained multi-objective problems.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveShareSave
View more