基于逐步学习价值函数的交互式分解多目标优化
Interactive Decomposition Multi-Objective Optimization via Progressively Learned Value Functions
摘要:
分解已成为一种越来越流行的技术,进化多目标优化(EMO)。基于分解的EMO算法通常被设计为近似整个Pareto最优前沿(PF)。然而,在实践中,决策者(DM)可能仅对她/他的感兴趣区域(ROI)感兴趣,即,PF的一部分。在此之外的解决方案可能是无用的,甚至对决策过程是嘈杂的。此外,在处理许多客观问题时,无法保证找到首选解决方案。本文开发了一个交互式框架的分解为基础的EMO算法,导致DM的首选解决方案,她/他的选择。它由三个模块组成,即,咨询、优选和优化。具体来说,每隔几代之后,DM被要求在咨询会话中对一些候选解决方案进行评分。此后,从DM的行为逐步学习对DM的偏好信息建模的近似价值函数。在偏好启发会话中,在咨询模块中学习的偏好信息被转换为可以在基于分解的EMO算法中使用的形式,即,一组偏向ROI的参考点。优化模块,原则上可以是任何基于分解的EMO算法,利用偏置参考点来指导其搜索过程。大量的基准问题上的实验,三到十个目标充分证明了我们所提出的方法的有效性,寻找DM的首选解决方案。
英文摘要:
Decomposition has become an increasingly popular technique for evolutionary multi-objective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, the decision maker (DM) might only be interested in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might be useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee to find the preferred solutions when tackling many-objective problems. This paper develops an interactive framework for the decomposition-based EMO algorithm to lead a DM to the preferred solutions of her/his choice. It consists of three modules, i.e., consultation, preference elicitation and optimization. Specifically, after every several generations, the DM is asked to score a few candidate solutions in a consultation session. Thereafter, an approximated value function, which models the DM's preference information, is progressively learned from the DM's behavior. In the preference elicitation session, the preference information learned in the consultation module is translated into the form that can be used in a decomposition-based EMO algorithm, i.e., a set of reference points that are biased toward to the ROI. The optimization module, which can be any decomposition-based EMO algorithm in principle, utilizes the biased reference points to direct its search process. Extensive experiments on benchmark problems with three to ten objectives fully demonstrate the effectiveness of our proposed method for finding the DM's preferred solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。