S-MINE Algorithm for the TSP


KIPS Transactions on Computer and Communication Systems, Vol. 18, No. 2, pp. 73-82, Apr. 2011
10.3745/KIPSTB.2011.18.2.73,   PDF Download:

Abstract

There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Hwang, I. Y. Weon, S. B. Ko and C. H. Lee, "S-MINE Algorithm for the TSP," KIPS Journal B (2001 ~ 2012) , vol. 18, no. 2, pp. 73-82, 2011. DOI: 10.3745/KIPSTB.2011.18.2.73.

[ACM Style]
Sook Hi Hwang, Il Yong Weon, Sung Bum Ko, and Chang Hoon Lee. 2011. S-MINE Algorithm for the TSP. KIPS Journal B (2001 ~ 2012) , 18, 2, (2011), 73-82. DOI: 10.3745/KIPSTB.2011.18.2.73.