Advertisement

Soft Computing

, Volume 22, Issue 5, pp 1669–1685 | Cite as

A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem

  • Şaban Gülcü
  • Mostafa Mahi
  • Ömer Kaan Baykan
  • Halife Kodaz
Methodologies and Application

Abstract

This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic approaches and hybrid methods obtain good results in solving the TSP, they cannot successfully avoid getting stuck to local optima. Furthermore, their processing duration unluckily takes a long time. To overcome these deficiencies, we propose the parallel cooperative hybrid algorithm (PACO-3Opt) based on ant colony optimization. This method uses the 3-Opt algorithm to avoid local minima. PACO-3Opt has multiple colonies and a master–slave paradigm. Each colony runs ACO to generate the solutions. After a predefined number of iterations, each colony primarily runs 3-Opt to improve the solutions and then shares the best tour with other colonies. This process continues until the termination criterion meets. Thus, it can reach the global optimum. PACO-3Opt was compared with previous algorithms in the literature. The experimental results show that PACO-3Opt is more efficient and reliable than the other algorithms.

Keywords

Ant colony optimization Parallel algorithm 3-Opt algorithm Traveling salesman problem Master–slave paradigm 

Notes

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

References

  1. Avşar B, Aliabadi DE (2015) Parallelized neural network system for solving Euclidean traveling salesman problem. Appl Soft Comput 34:862–873CrossRefGoogle Scholar
  2. Bellifemine FL, Caire G, Greenwood D (2007) Developing multi-agent systems with JADE. Wiley, HobokenCrossRefGoogle Scholar
  3. Chen S-M, Chien C-Y (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38:14439–14450CrossRefGoogle Scholar
  4. Chica M, Cordón Ó, Damas S, Bautista J (2015) Interactive preferences in multiobjective ant colony optimisation for assembly line balancing. Soft Comput 19:2891–2903CrossRefGoogle Scholar
  5. Cirasella J, Johnson DS, McGeoch LA, Zhang W (2001) The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. In: Algorithm engineering and experimentation. Springer, pp 32–59Google Scholar
  6. Donald D (2011) Traveling salesman problem, theory and applications. InTech, RijekaGoogle Scholar
  7. Dong G, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39:5006–5011CrossRefGoogle Scholar
  8. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66CrossRefGoogle Scholar
  9. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26:29–41CrossRefGoogle Scholar
  10. Dorigo M, Stützle T (2004) Ant Colony Optimization. Bradford Book, CambridgeMATHGoogle Scholar
  11. Duan H, Ma G, Liu S (2007) Experimental study of the adjustable parameters in basic ant colony optimization algorithm. IEEE Congr Evol Comput CEC 2007:149–156Google Scholar
  12. Feng X, Lau FC, Yu H (2013) A novel bio-inspired approach based on the behavior of mosquitoes. Inf Sci 233:87–108MathSciNetCrossRefMATHGoogle Scholar
  13. Gülcü Ş, Kodaz H (2015) A novel parallel multi-swarm algorithm based on comprehensive learning particle swarm optimization. Eng Appl Artif Intell 45:33–45CrossRefGoogle Scholar
  14. Gündüz M, Kiran MS, Özceylan E (2014) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23:103–117CrossRefGoogle Scholar
  15. Hao Z-F, Cai R-C, Huang H (2006) An adaptive parameter control strategy for ACO. In: IEEE international conference on machine learning and cybernetics, pp 203–206Google Scholar
  16. Jia H (2015) A novel hybrid optimization algorithm and its application in solving complex problem. Int J Hybrid Inf Technol 8(2):1–10CrossRefGoogle Scholar
  17. Jiang J, Gao J, Li G, Wu C, Pei Z (2014) Hierarchical solving method for large scale TSP problems. In: International symposium on neural networks, pp 252–261Google Scholar
  18. Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. Local Search Comb Optim 1:215–310MATHGoogle Scholar
  19. Jun-man K, Yi Z (2012) Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Proc 17:319–325CrossRefGoogle Scholar
  20. Junqiang W, Aijia O (2012) A hybrid algorithm of ACO and delete-cross method for TSP. In: IEEE international conference on industrial control and electronics engineering (ICICEE), pp 1694–1696Google Scholar
  21. Kızılates G, Nuriyeva F, Kutucu H (2015) A tour extending hyper-heuristic algorithm for the traveling salesman problem. Proc IAM 4(1):8–15MATHGoogle Scholar
  22. Kolli VM, Sharvani G (2014) An ACO-based efficient stagnation avoidance methodology for MANETS. In: Proceedings of ninth international conference on wireless communication and sensor networks. Springer, pp 125–132Google Scholar
  23. Liu J, Yang J, Liu H, Tian X, Gao M (2016) An improved ant colony algorithm for robot path planning. Soft Comput. doi: 10.1007/s00500-016-2161-7 Google Scholar
  24. Mahi M, Baykan ÖK, Kodaz H (2015) A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem. Appl Soft Comput 30:484–490CrossRefGoogle Scholar
  25. Marinakis Y, Marinaki M, Dounias G (2011) Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inf Sci 181:4684–4698MathSciNetCrossRefGoogle Scholar
  26. Masutti TA, de Castro LN (2009) A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf Sci 179:1454–1468MathSciNetCrossRefGoogle Scholar
  27. Nalepa J, Blocho M, Czech ZJ (2013) Co-operation schemes for the parallel memetic algorithm. In: Parallel processing and applied mathematics. Springer, pp 191–201Google Scholar
  28. Othman ZA, Srour AI, Hamdan AR, Ling PY (2013) Performance water flow-like algorithm for TSP by improving its local search. Int J Adv Comput Technol 5:126Google Scholar
  29. Pasti R, De Castro LN (2006) A neuro-immune network for solving the traveling salesman problem. In: IEEE international joint conference on neural networks, pp 3760–3766Google Scholar
  30. Peker M, Sen B, Kumru PY (2013) An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method. Turk J Electr Eng Comput Sci 21:2015–2036CrossRefGoogle Scholar
  31. Reinelt G (1991) TSPLIBA traveling salesman problem library. ORSA J Comput 3:376–384CrossRefMATHGoogle Scholar
  32. Ruciński M, Izzo D, Biscani F (2010) On the impact of the migration topology on the island model. Parallel Comput 36:555–571CrossRefMATHGoogle Scholar
  33. Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38–53MathSciNetCrossRefMATHGoogle Scholar
  34. Stützle T, López-Ibánez M, Pellegrini P, Maur M, De Oca MM, Birattari M, Dorigo M (2011) Parameter adaptation in ant colony optimization. In: Autonomous search. Springer, pp 191–215Google Scholar
  35. Tang J, Lim M-H, Ong Y-S, Er MJ (2004) Study of migration topology in island model parallel hybrid-GA for large scale quadratic assignment problems. In: IEEE 8th control, automation, robotics and vision conference, pp 2286–2291Google Scholar
  36. Tsai C-F, Tsai C-W, Tseng C-C (2004) A new hybrid heuristic approach for solving large traveling salesman problem. Inf Sci 166:67–81MathSciNetCrossRefMATHGoogle Scholar
  37. Viswanathan V, Krishnamurthi I (2015) Finding relevant semantic association paths using semantic ant colony optimization algorithm. Soft Comput 19:251–260CrossRefGoogle Scholar
  38. Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124–133CrossRefGoogle Scholar
  39. Wu M-T, Hong T-P, Lee C-N (2012) A continuous ant colony system framework for fuzzy data mining. Soft Comput 16:2071–2082CrossRefGoogle Scholar
  40. Yong W (2015) Hybrid Max–Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585–596Google Scholar
  41. Zhou Y, Luo Q, Chen H, He A, Wu J (2015) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227–1236CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Şaban Gülcü
    • 1
  • Mostafa Mahi
    • 2
  • Ömer Kaan Baykan
    • 3
  • Halife Kodaz
    • 3
  1. 1.Department of Computer EngineeringNecmettin Erbakan UniversityKonyaTurkey
  2. 2.Department of Computer Engineering and Information TechnologyPayame Noor UniversityTehranIran
  3. 3.Department of Computer Engineering, Faculty of EngineeringSelcuk UniversityKonyaTurkey

Personalised recommendations