On decomposition methods in interactive user-preference based optimization
2017
Graphical abstractDisplay Omitted HighlightsA model how to combine preference information and the framework of MOEA/D.A new way of generating weight vectors with preference information.Use the ASF function into MOEA/D to reflect preference information.The proposed approaches could deal with many-objective problems well.The desired solutions can be found in different ROIs interactively. Evolutionary multi-objective optimization (EMO) methodologies have been widely applied to find a well-distributed trade-off solutions approximating to the Pareto-optimal front in the past decades. However, integrating the user-preference into the optimization to find the region of interest (ROI) [1] or preferred Pareto-optimal solutions could be more efficient and effective for the decision maker (DM) straightforwardly. In this paper, we propose several methods by combining preference-based strategy (like the reference points) with the decomposition-based multi-objective evolutionary algorithm (MOEA/D) [2], and demonstrate how preferred sets or ROIs near the different reference points specified by the DM can be found simultaneously and interactively. The study is based on the experiments conducted on a set of test problems with objectives ranging from two to fifteen objectives. Experiments have proved that the proposed approaches are more efficient and effective especially on many-objective problems to provide a set of solutions to the DM's preference, so that a better and a more reliable decision can be made.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
43
References
23
Citations
NaN
KQI