.png){kind=icon}
.png){kind=icon}
Return
Hierarchical preference algorithm based on decomposition multiobjective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2020.100771.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rather than a whole Pareto optimal front(POF), which demands too many points, the decision maker (DM) may only be interested in a partial region, called the region of interest(ROI). In this paper, we propose a systematic method to incorporate the DM's preference information into a decomposition-based evolutionary multiobjective optimization algorithm (MOEA/D-HP). Different from most existing decomposition-based preference algorithms, MOEA/D-HP guides the population to converge to the preference region by generating hierarchical reference points in the preference region, and forms some hierarchical solutions for comparison and selection by the DM. In addition, the novel reference vectors generating method of MOEA/D-HP makes the final solutions no longer uniformly distributed in the ROI, instead the closer to the preference point, the denser the obtained solution. Extensive experiments on a variety of benchmark problems with 2 to 15 objectives fully demonstrate the effectiveness of our method in obtaining preferred solutions in the ROI.
Keywords:
Decomposition-based method
Hierarchical circular reference points
User-preference incorporation
Evolutionary multiobjective
optimization(EMO)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W