Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Angeniol, 1988, Self-organizing feature maps and the traveling salesman problem, Neural Networks, 1, 289, 10.1016/0893-6080(88)90002-0 Applegate, 2007 Aras, 1999, The Kohonen network incorporating explicit statistics and its application to the traveling salesman problem, Neural Networks, 12, 1273, 10.1016/S0893-6080(99)00063-5 Bullnheimer, 1997, A new rank based version of the ant system – A computational study, Central European Journal for Operations Research and Economics, 7, 25 Chang, 2010, Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems, Expert Systems with Applications, 37, 1863, 10.1016/j.eswa.2009.07.066 Chen, S. M., & Chien, C. Y. (2010). A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. In Proceedings of the 2010 international conference on machine learning and cybernetics, Qingdao, Shandong, China (pp. 2477–2482). Chien, C. Y., & Chen, S. M. (2009). A new method for handling the traveling salesman problem based on parallelized genetic colony systems. In Proceedings of the 2009 international conference on machine learning and cybernetics, Boading, Hebei, China (pp. 2828–2833). Cheng, 2009, Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm, Expert Systems with Applications, 36, 7758, 10.1016/j.eswa.2008.09.001 Cochrane, 2003, The co-adaptive neural network approach to the Euclidean traveling salesman problem, Neural Networks, 16, 1499, 10.1016/S0893-6080(03)00056-X Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In Proceedings of the first European conference on artificial life, Paris, France (pp. 134–142). Dorigo, M. (1992). Learning and nature algorithm. Ph.D. dissertation, Dipartmento di Electtonica, Polotecnico di Milano, Italy (in Italian). Dorigo, M., Maniezzo, V., & Colorni, A. (1992). Positive feedback as a search strategy. Tech. rep. 99-016, Dipartimento di Electtonica, Polotecnico di Milano, Italy. Dorigo, 1996, Ant system: Optimization by a colony of cooperating agents, IEEE Transactions on System, Man, and Cybernetics Part-B: Cybernetics, 26, 29, 10.1109/3477.484436 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, 1997, Ant colonies for the traveling salesman problem, Biosystems, 34, 73, 10.1016/S0303-2647(97)01708-5 Ellabib, 2007, Exchange strategies for multiple ant colony system, Information Sciences, 177, 1248, 10.1016/j.ins.2006.09.016 Gambardella, L. M., & Dorigo, M. (1996). Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of 1996 IEEE international conference on evolutionary computation, Nagoya, Japan (pp. 622–627). Gen, 1997 Goldberg, 1989 Gwiazda, 2006, Vol. I Gwiazda, 2007, Vol. II Holland, 1975 Kaur, D., & Murugappan, M. M. (2008). Performance enhancement in solving traveling salesman problem using hybrid genetic algorithm. In Proceedings of the 2008 annual meeting of the North American fuzzy information processing society, New York (pp. 1–6). Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE international conference on neural networks, Piscataway, New Jersey (Vol. 4, pp. 1942–1948). Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Krohling, 2006, Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems, IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, 36, 1407, 10.1109/TSMCB.2006.873185 Lawler, E. L., Lenstra, J. K., & Shmoys, D. B. (1985). The traveling salesman problem: A guided tour of combinatorial optimization. Series in discrete mathematics & optimization. Chichester: Wiley. Laarhoven, 1987 Li, L., Ju, S., & Zhang, Y. (2008). Improved ant colony optimization for the traveling salesman problem. In Proceedings of the 2008 international conference on intelligent computation technology and automation (Vol. 1, pp. 76–80). Liu, 2009, Study of genetic algorithm with reinforcement learning to solve the TSP, Expert Systems with Applications, 36, 6995, 10.1016/j.eswa.2008.08.026 Lin, 2009, A hybrid of cooperative particle swarm optimization and cultural algorithm for neural fuzzy networks and its prediction applications, IEEE Transactions on Systems, Man, and Cybernetics – Part C: Applications and Reviews, 39, 55, 10.1109/TSMCC.2008.2002333 Marinakis, 2010, A hybrid genetic – Particle swarm optimization algorithm for solving the vehicle routing problem, Expert Systems with Applications, 37, 1446, 10.1016/j.eswa.2009.06.085 Martin, 1996, Combining simulated annealing with local search heuristics, Annals of Operations Research, 63, 57, 10.1007/BF02601639 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 Naimi, 2009, New robust and efficient ant colony algorithms: Using new interpretation of local updating process, Expert Systems with Applications, 36, 481, 10.1016/j.eswa.2007.09.048 Nguyen, 2007, Implementation of an effective hybrid GA for large-scale traveling salesman problem, IEEE Transactions on System, Man, and Cybernetics – Part B, 37, 92, 10.1109/TSMCB.2006.880136 Pasti, R., & Castro, L. N. D. (2006). A neuro-immune network for solving the traveling salesman problem. In Proceedings of 2006 international joint conference on neural networks, Vancouver, BC, Canada (pp. 3760–3766). Saadatmand-Tarzjan, 2007, A novel constructive-optimizer neural network for the traveling salesman problem, IEEE Transactions on Systems, Man, Cybernetics – Part B: Cybernetics, 37, 754, 10.1109/TSMCB.2006.888421 Sauer, J. G., & Coelho, L. (2008). Discrete differential evolution with local search to solve the traveling salesman problem: Fundamentals and case studies. In Proceedings of the 7th IEEE international conference on cybernetic intelligence systems, London, England (pp. 1–6). Shi, X., Wang, L., Zhou, Y., & Liang, Y. (2008). An ant colony optimization method for prize-collecting traveling salesman problem with time windows. In Proceedings of the fourth international conference on natural computation, Jinan, China (Vol. 7, pp. 480–484). Somhom, 1997, A self-organizing model for the traveling salesman problem, Journal of the Operational Research Society, 48, 919, 10.1057/palgrave.jors.2600439 Stützle, T. & Hoos, H. H. (1996). Improving the ant system: A detail report on the MAX–MIN ant system. Tech. rep. AIDA-96-12, Darmstadt University of Technology, Computer Science Department, Intellectics Group. Stützle, 2000, MAX–MIN ant system, Future Generation Computer Systems, 16, 889, 10.1016/S0167-739X(00)00043-1 Tasgetiren, M. F., Suganthan, P. N., Pan, Q. K., & Liang, Y. C. (2007). A genetic algorithm for the generalized traveling salesman problem. In Proceedings of the 2007 IEEE congress on evolutionary computation, Singapore (pp. 2382–2389). Ting, 2006, A novel approach for unit commitment problem via an effective hybrid particle swarm optimization, IEEE Transactions on Power Systems, 21, 411, 10.1109/TPWRS.2005.860907 Xie, 2008, Multiagent optimization system for solving the traveling salesman problem (TSP), IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, 39, 489 Yi, J., Bi, W., Yang, G., & Tang, Z. (2008). A fast elastic net method for traveling salesman problem. In Proceedings of the 8th international conference on intelligent systems design and applications, Kaohsiung, Taiwan (pp. 462–467). Zhao, G., Luo, W., Nie, H., & Li, C. (2008). A genetic algorithm balancing exploration and exploitation for the traveling salesman problem. In Proceedings of the fourth international conference on natural computation, Jinan, China (Vol. 1, pp. 505–509).