Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2016 (2016), Article ID 8932896, 13 pages
http://dx.doi.org/10.1155/2016/8932896
Research Article

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP

Department of Computer Science, Faculty of Computing and Information Technology, University of Science and Technology, Sana’a, Yemen

Received 22 June 2016; Revised 15 October 2016; Accepted 19 October 2016

Academic Editor: Elio Masciari

Copyright © 2016 Abdulqader M. Mohsen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. M. Nawi, M. Z. Rehman, and A. Khan, “A new bat based back-propagation (bat-bp) algorithm,” in Advances in Systems Science: Proceedings of the International Conference on Systems Science 2013 (ICSS 2013), vol. 240 of Advances in Intelligent Systems and Computing, pp. 395–404, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar
  2. G. Laporte, “The traveling salesman problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 2, pp. 231–247, 1992. View at Publisher · View at Google Scholar · View at Scopus
  3. J. K. Lenstra and A. H. G. Rinnooy Kan, “Some simple applications of the travelling salesman problem,” Operational Research Quarterly, vol. 26, no. 4, pp. 717–733, 1975. View at Publisher · View at Google Scholar · View at Scopus
  4. G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications, vol. 840 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1994. View at MathSciNet
  5. É. D. Taillard, L. M. Gambardella, M. Gendreau, and J.-Y. Potvin, “Adaptive memory programming: a unified view of metaheuristics,” European Journal of Operational Research, vol. 135, no. 1, pp. 1–16, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. E. Osaba, X.-S. Yang, F. Diaz, P. Lopez-Garcia, and R. Carballedo, “An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems,” Engineering Applications of Artificial Intelligence, vol. 48, pp. 59–71, 2016. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Braun, “On solving travelling salesman problems by genetic algorithms,” in Parallel Problem Solving from Nature: 1st Workshop, PPSN I Dortmund, FRG, October 1–3, 1990 Proceedings, vol. 496 of Lecture Notes in Computer Science, pp. 129–133, Springer, Berlin, Germany, 1990. View at Publisher · View at Google Scholar
  8. B. S. N. Al-Kazemi and C. K. Mohan, “Multiphase discrete particle swarm optimization,” 2000.
  9. C.-R. Hwang, “Simulated annealing: theory and applications,” Acta Applicandae Mathematicae, vol. 12, no. 1, pp. 108–111, 1988. View at Google Scholar
  10. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  11. L. M. Gambardella, É. D. Taillard, and M. Dorigo, “Ant colonies for the quadratic assignment problem,” Journal of the Operational Research Society, vol. 50, no. 2, pp. 167–176, 1999. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian, “Ant system for job-shop scheduling,” Belgian Journal of Operations Research, Statistics and Computer Science, vol. 34, no. 1, pp. 39–53, 1994. View at Google Scholar
  13. R. Schoonderwoerd, J. L. Bruten, O. E. Holland, and L. J. M. Rothkrantz, “Ant-based load balancing in telecommunications networks,” Adaptive Behavior, vol. 5, no. 2, pp. 169–207, 1997. View at Google Scholar · View at Scopus
  14. K. Q. Zhu, Population Diversity in Genetic Algorithm for Vehicle Routing Problem with Time Windows, Department of Computer Science, National University of Singapore, 2004.
  15. A. R. McKendall and J. Shang, “Hybrid ant systems for the dynamic facility layout problem,” Computers & Operations Research, vol. 33, no. 3, pp. 790–803, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Min, P. Dazhi, and Y. Song, “An improved hybrid ant colony algorithm and its application in solving TSP,” in Proceedings of the 2014 7th IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC '14), pp. 423–427, Chongqing, China, December 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. K.-L. Huang and C.-J. Liao, “Ant colony optimization combined with taboo search for the job shop scheduling problem,” Computers & Operations Research, vol. 35, no. 4, pp. 1030–1046, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Yoshikawa and K. Otani, “Ant colony optimization routing algorithm with tabu search,” in Proceedings of the International MultiConference of Engineers and Computer Scientists, vol. 3, pp. 17–19, 2010.
  19. L.-N. Xing, P. Rohlfshagen, Y.-W. Chen, and X. Yao, “A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 41, no. 4, pp. 1110–1123, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. T. W. Liao, R. J. Kuo, and J. T. Hu, “Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems,” Applied Mathematics and Computation, vol. 219, no. 6, pp. 3241–3252, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. Y.-K. Lin, C.-T. Yeh, and P.-S. Huang, “A hybrid ant-tabu algorithm for solving a multistate flow network reliability maximization problem,” Applied Soft Computing Journal, vol. 13, no. 8, pp. 3529–3543, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. V. Hajipour, P. Fattahi, and A. Nobari, “A hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem,” Journal of Industrial and Systems Engineering, vol. 7, no. 1, pp. 1–20, 2014. View at Google Scholar
  23. H. Katagiri, T. Hayashida, I. Nishizaki, and Q. Guo, “A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems,” Expert Systems with Applications, vol. 39, no. 5, pp. 5681–5686, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. B. Bontoux and D. Feillet, “Ant colony optimization for the traveling purchaser problem,” Computers and Operations Research, vol. 35, no. 2, pp. 628–637, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. C.-F. Tsai, C.-W. Tsai, and C.-C. Tseng, “A new hybrid heuristic approach for solving large traveling salesman problem,” Information Sciences, vol. 166, no. 1–4, pp. 67–81, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. López-Ibáñez and C. Blum, “Beam-ACO for the travelling salesman problem with time windows,” Computers & Operations Research, vol. 37, no. 9, pp. 1570–1583, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. S.-M. Chen and C.-Y. Chien, “Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques,” Expert Systems with Applications, vol. 38, no. 12, pp. 14439–14450, 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. W. Junqiang and O. Aijia, “A hybrid algorithm of ACO and delete-cross method for TSP,” in Proceedings of the International Conference on Industrial Control and Electronics Engineering (ICICEE '12), pp. 1694–1696, IEEE, Xi'an, China, August 2012. View at Publisher · View at Google Scholar · View at Scopus
  29. G. Dong, W. W. Guo, and K. Tickle, “Solving the traveling salesman problem using cooperative genetic ant systems,” Expert Systems with Applications, vol. 39, no. 5, pp. 5006–5011, 2012. View at Publisher · View at Google Scholar · View at Scopus
  30. M. Gündüz, M. S. Kiran, and E. Özceylan, “A hierarchic approach based on swarm intelligence to solve the traveling salesman problem,” Turkish Journal of Electrical Engineering and Computer Sciences, vol. 23, no. 1, pp. 103–117, 2015. View at Publisher · View at Google Scholar · View at Scopus
  31. M. Mahi, Ö. K. Baykan, and H. Kodaz, “A new hybrid method based on particle swarm optimization, ant colony optimization and 3-Opt algorithms for traveling salesman problem,” Applied Soft Computing, vol. 30, pp. 484–490, 2015. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Yousefikhoshbakht, N. Malekzadeh, and M. Sedighpour, “Solving the traveling salesman problem based on the genetic reactive bone route algorithm whit ant colony system,” International Journal of Production Management and Engineering, vol. 4, no. 2, pp. 65–73, 2016. View at Publisher · View at Google Scholar
  33. K. L. Hoffman, M. Padberg, and G. Rinaldi, “Traveling salesman problem,” in Encyclopedia of Operations Research and Management Science, pp. 1573–1578, Springer, Berlin, Germany, 2013. View at Google Scholar
  34. H. Zhang and J. Han, “Strategy of optimization in ant colony algorithm and simulation research,” Computer Engineering and Applications, vol. 25, article 014, 2006. View at Google Scholar
  35. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  36. V. Černý, “Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm,” Journal of Optimization Theory and Applications, vol. 45, no. 1, pp. 41–51, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Publisher · View at Google Scholar · View at Scopus
  38. F. Herrera and M. Lozano, “Adaptation of genetic algorithm parameters based on fuzzy logic controllers,” Genetic Algorithms and Soft Computing, vol. 8, pp. 95–125, 1996. View at Google Scholar
  39. G. Reinelt, “TSPLIB. A traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Publisher · View at Google Scholar · View at Scopus
  40. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp/.
  41. C. Wang, M. Lin, Y. Zhong, and H. Zhang, “Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem,” International Journal of Intelligent Systems Technologies and Applications, vol. 15, no. 1, pp. 74–94, 2016. View at Publisher · View at Google Scholar