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

Avşar B, Aliabadi DE (2015) Parallelized neural network system for solving Euclidean traveling salesman problem. Appl Soft Comput 34:862–873

Bellifemine FL, Caire G, Greenwood D (2007) Developing multi-agent systems with JADE. Wiley, Hoboken

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–14450

Chica M, Cordón Ó, Damas S, Bautista J (2015) Interactive preferences in multiobjective ant colony optimisation for assembly line balancing. Soft Comput 19:2891–2903

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–59

Donald D (2011) Traveling salesman problem, theory and applications. InTech, Rijeka

Dong G, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39:5006–5011

Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66

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–41

Dorigo M, Stützle T (2004) Ant Colony Optimization. Bradford Book, Cambridge

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–156

Feng X, Lau FC, Yu H (2013) A novel bio-inspired approach based on the behavior of mosquitoes. Inf Sci 233:87–108

Gülcü Ş, Kodaz H (2015) A novel parallel multi-swarm algorithm based on comprehensive learning particle swarm optimization. Eng Appl Artif Intell 45:33–45

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–117

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–206

Jia H (2015) A novel hybrid optimization algorithm and its application in solving complex problem. Int J Hybrid Inf Technol 8(2):1–10

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–261

Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. Local Search Comb Optim 1:215–310

Jun-man K, Yi Z (2012) Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Proc 17:319–325

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–1696

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–132

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

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–490

Marinakis Y, Marinaki M, Dounias G (2011) Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inf Sci 181:4684–4698

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–1468

Nalepa J, Blocho M, Czech ZJ (2013) Co-operation schemes for the parallel memetic algorithm. In: Parallel processing and applied mathematics. Springer, pp 191–201

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–3766

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–2036

Reinelt G (1991) TSPLIBA traveling salesman problem library. ORSA J Comput 3:376–384

Ruciński M, Izzo D, Biscani F (2010) On the impact of the migration topology on the island model. Parallel Comput 36:555–571

Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38–53

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–215

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–2291

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–81

Viswanathan V, Krishnamurthi I (2015) Finding relevant semantic association paths using semantic ant colony optimization algorithm. Soft Comput 19:251–260

Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124–133

Wu M-T, Hong T-P, Lee C-N (2012) A continuous ant colony system framework for fuzzy data mining. Soft Comput 16:2071–2082

Yong W (2015) Hybrid Max–Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585–596

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–1236