？(Liang Y J, Xiao M Q, Liang P, et al. Test resource selection and configuration of automatics test system based on grey situation decision-making model[J]. J of Air Force Engineering University: Natural Science Edition, 2015, 16(5): 77-80.)
[5]
Merz P, Freisleben B. Genetic local search for the TSP: New results[C]. Proc of the 1997 IEEE Int Conf on Evolutionary Computation. Indianapolis: IEEE Press, 1997: 159-164.
[6]
Wang K P, Huang L, Zhou C G, et al. Particle swarm optimization for traveling salesman problem[C]. Proc of the Int Conf on Machine Learning and Cybernetics. Xi'an: IEEE Press, 2003: 1583-1585.
[7]
Dorigo M, Luca M G. Ant colonies for the traveling salesman problem[J]. BioSystems, 1997, 43(2): 73-81.
(Hu Z H, Zhao M. Simulation on traveling salesman problem(TSP) based on artificial bees colony algorithm[J]. Trans of Beijing Institute of Technology, 2009, 29(11): 978-982.)
(Zhou Y Q, Huang Z X. Artificial glowworm swarm optimization algorithm for TSP[J]. Control and Decision, 2012, 27(12): 1816-1821.)
[12]
Mo H W, Xu L F. Biogeography migration algorithm for traveling salesman problem[J]. Int J of Intelligent Computing and Cybernetics, 2011, 4(3): 311-330.
[13]
Yousefikhoshbakht M, Sedighpour M. New imperialist competitive algorithm to solve the travelling salesman problem[J]. Int J of Computer Mathematics, 2013, 90(7): 1495-1550.
(Feng X, Ma M Y, Yu H Q. Lake-energy optimization algorithm for traveling salesman problem[J]. J of Computer Research and Development, 2013, 50(9): 2015-2027.)
[16]
Dowlatshahi M B, Nezamabadi H, Mashinchia M. A discrete gravitational search algorithm for solving combinatorial optimization problems[J]. Information Sciences, 2014, 258(10): 94-107.
(Wu H S, Zhang F M, Zhan R J, et al. A binary wolf pack algorithm for solving 0-1 knapsack problem[J]. Systems Engineering and Electronics, 2014, 36(8): 1660-1667.)
[21]
Vlachos M, Kollios G, Gunopulos G. Discovering Similar Multidimensional Trajectories[C]. Proc of the 18th Int Conf on Data Engineering. San Jose: IEEE Press, 2002: 673-684.
(Gu D Q, Liu G F, Yuan Y, et al. New algorithm for solving TSP based on dots and lines loop optimizing[J]. J of PLA University of Science and Technology: Natural Science Edition, 2010, 11(4): 423-427.)
(Liu Y, Ma L. Fuzzy artificial bees colony algorithm for solving traveling salesman problem [J]. Application Research of Computers, 2013, 30(9): 2694-2696.)
(Hu Z H, Zhao M. Simulation on traveling salesman problem(TSP) based on artificial bees colony algorithm[J]. Trans on Beijing Institute of Technology, 2009, 29(11): 978-982.)
(Luo Z L, Yi M Z, Liu X Y. On ant colony hybrid differential evolution for optimization problem[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni: Natural Science Edition, 2008, 47(3): 33-36.)
[32]
David B. Simulated annealing for traveling salesman problem[R]. Springfield: Spring, 1997.
[33]
Bayram H. A new simulated annealing approach for Traveling salesman problem[J]. Mathematical and Computational Applications, 2013, 18(3): 313-322.
(Ding H L, Wang F, Gao C X. Crossover particle swarm optimization for traveling salesman problem[J]. J of Mathematics, 2008, 28(1): 85-89.)
[36]
Hong K, Shi J H, Tzong W K, et al. A hybrid swarm intelligence algorithm for the traveling salesman problem[J]. Expert Systems, 2010, 27(3): 166-179.
[37]
Dong G F, Guo W W, Tichkle K. Solving the traveling salesman problem using cooperative genetic ant systems[J]. Expert Systems with Applications, 2012, 35(9): 5006-5011.
[38]
Chen S M, Chien C Y. Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques[J]. Expert Systems with Applications, 2011, 38(12): 14439-14450.
