A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem
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.
KeywordsAnt colony optimization Parallel algorithm 3-Opt algorithm Traveling salesman problem Master–slave paradigm
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- 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
- Donald D (2011) Traveling salesman problem, theory and applications. InTech, RijekaGoogle Scholar
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- Reinelt G (1995) TSP library. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
- 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
- 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
- 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