%0 Journal Article
%A ZHANG Zicheng
%A HAN Wei
%T Adaptive discrete cuckoo algorithm for solving TSP problem
%D 2017
%R 10.3778/j.issn.1002-8331.1512-0115
%J Computer Engineering and Applications
%P 48-54
%V 53
%N 10
%X 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.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1512-0115