计算机工程与应用Issue(10)：48-54,100,8.DOI:10.3778/j.issn.1002-8331.1512-0115
求解TSP问题的自适应离散型布谷鸟算法
Adaptive discrete cuckoo algorithm for solving TSP problem
摘要
Abstract
For solving the TSP problem, this paper proposes an adaptive discrete cuckoo algorithm. Constructing path solution strategy of TSP problem based on the principle of cuckoo search algorithm. For the two defects of the discrete algorithm, one is overall adjustment can easily destroy the optimum path which is already formed, the other is the decline of diversity of population with the increase of the iteration number of the algorithm, this paper designs an adaptive partial adjustment operator and a global random perturbation strategy for path. In order to speed up the convergence rate of the algorithm, a simple 2-opt optimization operator is used as a local optimization operator. In the end, multiple sets of different sizes of standard TSPLIB data are compared with other optimization algorithms, the experimental result shows that the ADCS algorithm has advantages in solving precision and stability.关键词
TSP问题/布谷鸟搜索算法/2-opt优化/局部调整/全局随机扰动Key words
TSP problem/cuckoo search algorithm/2-opt optimization/partial adjustment/global random disturbance分类
信息技术与安全科学引用本文复制引用
张子成,韩伟..求解TSP问题的自适应离散型布谷鸟算法[J].计算机工程与应用,2017,(10):48-54,100,8.基金项目
国家电子商务信息处理国际联合研究中心项目(No.2013B01035) （No.2013B01035）
