改进的蚁群禁忌搜索混合算法

An Improved Hybrid Algorithm Combining Ant Colony Optimization Algorithm and Tabu Search

蚁群算法作为一种全局搜索的方法,具有正反馈性、并行性、分布性、自组织性等特点,在求解复杂组合优化问题上具有强大的优势。但是,蚁群算法也存在一些不足之处:例如,算法需要较长的搜索时间、容易出现早熟停滞现象。为了更优地解决旅行商问题,改进单纯用蚁群算法求解旅行商问题的结果,通过蚁群算法、免疫算法和禁忌搜索算法自身的特点,分别对三者的优势和不足进行分析,提出一种将三者混合使用的求解旅行商问题的算法。

As a global searching approach, ant colony algorithm ACA has some characteristic, such as positive feedback, distributing, paralleling, self - organizing, etc. But ACA also has many shortcomings, such as slow convergence and being premature. In order to solve traveling salesman problem more satisfactorily, a mixed algorithm is put forward. On the basis of analyzing the characteristics of ACA, immune algorithm and tabu search, a mixed method is founded. Its calculation result indicates that the mixed algorithm ACA , immune algorithm and tabu search is much more effective than the single ACA.