Hybrid algorithm based on chemical reaction optimization and Lin-Kernighan local search for the traveling salesman problem

Proceedings - 2011 7th International Conference on Natural Computation, ICNC 2011

Volumn 3, Issue , 2011, Pages 1518-1521

  Sun, Jian ^a   Wang, Yuting ^a   Li, Junqing ^a   Gao, Kaizhou ^a  

^a LIAOCHENG UNIVERSITY   (China)

Author keywords

Chemical Reaction Optimization; Lin Kernighan Local Search; Traveling Salesman Problem

Indexed keywords

HEURISTIC OPTIMIZATION METHOD; HYBRID ALGORITHMS; LIN-KERNIGHAN; LOCAL SEARCH; LOCAL SEARCHER; NP-HARD; OPTIMIZATION PROBLEMS; REACTION OPTIMIZATION; STATE OF FREE;

ALGORITHMS; CHEMICAL REACTIONS; HEURISTIC METHODS;

TRAVELING SALESMAN PROBLEM;

EID: 80053419626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2011.6022378     Document Type: Conference Paper

References (19)

1. K. Helsgaun, An Effective implementation of the Lin-Kernighan traveling talesman heuristic, Eur. J. Oper. Res. 126, 106-130 (2000).
2. M.W. Padberg, G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scalesymmetric traveling salesman problems, SIAM Review 33, 60-100 (1991).
3. D. Applegate, W. Cook, A. Rohe, Chained Lin-Kernighan for large traveling salesman problems, Informs J. Comput. 15, 82-92 (2003) (Pubitemid 39042734)
4. M. Gendreau, A. Hertz, G. Laporte, New insertion and post optimization procedures for the traveling salesman problem, Oper. Res. 40(1992) 1086-1094.
5. S. Lin, B.W. Kernighan, An effiective heuristic algorithm for the traveling salesman problem, Oper. Res. 21, 498-516 (1973).
6. Y. Chen, P. Zhang, Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution, Physica A 371, 627-632 (2006). (Pubitemid 44397335)
7. C.-N. Fiechter, A parallel tabu search algorithm for large traveling salesman problems, Discrete Appl. Math. 51, 243-26 (1994).
8. M. Albayrak, N. Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms, Expert Syst. Appl. 38, 1313-1320 (2011).
9. N. Mladenović, P. Hansen, Variable neighborhood search, Comput. Oper. Res. 24, 1097-1100 (1997).
10. J.C. Créput, A. Koukam, A memetic neural network for the euclidean traveling salesman problem. Neurocomputing 72, 1250-1264 (2009)
11. C.F. Tsai, C.W. Tsai, C.C. Tseng, A new hybrid heuristic approach for solving large traveling salesman problem, Inform. Sci. 166, 67-81 (2004).
12. X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu, Q.X. Wang, Particle swarm optimization-based algorithms for TSP and generalized TSP, Inform. Process. Lett. 103, 169-176 (2007). (Pubitemid 46898376)
13. A. Y. S. Lam, V. O. K. Li, Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans. Evol. Comput. 14, 381-399 (2010)
14. C. Voudouris, E. Tsang, Guided local search and its application to the traveling salesman problem, Eur. J. Oper. Res. 113, 469-499 (1999).
15. L. Davis, Applying adaptive algorithms to epistatic domains, In: A.K. Joshi, (Ed.), Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pp. 162-164, Morgan Kaufmann, Los Angeles (1985).
16. B. Freisleben, P. Merz, New genetic local search operators for the traveling salesman problem. In: H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel, (Eds.), Proceedings of the 4th Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, vol. 1141, pp. 890-900, Springer, Berlin(1996).
17. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA J. Comput. 3, 376-384 (1991).
18. Y. Marinakis, A. Migdalas, P.M. Pardalos, Expanding neighborhood GRASP for the traveling salesman problem, Comput. Optim. Appl. 32, 231-257 (2005). (Pubitemid 41406908)
19. Y. Marinakis, A. Migdalas, P.M. Pardalos, A hybrid Genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, J. Comb. Optim. 10, 311-326 (2005). (Pubitemid 41660713)