首页> 外文会议>Advances in Swarm and Computational Intelligence >A Hybrid Algorithm Based on Tabu Search and Chemical Reaction Optimization for 0-1 Knapsack Problem
【24h】

A Hybrid Algorithm Based on Tabu Search and Chemical Reaction Optimization for 0-1 Knapsack Problem

机译:基于禁忌搜索和化学反应优化的0-1背包问题混合算法

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

摘要

The 0-1 knapsack problem(01KP) is a well-known NP-complete problem in combinatorial optimization problems. There exist different approaches employed to solve the problem such as brute force, dynamic programming, branch and bound, etc. In this paper, a hybrid algorithm CROTS (Chemical Reaction Optimization combined with Tabu Search) is proposed to address the issue. One of the four elementary reaction of CRO is performed first, and after that tabu search is employed to search for the neighbors of the optimum solution in the population. The experimental results show that CROTS owns better performance in comparison with GA and the original CRO.
机译:0-1背包问题(01KP)是组合优化问题中众所周知的NP完全问题。存在解决暴力问题,动态规划,分支定界等问题的不同方法。在本文中,提出了一种混合算法CROTS(化学反应优化与禁忌搜索相结合)来解决该问题。首先执行CRO的四个基本反应之一,然后使用禁忌搜索来搜索总体中最优解的邻居。实验结果表明,与GA和原始CRO相比,CROTS具有更好的性能。

著录项

  • 来源
  • 会议地点 Beijing(CN)
  • 作者单位

    School of Computer and Information Engineering, Henan University, Kaifeng, China;

    School of Computer and Information Engineering, Henan University, Kaifeng, China;

    School of Computer and Information Engineering, Henan University, Kaifeng, China,School of Information Science and Engineering, Central South University, Changsha, China;

    School of Information Science and Engineering, Central South University, Changsha, China;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    0-1 knapsack problem; Chemical reaction optimization; Tabu search;

    机译:0-1背包问题;化学反应优化;禁忌搜索;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号