基于禁忌和声搜索算法解决0-1背包问题  

Tabu-based harmony search algorithm for solving the 0-1 knapsack

作　　者：袁春雨[1] 

机构地区：[1]安徽职业技术学院科研处,安徽合肥200011

出　　处：《安徽水利水电职业技术学院学报》2017年第1期49-52,共4页Journal of Anhui Technical College of Water Resources and Hydroelectric Power

摘　　要：和声算法是模拟音乐演奏的一种基于群的超启发算法。由于算法的简易性和快速收敛性,其在连续优化问题中得到广泛应用。文章利用改进的和声算法解决基于离散的0-1背包优化问题。通过运用二进制编码,并引入禁忌思想以及结合自适应的参数调整策略,提出了禁忌和声搜索算法。经过试验仿真,验证了禁忌和声算法与其他算法相比具有一定的性能改进。Harmony search （HS） is a population--based meta--heuristic imitating the music improvisa- tion process. As its simplicity and fast convergence, Harmony search has been successfully applied to continuous optimization problems. This paper presents a modified harmony search algorithm for solving 0-1 knapsack problems. Combined introduced tabu strategy and adapted parameters adjustment , tabu-based harmony search（TBHS） is put forward based on binary coding. Tests results demonstrate that TBHS performs better than the some HS variants in terms of the solution quality.

关 键 词：和声算法 背包问题 禁忌 自适应 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]