Considering the decision-maker's preference information in static multi-objective optimization problems (MOPs) has been extensively studied. However, incorporating dynamic preference information into dynamic MOPs is a relatively less explored area. This paper introduces a preference information-driven DMOEA and proposes a preference-based prediction method. Specifically, a preference-based inverse model is designed to respond to the time-varying preference information, and the model is used to predict an initial population for tracking the changing ROI. Furthermore, a hybrid prediction strategy, that combines a linear prediction model and estimation of population manifolds in the ROI, is proposed to ensure convergence and distribution of population when the preference remain constant. The experimental results show that the proposed algorithm has significant advantages over existing representative DMOEAs through experimental tests on 19 common test problems.
A Dynamic Preference-driven Evolutionary Algorithm for Solving Dynamic Multi-objective Problems
Xueqing Wang,Jinhua Zheng,Juan Zou,Zhanglu Hou,Shengxiang Yang,Yuan Liu
Published 2024 in GECCO Companion
ABSTRACT
PUBLICATION RECORD
- Publication year
2024
- Venue
GECCO Companion
- Publication date
2024-07-14
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-9 of 9 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1