提出一种求解0-1背包问题的改进离散和声搜索算法(IDHS).该算法应用分布估计算法的概率思想,设计自适应调整策略,提高算法的搜索能力.引入精英培养机制,加强精英和声的开发,提高算法逃离局部最优的概率.通过随机修复方法和置换策略来改善和声的可行性,增加解的多样性.对背包问题进行测试,结果验证了IDHS算法的有效性.%An improved discrete harmony search algorithm is proposed to solve 0-1 knapsack problem(KP). An adaptive adjusting strategy is designed based on the probabilistic model of estiamtion of distribution algo -rithm,which aims to improve the algorithm capability.An elite training mechanism is introduced to enhance the exploitation of the elite harmony for escaping the local optimum.Random repair method and replacement strate-gy are used to improve the feasiblity of harmony and increase the diversity of solution.Several knapsack prob-lems are tested to demonstrate the effectiveness of the proposed algorithm.
展开▼
