The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem

Berman, P., & Karpinski, M. (2006). 8/7-Approximation algorithm for (1,2)-TSP. In SODA’06, Miami, FL, 2006 (pp. 641–648). Bontoux, 2010, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Computers & Operations Research, 37, 1844, 10.1016/j.cor.2009.05.004 Chen, 2011, Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques, Expert System with Applications, 38, 14439, 10.1016/j.eswa.2011.04.163 Chen, 2010, A novel set-based particle swarm optimization method for discrete optimization problems, IEEE Transactions on Evolutionary Computation, 14, 278, 10.1109/TEVC.2009.2030331 Choi, 2003, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Computers & Operations Research, 30, 773, 10.1016/S0305-0548(02)00050-3 Climer, 2006, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Artificial Intelligence, 170, 714, 10.1016/j.artint.2006.02.005 Črepinšek, 2013, Exploration and exploitation in evolutionary algorithms: A survey, Computing Surveys (CSUR), ACM, 45, 10.1145/2480741.2480752 Deineko, V., Klinz, B., & Woeginger, G. (2006). Four point conditions and exponential neighborhoods for symmetric TSP. In Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithm, SODA 2006, Miami, FL, 2006 (pp. 544–553). Ding, 2007, Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs, Tsinghua Science and Technology, 12, 459, 10.1016/S1007-0214(07)70068-8 Douglas, 2006 Gen, 1997 Ghaziri, 2003, A neural network algorithm for the traveling salesman problem with backhauls, Computers & Industrial Engineering, 44, 267, 10.1016/S0360-8352(02)00179-1 Goldberg, D., & Lingle, R. (1985). Alleles, loci, and the travelling salesman problem. In Proceedings of the first international conference on genetic algorithms and their applications, Pittsburgh, USA, July 24–26, 1985 (pp. 154–159). Helsgaun, K. (xxxx). An effective implementation of the Lin–Kernighan traveling salesman heuristic. <http://www2.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/tsp/>. Holland, 1975 Ise website (2013). <http://www.ise.ncsu.edu/fangroup/ga.html>. Johnson, 2004 Liu, 2008, Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem, European Journal of Operational Research, 191, 332, 10.1016/j.ejor.2007.08.023 Liu, 2010, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, Applied Mathematics and Computation, 216, 125, 10.1016/j.amc.2010.01.021 Liu, 2009, Study of genetic algorithm with reinforcement learning to solve the TSP, Expert System with Applications, 36, 6995, 10.1016/j.eswa.2008.08.026 Majumdar, 2011, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Journal of Computational and Applied Mathematics, 235, 3063, 10.1016/j.cam.2010.12.027 Michalewicz, 1994 Oliveto, P. S., & Witt, C. (2012). On the analysis of the simple genetic algorithm. In Proceedings of the fourteenth international conference on genetic and evolutionary computation conference, Philadelphia, PA, USA, July 7–11, 2012 (pp. 1341–1348). Reeves, 1994, Genetic algorithms and neighborhood search, Evolutionary Computing, AISB Workshop, Lecture Notes in Computer Science, 865, 115, 10.1007/3-540-58483-8_10 Rodríguez, 2012, The effect of the asymmetry of road transportation networks on the traveling salesman problem, Computers & Operations Research, 39, 1566, 10.1016/j.cor.2011.09.005 Schmitt, 1998, Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study, European Journal of Operational Research, 108, 551, 10.1016/S0377-2217(97)00206-3 Sharma, 2013, Review paper of various selection methods in genetic algorithm, International journal of Advanced Research in Computer Science and Software Engineering, 3, 1476 Srinivas, 1994, Genetic algorithms: A survey, IEEE Journal on Computer, 27, 11 Verhoeven, 1995, A parallel 2-opt algorithm for the traveling salesman problem, Future Generation Computer Systems, ll, 175, 10.1016/0167-739X(94)00059-N Wang, 2010, Chaotic particle swarm optimization for assembly sequence planning, Robotics and Computer-Integrated Manufacturing, 26, 212, 10.1016/j.rcim.2009.05.003 wiazda, 2006 Xing, 2008, A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem, Engineering Applications of Artificial Intelligence, 21, 1370, 10.1016/j.engappai.2008.01.003 Yu, 2010 Zhang, 1996, A study of complexity transitions on the asymmkric traveling salesman problem, Artificial Intelligence, 81, 223, 10.1016/0004-3702(95)00054-2