[1] Baraglia R, Hidalgo J I, Perego R. A Hybrid Heuristic for the Traveling Salesman Problem[J]. IEEE Transactions on Evolutionary Computation, 2001, 5(6): 613-622. [2] Rego C, Gamboa D, Glover F, et al. Traveling Salesman Problem Heuristics: Leading Methods, Implementations and Latest Advances[J]. European Journal of Operational Research, 2011, 211(3): 427-441. [3] Bektas T. The Multiple Traveling Salesman Problems: An Overview of Formulations and Solution Procedures[J]. Omega: The International Journal of Management Science, 2006, 34(3): 209-219. [4] Elaoud S, Teghem J, Loukil T. Multiple Crossover Genetic Algorithms for the Multiobjective Traveling Salesman Problem[J]. Electronic Notes in Discrete Mathematics, 2010, 36(1): 939-946. [5] Manuel L I, Blum C. Beam-ACO for the Travelling Salesman Problem with Time Windows[J]. Computers & Operations Research, 2010, 37(9): 1570-1583. [6] John M, Charlesoon E. An Insert-delete Heuristic for the Traveling Salesman Subset-tour Problem with One Additional Constraint[J]. Journal of the Operational Research Society, 1992, 43(3): 277-283. [7] Miller J. Analysis of the Traveling Salesman Problem with a Subset of Intermediate Cities and Dynamic Edge Weights Used with Intelligent Transportation Systems[C]//Proc. of the 7th International Conference on Information, Communications and Signal Processing. Beijing, China: [s. n.], 2009. [8] 牟廉明. 子旅行商问题及其蚁群求解算法[J]. 计算机应用与软件, 2011, 28(11): 132-135. [9] Albayrak M, Allahverdi N. Development a New Mutation Operator to Solve the Traveling Salesman Problem by Aid of Genetic Algorithms[J]. Expert Systems with Applications, 2011, 38(3): 1313-1320. [10] Faigl J. On the Performance of Self-organizing Maps for the Non-euclidean Traveling Salesman Problem in the Polygonal Domain[J]. Information Sciences, 2011, 181(19): 4214-4229. [11] Dortgo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(l): 53-66. [12] Voudouris C, Tsang E. Guided Local Search and Its Application to the Traveling Salesman Problem[J]. European Journal of Operational Research, 1999, 113(2): 469-499. [13] 朱庆保, 杨志军. 基于变异和动态信息素更新的蚁群优化算 法[J]. 软件学报, 2004, 15(2): 185-192. [14] Reinelt G. TSPLIB——A Traveling Salesman Problem Library[J]. Informs Journal on Computing, 1991, 3(4): 376-384.
|