Browse > Article
http://dx.doi.org/10.9708/jksci/2012.17.10.155

The Extended k-opt Algorithm for Traveling Salesman Problem  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
Journal of the Korea Society of Computer and Information / v.17, no.10, 2012 , pp. 155-165 More about this Journal
Abstract
This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.
Keywords
Traveling Salesman Problem; Exhaustive Search Method; Edge Exchange Method; Heuristic Method; Min-Min and Min-Max Search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L. Stougie, "2P350: Optimaliseringsmethoden, "http://www.win.tue.nl/-leen/OW/2P350/We ek8/week8.pdf, College Wordt ggeven op vinjdagmiddag, 2001.
2 W. Cook, "The Traveling Salesman Problem," The School of Industrial and Systems Engineering, Gatorgia Tech, 2008.
3 A. Battese, "Millennium Problems," Clay Mathematics Institute, http://www.claymath.org/millennium/, 2008.
4 J. Kratica and S. Radojevi, "One Improvement to Nearest Neighbor Method for Solving Traveling Salesman Problem," LIRA 95 Proceedings, pp. 77-82, Novi Sad, 1996.
5 D. S. Johnson and L. A. McGeoch, "The Traveling Salesman Problem: A Case Study in Local Optimization," Department of Mathematics and Computer Science, Amherst College, 1995.
6 H. D. Beale, "Neural Network Design," PWS Publishing Company, 1996.
7 B. Chandra, H. Karloff, and C. Tovey, "New Results on the Old k-Opt Algorithm for the TSP," SIAM Journal on Computing, Vol. 28, No. 6, pp. 1998-2029, 1999.   DOI
8 K. Helsagaun, "General k-Opt Submoves for the Lin-Kernighan TSP Heuristic," Math. Prog. Comp., Vol. 1, pp. 119-163, 2009.   DOI
9 P. S. Tsilingiris, "A Multi-stage Decision-Support Methodology for The Optimization-based Linear-network Design," Degree of Diploma in Naval Architecture and Marine Engineering at the School of Naval Architecture and Marine Engineering of the National Technical University of Athens, 2005.
10 Wikipedia, "Travelling Salesman Problem," http://en.wikipedia.org/wiki/Travelling_Salesm an_Problem, Wikimedia Foundation Inc., 2012.
11 A. Likas and V. T. Paschos, "A Note on a New Greedy-solution Representation and a New Greedy Parallelizable Heuristic for the Traveling Salesman Problem," Chaos, Solitons and Fractals, Vol. 13, pp. 71-78, 2002.   DOI   ScienceOn
12 A. Schrijver, "On the History of Combinatorial Optimization (till 1960)," in Handbook of Discrete Optimization'' (K. Aardal, G.L. Nemhauser, R. Weismantel, eds.), Elsevier, Amsterdam, pp. 1-68, 2005,
13 J. Denzinger, D. Fuchs, M. Fuchs, and M. Kronenburg, "The Teamwork Method for Knowledge -Based Distributed Search: The travelling salesman problem," University of Kaiserslautern, 2008.
14 J. Pleines, "ZIP-Methode: ein Kombinatorischer Ansatz zur Optimalen Lősung Allgemeiner Traveling- Salesman-Problem (TSP)," Konnen bekannte Losungen nicht nur auf Gesamtgrphen sondern auf Teilgraphen angewandt werden, so bringt die ZIP-Methode den entscheidenden Quantensprung der rechentechnischen Vereinfachung, 2006.
15 S. Vempala, "18.433 Combinatorial Optimization: NP -completeness," http://ocw.mit.edu/NR/rdonlyres/ Mathematics/18-433Fall2003/778D00DB-F21C -486C-ABD8-F5E7F5C929C3/O/I20.pdf, 2003.
16 E. Charniak and M. Herlihy, "CSC 751 Computational Complexity: Local Search Heuristics," Department od Computer Science, Brown University, 2008.