首页> 外文期刊>Engineering with Computers >An efficient binary differential evolution algorithm for the multidimensional knapsack problem
【24h】

An efficient binary differential evolution algorithm for the multidimensional knapsack problem

机译:一种高效的二元差分演化算法,用于多维背包问题

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

摘要

This paper proposes a novel approach for the multidimensional knapsack problem (MDKP) using differential evolution. Firstly, the principle and the pseudo-code of binary differential evolution with hybrid encoding (HBDE) are presented. On the basis of the existing repair operator 2 (RO2), an improved repair operator 3 (RO3) for handling the infeasible solutions of MDKP is developed. Then, combine HBDE with RO3, an efficient algorithm (HBDE-RO3) for MDKP is proposed. Finally, the experiment results of the 138 well-known MDKP benchmarks show that RO3 is advantageous to deal with the infeasible solutions than RO2, and the proposed algorithm HBDE-RO3 has superior performance for solving MDKP than the state-of-the-art algorithms.
机译:本文提出了一种使用差分演进的多维背包问题(MDKP)的新方法。首先,提出了用混合编码(HBDE)的二元差分演进的原理和伪码。在现有的修复操作员2(RO2)的基础上,开发了一种改进的修复操作员3(RO3),用于处理MDKP不可行的解决方案。然后,将HBDE与RO3组合,提出了一种有效的MDKP算法(HBDE-RO3)。最后,138众所周知的MDKP基准测试结果表明,RO3是有利的,以处理比RO2不可行的解决方案,所提出的算法HBDE-RO3具有优于求解MDKP的卓越性能,而不是最先进的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号