[1] HELD M,KARP R M.The traveling-salesman problem and minimum spanning trees[J].Operations Research,1970,18(6):1138-1162. [2] QIU M,FU Z,EGLESE R,et al.A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups[J].Computers & Operations Research,2018,100:102-116. [3] MAKSIMENKO A.Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm[EB/OL].[2019-08-02].https://arxiv.org/abs/1811.03031. [4] APPLEGATE D L,BIXBY R E,CHVATAL V,et al.The traveling salesman problem[EB/OL].[2019-08-02].http://www.math.uwaterloo.ca/tsp/. [5] APPLEGATE D L,BIXBY R E,CHVÁTAL V,et al.Certification of an optimal TSP tour through 85,900 cities[J].Operations Research Letters,2009,37(1):11-15. [6] CHRISTOFIDES N.Worst case analysis of a new heuristic for the traveling salesman problem[D].Pittsburg,USA:Carnegie Mellon University,1976. [7] ZHANG Liyi,GAO Yang,FEI Teng,et al.Seeker genetic algorithm solving traveling salesman problem[J].Mathematics in Practice and Theory,2019,49(7):115-122.(in Chinese)张立毅,高杨,费腾,等.求解旅行商问题的搜寻者遗传算法[J].数学的实践与认识,2019,49(7):115-122. [8] WANG Feipeng,TAN Xujie.Approximate backbone subsection of ACO algorithm for traveling salesman problem[J].Computer Engineering and Design,2019,40(4):1016-1021.(in Chinese)王飞鹏,谭旭杰.求解旅行商问题的近似骨架分段蚁群优化算法[J].计算机工程与设计,2019,40(4):1016-1021. [9] QIAN Zhenkun.A new method of weighted traveling salesman problem based on discrete particle swarm optimization[J].Computer Applications and Software,2019,36(1):133-137.(in Chinese)钱真坤.基于离散粒子群优化算法的含权旅行商问题新解法[J].计算机应用与软件,2019,36(1):133-137. [10] ZHANG Zicheng,HAN Wei,MAO Bo.Adaptive discrete cuckoo algorithm based on simulated annealing for solving TSP[J].Acta Electronica Sinica,2018,46(8):1849-1857.(in Chinese)张子成,韩伟,毛波.基于模拟退火的自适应离散型布谷鸟算法求解旅行商问题[J].电子学报,2018,46(8):1849-1857. [11] JOSHI C K,LAURENT T,BRESSON X.An efficient graph convolutional network technique for the travelling salesman problem[EB/OL].[2019-08-02].https://arxiv.org/abs/1906.01227. [12] ZONG Decai,WANG Kangkang.A genetic algorithm mixing local search algorithm for solving travelling salesman problem[J].Application Research of Computers,2015,32(3):266-270.(in Chinese)宗德才,王康康.一种混合局部搜索算法的遗传算法求解旅行商问题[J].计算机应用与软件,2015,32(3):266-270. [13] MA Han,CHANG Anding,CHEN Tong,et al.A hybrid culture algorithm optimization strategy for traveling salesman problem[J].Computer Engineering and Science,2019,41(7):1273-1278.(in Chinese)马晗,常安定,陈童,等.基于文化混合优化算法的旅行商问题求解[J].计算机工程与科学,2019,41(7):1273-1278. [14] DONG G F,GUO W W,TICKLE K.Solving the traveling salesman problem using cooperative genetic ant systems[J].Expert Systems with Applications,2012,39(5):5006-5011. [15] REINELT G.TSPLIB-a traveling salesman problem library[J].ORSA Journal on Computing,1991,3(4):376-384. [16] LIN S,KERNIGHAN B W.Effective heuristic algorithm for the traveling-salesman problem[J].Operations Research,1973,21(2):498-516. [17] HELSGAUN K.An effective implementation of the Lin-Kernighan traveling salesman heuristic[J].European Journal of Operational Research,2000,126(1):106-130. [18] HELSGAUN K.General k-opt submoves for the Lin-Kernighan TSP heuristic[J].Mathematical Programming Computation,2009,1(2/3):119-163. [19] HELSGAUN K.An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems[EB/OL].[2019-08-02].http://akira.ruc.dk/~keld/research/LKH-3/. [20] HOOS H H,STUTZLE T.Stochastic local search[M].San Francisco,USA:[s.n.],2004. [21] REINELT G.The traveling salesman:computational solutions for TSP applications[EB/OL].[2019-08-02].http://www.cfgbiotech.com/the-traveling-salesman-computational-solutions-for-tsp-applications-lecture-notes.pdf. [22] KAELBLING L P,LITTMAN M L,MOORE A W.Reinforcement learning:an introduction[J].IEEE Transactions on Neural Networks,2005,16(1):285-286. [23] ZOU Peng,ZHOU Zhi,CHEN Guoliang,et al.A multilevel reduction algorithm to TSP[J].Journal of Software,2003,14(1):35-42.(in Chinese)邹鹏,周智,陈国良,等.求解TSP问题的多级归约算法[J].软件学报,2003,14(1):35-42. |