华东交通大学学报2016，Vol.33Issue(6)：131-136,6.
基于混合和声搜索算法求解旅行商问题
Hybrid Harmony Search Algorithm for Traveling Salesman Problem
摘要
Abstract
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.关键词
旅行商问题/和声搜索算法/蚁群算法Key words
traveling salesman problem/harmony search algorithm/ant colony optimization分类
信息技术与安全科学引用本文复制引用
曾毅,朱旭生..基于混合和声搜索算法求解旅行商问题[J].华东交通大学学报,2016,33(6):131-136,6.基金项目
国家自然科学基金项目(11161021) （11161021）
华东交通大学科研项目(09111114) （09111114）
