首页> 外文期刊>Computational intelligence and neuroscience >Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic
【24h】

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic

机译:通过模糊逻辑增强背包问题的超启发式方法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Hyperheuristics rise as powerful techniques that get good results in less computational time than exact methods like dynamic programming or branch and bound. These exact methods promise the global best solution, but with a high computational time. In this matter, hyperheuristics do not promise the global best solution, but they promise a good solution in a lot less computational time. On the contrary, fuzzy logic provides the tools to model complex problems in a more natural way. With this in mind, this paper proposes a fuzzy hyperheuristic approach, which is a combination of a fuzzy inference system with a selection hyper-heuristic. The fuzzy system needs the optimization of its fuzzy rules due to the lack of expert knowledge; indeed, traditional hyperheuristics also need an optimization of their rules. The fuzzy rules are optimized by genetic algorithms, and for the rules of the traditional methods, we use particle swarm optimization. The genetic algorithm will also reduce the number of fuzzy rules, in order to find the best minimal fuzzy rules, whereas traditional methods already use very few rules. Experimental results show the advantage of using our approach instead of a traditional selection hyperheuristic in 3200 instances of the 0/1 knapsack problem.
机译:超启发式技术兴起,成为强大的技术,与动态规划或分支和绑定等精确方法相比,它们在更少的计算时间内获得良好的结果。这些精确的方法有望提供全局最佳解决方案,但计算时间较长。在这件事上,超启发式并不承诺全局最佳解决方案,但它们承诺在更少的计算时间内提供一个好的解决方案。相反,模糊逻辑提供了以更自然的方式对复杂问题进行建模的工具。考虑到这一点,本文提出了一种模糊超启发式方法,该方法将模糊推理系统与选择超启发式相结合。模糊系统由于缺乏专业知识,需要对其模糊规则进行优化;事实上,传统的超启发式方法也需要优化其规则。模糊规则采用遗传算法进行优化,针对传统方法的规则,采用粒子群优化。遗传算法还将减少模糊规则的数量,以找到最佳的最小模糊规则,而传统方法已经使用很少的规则。实验结果表明,在 3200 个 0/1 背包问题实例中,使用我们的方法代替传统的选择超启发式具有优势。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号