[1] COOK W J. 迷茫的旅行商:一个无处不在的计算机算法问题[M]. 随春宁,译.北京:人民邮电出版社, 2012:1-278. (COOK W J. IN Pursuit of the Traveling Salesman:Mathematics at the Limits of Computation[M]. SUI C N, translated. Beijing:Posts & Telecom Press, 2012:1-278.) [2] GAREY M R, JOHNSON D S. Computers and Intractability:A Guide to the Theory of NP-Completeness[M]. San Francisco:W.H. Freeman, 1979:1-579. [3] ROBINSON J B. On the Hamiltonian game (a traveling salesman problem)[R]. Santa Monica, California:RAND Research Memorandum RM-303, 1949. [4] BATYRSHIN I, SIDOROV G. Advances in Artificial Intelligence[M]. Berlin:Springer, 2011:1-490. [5] DORIGO M, MANIEZZO V, COLORNI A. Ant system:optimization by a colony of cooperating Agents[J]. IEEE Transactions on Systems Man & Cybernetics, Part B:Cybernetics,1996, 26(1):29-41. [6] KARABOGA D. An idea based on honey bee swarm for numerical optimization, Technical Report-TR06[EB/OL].[2016-02-11]. http://www.rose-hulman.edu/class/se/OldFiles/csse453/schedule/day34/HoneyBeeOptimization.pdf. [7] KENNEDY J, EBERHART R. Particle swarm optimization[C]//Proceedings of the 1995 IEEE International Conference on Neural Networks. Piscataway, NJ:IEEE, 1995:1942-1948. [8] KENNEDY J, EBERHART R. A new optimizer using particle swarm theory[C]//Proceedings of the 6th International Symposium on Micro Machine and Human Science. Piscataway, NJ:IEEE, 1995:39-43. [9] 刘朝华,张英杰,章兢,等.蚁群算法与免疫算法的融合及其在TSP中的应用[J].控制与决策,2010,25(5):695-700.(LIU C H, ZHANG Y J, ZHANG J, et al. Using combination of ant algorithm and immune algorithm to solve TSP[J]. Control and Decision, 2010, 25(5):695-700.) [10] 刘朝华,张英杰,李小花,等.双态免疫优势蚁群算法及其在TSP中的应用研究[J].小型微型计算机系统,2010,31(5):937-941.(LIU C H, ZHANG Y J, LI X H, et al. Research of using binary state ACA based on immune dominance to solve TSP[J]. Journal of Chinese Computer Systems, 2010, 31(5):937-941.) [11] 姚明海,王娜,赵连朋.改进的模拟退火和遗传算法求解TSP问题[J].计算机工程与应用,2013,49(14):60-65.(YAO M H, WANG N, ZHAO L P. Improved simulated annealing algorithm and genetic algorithm for TSP[J]. Computer Engineering and Applications, 2013, 49(14):60-65.) [12] LU H, CHEN W. Dynamic-objective particle swarm optimization for constrained optimization problems[J]. Journal of Combination Optimization, 2006, 12(4):409-419. [13] LU H, CHEN W. Self-adaptive velocity particle swarm optimization for solving constrained optimization problems[J]. Journal of Global Optimization, 2008, 41(3):427-445. [14] 徐向平,鲁海燕,徐迅.基于环形邻域的混沌粒子群聚类算法[J].计算机工程与应用,2016,52(2):54-60.(XU X P, LU H Y, XU X. Ring neighborhood based chaotic particle swarm optimization algorithm for clustering[J]. Computer Engineering and Applications, 2016, 52(2):54-60.) [15] 张江维.自适应混合粒子群优化算法求解大规模旅行商问题[J].计算机应用与软件,2015,32(12):265-269.(ZHANG J W. Solving large-scale TSP with adaptive hybrid PSO[J]. Computer Applications and Software, 2015, 32(12):265-269.) [16] 强宁,康凤举.加速度粒子群算法在多旅行商问题中的应用[J].陕西师范大学学报(自然科学版),2015,43(6):36-42.(QIANG N, KANG F J. Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problem[J]. Journal of Shaanxi Normal University (Nature Science Edition), 2015, 43(6):36-42.) [17] WANG X, MU A, ZHU S. ISPO:a new way to solve traveling salesman problem[J]. Intelligent Control and Automation, 2013, 4(2):122-125. [18] 程毕芸,鲁海燕,徐向平,等.求解旅行商问题的改进局部搜索混沌离散粒子群优化算法[J].计算机应用,2016,36(1):138-142.(CHENG B Y, LU H Y, XU X P, et al. Improved local-search-based chaotic discrete particle swarm optimization algorithm for solving traveling salesman problem[J]. Journal of Computer Applications, 2016, 36(1):138-142.) [19] CLERC M. Discrete particle swarm optimization, illustrated by the traveling salesman problem[M]//New Optimization Techniques in Engineering. Berlin:Springer, 2004:219-239. [20] 刘任任.算法分析与设计[M].武汉:武汉理工大学出版社,2003:1-155.(LIU R R. Algorithm Analysis and Design[M]. Wuhan:Wuhan University of Technology Press, 2003:1-155.) [21] 李文,伍铁斌,赵全友,等.改进的混沌粒子群算法在TSP中的应用[J].计算机应用研究,2015,32(7):2065-2067.(LI W, WU T B, ZHAO Q Y, et al. Improved algorithm of chaotic particle swarm and its application in TSP[J]. Application Research of Computers, 2015, 32(7):2065-2067.) |