摘要
为利用和声搜索算法求解0-1背包问题,针对和声搜索的离散化技术和二进制编码的特点,借鉴遗传算子改进新和声的生成方式及微调方式,并基于贪心策略设计和声修正过程,提出了一种离散化的和声搜索算法。数值实验表明,与其它常用的智能算法相比,该算法在求解质量上具有较大优势,对大规模的背包问题效果也很明显。
For solving 0 - 1 knapsack problem using Harmony search （HS） algorithm, in view of discretization technology of HS and the characteristics of binary code, propose the Discrete Harmony Search Algorithm （DHS） which improved improvisation and adjustment of new harmony and combined harmony fixed process based on greedy strategy. Numerical experiments show that DHS has much better performance in solution quality compared with several existing algorithms, as well as for solving the massive knapsack problem.
出处
《贵州师范学院学报》
2013年第3期17-20,共4页
Journal of Guizhou Education University
关键词
背包问题
和声搜索
贪婪算法
knapsack problem
harmony search
greedy algorithm
