中文部份
[1]李泰琳、張靖、卓裕仁,「調適型螞蟻演算法應用於旅行推銷員問題之研究」,運輸學刊,第十九卷第一期,民國九十六年三月,pp.89-120。[2]陳家和、丁慶榮,「應用螞蟻演算法於時窗限制車輛途程問題之研究」,運輸學刊,第十七卷第三期,民國九十四年九月,pp.261-280。[3]陳冠樺,民94年,「螞蟻記憶系統應用於旅行推銷員問題」,私立逢甲大學交通工程與管理學系碩士論文。[4]蕭再安,「作業研究」講義,國立台灣海洋大學。
[5]蘇純繒、翁瑞聰,「以螞蟻群聚最佳化整合噪音擾動法求解TSP問題」,商管科技季刊,第四卷第四期,民國九十二年,pp.359-375。英文部份
[6]Bullnheimer B., Hartl R. F. and Strauss C., 1997, “A new rank-based version of the ant system: a computational study,” Technical Report POM-03/97, Institute of Management science, University of Vienna.
[7]Bektas T., 2006, “The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures,” Omega, Vol. 34, No. 33, pp.209–219.
[8]Colorni A., Dorigo M., and Maniezzo V., “Distributed optimization by ant colonies,” Proceedings of ECAL91 - European Conference on Artificial Life, Paris, France, 1991, F. Varela and P. Bourgine (Eds.), Elsevier Publishing, pp. 134–142.
[9]Concorde's TSP solver Web Page, http://www.tsp.gatech.edu/concorde/index.html
[10]Dorigo M., Maniezzo V. and Colorni A., 1991, “Positive feedback as a search strategy,” Technical Report 91-016, Dipartimento Elettronica, Politecnico di Milano, Italy.
[11]Dorigo M., Maniezzo V. and Colorni A., (1991a), Ant System: An Autocatalytic Optimizing Process, Dipartimento di Elettronica Informatica, Politecnico di Milano, Italy, Technical Report, No. 91016.
[12]Dorigo M., Maniezzo V. and Colorni A., 1996, “Ant system : Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26(1), pp.29-41.
[13]Dorigo M. and Gambardella L. M., 1997, “Ant colony system:a cooperative learning approach to the traveling salesman problem, ”IEEE Transactions on Evolutionary Computation, Vol. 1(1), pp.53-66.
[14]Dorigo M. and Gambardella L. M., 1997, “Ant colonies for the traveling salesman problem,” BioSystems, Vol.43, pp.73-81.
[15]Dorigo M., Blum C., “Ant colony optimization theory: A survey,” Theoretical Computer Sicence 344(2005), pp.243–278.
[16]Gambardella L. M. and Dorigo M., 1996, “Solving symmetric and asymmetric TSPs by ant colonies,” in: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC’96), IEEE Press, Piscataway, pp.622–627.
[17]Hamdy A. Taha (2003), “Operations Research,” Prentice Hall.
[18]Johnson D.S., McGeoch L.A., “The travelling salesman problem: a case study in local optimization,” in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, Chichester, UK, 1997, pp. 215–310.
[19]Stutzle T., Hoos H.H., 1997, “The MAX-MIN ant system and local search for the traveling salesman problem.” in Back, T., Michalewicz, Z., Yao, X.(editors), Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC’97), IEEE press, Piscataway, USA, pp.309-314.
[20]Stutzle T, Dorigo M., 1999, ACO Algorithms for the Traveling Salesman Problem, IRIDIA, Universit Libre de Bruxelles, Belgium.
[21]Stutzle T., Hoos H.H., “MAX–MIN ant system and local search for combinatorial optimization problems,” in: S. Voss, S. Martello, I.H. Osman, C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, MA, 1999, pp. 313–329.
[22]Stutzle T., Hoos H.H., 2000, “MAX-MIN Ant System,” Future Generation computer Systems 16, pp.889-914.
[23]Sean R. Eddy, “What is dynamic programming,” Nature Biotechnology 2004, 22, pp.909-910.
[24]TSPLIB Web Page, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/
[25]TSP Cutting-Plane Web Page, http://www.tsp.gatech.edu/methods/opt/cutting.htm