A Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems

A Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems
复制标题

多维背包问题的双禁忌表禁忌搜索方法

DOI：
--
复制
发表时间：
2006
期刊：
--
影响因子：
--
通讯作者：
Guangyuan Liu
Guangyuan Liu
中科院分区：
--
文献类型：
--
作者：
Yi He;Yuhui Qiu;Guangyuan Liu

文献摘要

被引文献

相似文献

背包问题是组合优化中一个经典的NP难问题。受认知心理学关于人类记忆系统的结论启发，提出了一种基于双禁忌列表的禁忌搜索方法(DTL-TS)。通过加入集约化、多样化的搜索策略，取得了较好的实验结果。与免疫支配克隆算法相比，DTL-TS算法是解决0-1多维背包问题等复杂问题的一种有效方法。
Summary The knapsack problems are a classic NP-hard problem in the combinational optimization. Inspired by the conclusion of the cognitive psychology about the human memory system, a Tabu Search method based on Double Tabu-List (DTL-TS) has been proposed to solve it. With the addition of the search strategy of intensification and diversification, the excellent experiment results have been gotten. Compared with ImmunoDominance Clone Algorithm, DTL-TS is shown to be an efficient approach of solving complex problems like 0-1 multidimensional knapsack problems.