基于混合和声搜索算法求解旅行商问题

摘要

Aiming at traveling salesman problem, this paper puts forward a new hybrid harmony search algorithm. By using the mechanism of harmony search algorithm and ant colony algorithm, improvisation operator of hybrid algorithm is redefined so as to solve the problem that the newly-generated harmony doesn 't well maintain the excellent gene segment in harmony memory. In order to maintain the diversity of hybrid algorithm, a new memory updating strategy is given. Finally, the algorithm is applied and tested in traveling salesman problem. The results of simulation indicate the effectiveness of the proposed algorithm.%针对旅行商问题,提出了一种新的混合和声搜索算法.混合算法利用和声算法和蚁群算法机理,重新定义和声算法的即兴创作操作,解决新生成的和声不能很好地保持和声记忆库中和声的优良基因片段的问题.为维持混合算法的多样性,给出新的记忆库更新策略.对旅行商问题进行测试,仿真结果表明混合算法的有效性.