首页> 外文期刊>Cluster computing >A knee-based multi-objective evolutionary algorithm: an extension to network system optimization design problem
【24h】

A knee-based multi-objective evolutionary algorithm: an extension to network system optimization design problem

机译:基于膝盖的多目标进化算法:网络系统优化设计问题的扩展

获取原文
获取原文并翻译 | 示例
       

摘要

High performance computing (HPC) research is confronted with multiple competing goals such as reducing makespan and reducing cost in clouds. These competing goals must be optimized simultaneously. Multi-objective optimization techniques to tackle such HPC problems have received significant research attention. Most multi-objective optimization approaches provide a large number of potential solutions. Choosing the best or most preferred solution becomes a problem. In some practical contexts, even if the decision maker does not have an explicit preference, there exist the regions of the solution space that can be viewed as implicitly preferred because of the way the problem has been formulated. Solutions located in these regions are called "knee solutions". Evolutionary approaches have become popular and effective in solving complex and large problems that require HPC. The aim of this paper is to develop a knee-based multi-objective evolutionary algorithm (MOEA) which can prune the set of optimal solutions with a controllable parameter to focus on knee regions. The proposed approach uses a concept called extended dominance to guide the solution process towards knee regions. A user-supplied density controller parameter determines the number of preferred solutions retained. We verify our approach using two and three-objective knee-based test problems. The results show that our approach is competitive with other well-known knee-based MOEAs when evaluated by a convergence metric. We then apply the approach to a network optimization design problem in order to demonstrate how it can be useful in a practical context related to HPC.
机译:高性能计算(HPC)研究面临着多个相互竞争的目标,例如减少制造时间和降低云成本。必须同时优化这些相互竞争的目标。解决此类HPC问题的多目标优化技术受到了广泛的研究关注。大多数多目标优化方法提供了大量潜在的解决方案。选择最佳或最优选的解决方案成为一个问题。在某些实际情况下,即使决策者没有明确的偏好,由于解决问题的方式,解决方案空间中的某些区域也可以视为隐式首选。位于这些区域的解决方案称为“膝盖解决方案”。在解决需要HPC的复杂和大问题时,进化方法已变得流行和有效。本文的目的是开发一种基于膝盖的多目标进化算法(MOEA),该算法可以修剪具有可控制参数的最佳解决方案集,以关注膝盖区域。所提出的方法使用一种称为扩展优势的概念来指导求解过程向膝盖区域延伸。用户提供的密度控制器参数确定保留的首选解决方案的数量。我们使用基于两个和三个目标的基于膝盖的测试问题来验证我们的方法。结果表明,当通过收敛度量进行评估时,我们的方法与其他知名的基于膝关节的MOEA竞争。然后,我们将这种方法应用于网络优化设计问题,以证明其在与HPC相关的实际环境中如何有用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号