“…The TSP can be described as following: Since meta-heuristic methods are able to find solutions rapidly by the strong ability of exploring and exploiting the full search space, those algorithms have attracted a lot of attention in solving global optimization problems Li, Chen, et al, 2018). Considering the advantage of it, many heuristics algorithms are applied to deal with TSP in recent years, such as simulated annealing (SA) (Li, Zhou, Zhang, 2011), tabu search (TB) (Lin, Bian, Liu, 2016), neural networks (NN) (Li, Qiao, Li, 2016), and genetic algorithm (GA) Li, Liang, et al, 2019).…”