Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem

European Journal of Operational Research

Volumn 208, Issue 3, 2011, Pages 221-232

  Karapetyan, D ^a   Gutin, G ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Combinatorial optimization; Generalized traveling salesman problem; Heuristics; Lin Kernighan

Indexed keywords

GENERALIZED TRAVELING SALESMAN PROBLEM; HEURISTICS; ITS EFFICIENCIES; LIN-KERNIGHAN; LIN-KERNIGHAN ALGORITHM; LOCAL SEARCH; RUNNING TIME; SOLUTION QUALITY;

COMBINATORIAL OPTIMIZATION; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 78549271426     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.08.011     Document Type: Article

References (31)

1. E. Balas, and M.J. Saltzman An algorithm for the three-index assignment problem Operations Research 39 1991 150 161
2. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, and A. Zverovitch Transformations of generalized ATSP into ATSP Operations Research Letters 31 2003 357 365
3. B. Bontoux, C. Artigues, and D. Feillet A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem Computers & Operations Research 37 2010 1844 1852
4. Chandra, B., Karloff, H., Tovey, C., 1994. New results on the old k-opt algorithm for the TSP. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 150-159.
5. M. Fischetti, J.J. Salazar González, and P. Toth The symmetric generalized traveling salesman polytope Networks 26 1995 113 123
6. M. Fischetti, J.J. Salazar González, and P. Toth A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Operations Research 45 1997 378 394
7. G. Gutin, and D. Karapetyan A memetic algorithm for the generalized traveling salesman problem Natural Computing 9 2010 47 60
8. Gutin, G., Karapetyan, D., Krasnogor, N., 2008. A memetic algorithm for the generalized asymmetric traveling salesman problem. In: Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), pp. 199-210.
9. K. Helsgaun An effective implementation of the Lin-Kernighan traveling salesman heuristic European Journal of Operational Research 126 2000 106 130
10. K. Helsgaun General k-opt submoves for the Lin-Kernighan TSP heuristic Mathematics and Statistics 1 2009 119 163
11. Hu, B., Raidl, G.R., 2008. Effective neighborhood structures for the generalized traveling salesman problem, In: Proceedings of EvoCOP 2008, pp. 36-47.
12. Huang, H., Yang, X., Hao, Z., Wu, C., Liang, Y., Zhao, X., 2005. Hybrid chromosome genetic algorithm for generalized traveling salesman problems. In: Proceedings of ICNC 2005, pp. 137-140.
13. D.S. Johnson, and L.A. McGeoch Experimental analysis of heuristics for the STSP G. Gutin, A.P. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer 369 444
14. Karapetyan, D., Gutin, G., in press. Local search heuristics for the multidimensional assignment problem. Journal of Heuristics (A preliminary version is published in Lecture Notes in Computer Science, vol. 5420, 2009, pp. 100-115). doi:10.1007/s10732-010-9133-3.
15. G. Laporte, A. Asef-Vaziri, and C. Sriskandarajah Some applications of the generalized travelling salesman problem The Journal of the Operational Research Society 47 1996 1461 1467
16. G. Laporte, and F. Semet Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem INFOR 37 1999 114 120
17. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 1973 498 516
18. Noon, C.E., 1988. The Generalized Traveling Salesman Problem. Ph.D. thesis. University of Michigan.
19. C.E. Noon, and J.C. Bean A lagrangian based approach for the asymmetric generalized traveling salesman problem Operations Research 39 1991 623 632
20. C.E. Noon, and J.C. Bean An efficient transformation of the generalized traveling salesman problem INFOR 31 1993 39 44
21. C. Pintea, P. Pop, and C. Chira The generalized traveling salesman problem solved with ant algorithms Journal of Universal Computer Science 13 2007 1065 1075
22. P.C. Pop New integer programming formulations of the generalized traveling salesman problem American Journal of Applied Sciences 4 2007 932 937
23. P.C. Pop, W. Kern, and G. Still A new relaxation method for the generalized minimum spanning tree problem European Journal of Operational Research 170 2006 900 908
24. C. Rego, and F. Glover Local search and metaheuristics G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2006 Springer 309 368
25. G. Reinelt TSPLIB - a traveling salesman problem library ORSA Journal on Computing 3 1991 376 384
26. J. Renaud, and F.F. Boctor An efficient composite heuristic for the symmetric generalized traveling salesman problem European Journal of Operational Research 108 1998 571 584
27. Silberholz, J., Golden, B.L., 2007. The generalized traveling salesman problem: A new genetic algorithm approach. In: Extending the Horizons: Advances in Computing Optimization, and Decision Technologies. Springer, pp. 165-181.
28. L. Snyder, and M. Daskin A random-key genetic algorithm for the generalized traveling salesman problem European Journal of Operational Research 174 2006 38 53
29. Tasgetiren, M., Suganthan, P.N., Pan, Q.Q., 2007. A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: Proceedings of GECCO 2007, pp. 158-167.
30. M.F. Tasgetiren, P. Suganthan, and Q.K. Pan An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem Applied Mathematics and Computation 215 2010 3356 3368
31. J. Yang, X. Shi, M. Marchese, and Y. Liang An ant colony optimization method for generalized tsp problem Progress in Natural Science 18 2008 1417 1422