首页> 外文会议>International Conference on Parallel Problem Solving from Nature >Use of Two Reference Points in Hypervolume- Based Evolutionary Multiobjective Optimization Algorithms
【24h】

Use of Two Reference Points in Hypervolume- Based Evolutionary Multiobjective Optimization Algorithms

机译:基于超型的进化多目标优化算法中的两个参考点的使用

获取原文

摘要

Recently it was reported that the location of a reference point has a dominant effect on the optimal distribution of solutions for hypervolume maximization when multiobjective problems have inverted triangular Pareto fronts. This implies that the use of an appropriate reference point is indispensable when hypervolume-based EMO (evolutionary multiobjective optimization) algorithms are applied to such a problem. However, its appropriate reference point specification is difficult since it depends on various factors such as the shape of the Pareto front (e.g., triangular, inverted triangular), its curvature property (e.g., linear, convex, concave), the population size, and the number of objectives. To avoid this difficulty, we propose an idea of using two reference points: one is the nadir point, and the other is a point far away from the Pareto front. In this paper, first we demonstrate that the effect of the reference point is strongly problem-dependent. Next we propose an idea of using two reference points and its simple implementation. Then we examine the effectiveness of the proposed idea by comparing two hypervolume-based EMO algorithms: one with a single reference point and the other with two reference points.
机译:最近,据报道,当多目标问题具有倒三角形静脉前线时,参考点的位置对超高型最大化的解决方案的最佳分布。这意味着当基于超凡蜂的EMO(进化多目标优化)算法应用于这样的问题时,使用适当的参考点是必不可少的。然而,其适当的参考点规范是困难的,因为它取决于各种因素,例如帕累托前部的形状(例如,三角形,倒三角形),其曲率性质(例如,线性,凸,凹),群体大小和目标的数量。为了避免这种困难,我们建议使用两个参考点的想法:一个是Nadir点,另一个是远离帕累托前面的一点。在本文中,首先,我们证明参考点的效果是强烈的问题。接下来,我们建议使用两个参考点及其简单实现。然后,我们通过比较两个超级化的EMO算法来检查所提出的想法的有效性:一个具有单个参考点的单个参考点,另一个参考点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号