Solving the traveling salesman problem using cooperative genetic ant systems

Expert Systems with Applications - Tập 39 - Trang 5006-5011 - 2012
Gaifang Dong1, William W. Guo2, Kevin Tickle2
1College of Computer and Information Engineering, Inner Mongolia Agricultural University, Hohhot, China
2School of Information and Communication Technology, Central Queensland University, North Rockhampton, QLD 4702, Australia

Tài liệu tham khảo

Albayrak, 2011, Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms, Expert Systems with Applications, 38, 1313, 10.1016/j.eswa.2010.07.006 Bhattacharyya, 2009, Comparative study of some solution methods for traveling salesman problem using genetic algorithms, Cybernetics and Systems, 40, 1, 10.1080/01969720802492967 Birattari, 2007, On the invariance of ant colony optimization, IEEE Transactions on Evolutionary Computation, 11, 732, 10.1109/TEVC.2007.892762 Dorigo, 2006, Ant colony optimization: artificial ants as a computational intelligence technique, IEEE Computational Intelligence Magazine, 1, 28, 10.1109/MCI.2006.329691 Dorigo, 1997, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 53, 10.1109/4235.585892 Dorigo, 1996, The ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics – Part B, 26, 29, 10.1109/3477.484436 Flood, 1955, The traveling salesman problem, Operation Research, 4, 61, 10.1287/opre.4.1.61 Hao, Z. F., Cai, R. C., & Huang, H. (2006). An adaptive parameter control strategy for ACO. In Proceedings of the Fifth International Conference on Machine Learning and Cybernetics (pp. 13–16). Jayalakshmi, 2001, A hybrid genetic algorithm – A new approach to solve traveling salesman problem, International Journal of Computational Engineering Science, 2, 339, 10.1142/S1465876301000350 Lawer, 1985 Leung, 2004, An expanding self-organizing neural network for the traveling salesman problem, Neurocomputing, 6, 267, 10.1016/j.neucom.2004.02.006 Liu, 2005, Rank-based ant colony optimization applied to dynamic traveling salesman problems, Engineering Optimization, 37, 831, 10.1080/03052150500340504 Lo, 1998, Annealing framework with learning memory, IEEE Transactions on System, Man, Cybernetics – Part A, 28, 1 Masutti, 2009, A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem, Information Sciences, 179, 1454, 10.1016/j.ins.2008.12.016 Montgomery, 2003, The accumulated experience ant colony for the traveling salesman problem, International Journal of Computational Intelligence and Applications, 3, 189, 10.1142/S1469026803000938 Pilat, M. L., & White, T. (2002). Using genetic algorithms to optimize ACS–TSP. In Proceedings of the 3rd International Workshop on ants, Brussels (pp. 282–287). Puris, 2010, Analysis of the efficacy of a two-stage methodology for ant colony optimization: Case of study with TSP and QAP, Expert Systems with Applications, 37, 5443, 10.1016/j.eswa.2010.02.069 Rego, 2011, Traveling salesman problem heuristics: Leading methods, implementations and latest advances, European Journal of Operational Research, 211, 427, 10.1016/j.ejor.2010.09.010 Reinelt, 1994 Socha, 2002, A MAX–MIN ant system for the university timetabling problem, Lecture Notes in Computer Science, 2463, 1, 10.1007/3-540-45724-0_1 Stutzle, T., & Hoos, H. (1997). The MAX–MIN ant system and local search for the traveling salesman problem. In Proceedings of the IEEE International Conference on Evolutionary Computation, Piscataway, USA (pp. 309–314). Stutzle, 2000, MAX–MIN ant system, Future Generation Computer Systems, 16, 889, 10.1016/S0167-739X(00)00043-1 Takahashi, R. (2009). A hybrid method of genetic algorithms and ant colony optimization to solve the traveling salesman problem. In Proceedings of the International Conference on Machine Learning and Applications pp. (81–88). Tsai, 2004, A new hybrid heuristic approach for solving large traveling salesman problem, Information Sciences, 166, 67, 10.1016/j.ins.2003.11.008 Tsai, 2003, Heterogeneous selection genetic algorithms for traveling salesman problems, Engineering Optimization, 35, 297, 10.1080/0305215031000109622 TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/. Tsutsui, 2007, Ant colony optimization with cunning ants, Transactions of Japanese Society for Artificial Intelligence, 22, 9, 10.1527/tjsai.22.29 Yang, 2008, Solving traveling salesman problems using generalized chromosome genetic algorithm, Progress in Natural Science, 18, 887, 10.1016/j.pnsc.2008.01.030 Zhao, F., Dong, J., Li, S., & Sun, J. (2008). An improved ant colony optimization algorithm with embedded genetic algorithm for the traveling salesman problem. In Proceedings of the 7th World Congress on Intelligent Control and Automation (pp. 7902–7906).