求解背包问题的布谷鸟搜索算法
Cuckoo Search AIgorithm for SoIving Knapsack ProbIem
许秋艳1
作者信息
- 1. 盐城工学院信息工程学院，盐城 224051
- 折叠
摘要
背包问题是计算机科学一种典型的组合优化难题。为处理背包问题，设计基于布谷鸟搜索算法的优化方法。布谷鸟搜索算法是一种新型现代启发式算法，在求解连续优化问题时表现出良好的优化性能。在求解背包问题时，算法的搜索空间限制在连续空间，并通过自定义的映射，将背包问题的解空间和算法的搜索空间相对应。数值试验验证该算法的可行性和有效性。
Abstract
Knapsack problem (KP) is a typical NP-hard problem in combinatorial optimization in computer science. To deal with KP, proposes a method based on cuckoo search algorithm (CSA). CSA is a novel metaheuristic and shows good performance in solving continuous opti-mization problems. For solving KP, the search space of CSA is restricted in continuous space. The solution space of KP is corresponded to the search space of CSA by the self-defined map. The experimental results show that the proposed algorithm is feasible and effective.
关键词
背包问题/布谷鸟搜索算法/组合优化Key words
Knapsack Problem/Cuckoo Search Algorithm/Combinatorial Optimization引用本文复制引用
出版年
2015
NETL
NSTL
维普
万方数据