An adaptive discrete cuckoo algorithm based on simulated annealing is proposed to solve the traveling salesman problem.The proposed algorithm constructs the path solving strategy of traveling salesman problem based on the principle of cuckoo search algorithm.Due to the limitation of algorithm

with the increasing of the number of iterations

it is inclined to destroy the formed paths

which makes algorithm can not be commonly used in variant applications.To overcome this shortcoming

this paper adopt an new strategy which adjust operator locally and disturb parameters randomly.A simple 2-opt operator is used as the local optimization operator to accelerate the convergence rate of the algorithm.The simulated annealing mechanism is introduced to prevent the local optimum in early iterations.The algorithm is tested by the standard TSPLIB multi-group data

comparing with several representative traveling salesman problem algorithm

the experimental results show the advantages of the algorithm in terms of accuracy and stability.