【摘要】 和声算法是模拟音乐演奏的一种基于群的超启发算法。由于算法的简易性和快速收敛性,其在连续优化问题中得到广泛应用。文章利用改进的和声算法解决基于离散的0-1背包优化问题。通过运用二进制编码,并引入禁忌思想以及结合自适应的参数调整策略,提出了禁忌和声搜索算法。经过试验仿真,验证了禁忌和声算法与其他算法相比具有一定的性能改进。更多还原

【Abstract】 Harmony search(HS)is a population-based meta-heuristic imitating the music improvisation 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-1knapsack 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.更多还原