S-MINE Algorithm for the TSP 


Vol. 18,  No. 2, pp. 73-82, Apr.  2011
10.3745/KIPSTB.2011.18.2.73


PDF
  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
  Cite this article

[IEEE Style]

S. H. Hwang, I. Y. Weon, S. B. Ko, C. H. Lee, "S-MINE Algorithm for the TSP," The KIPS Transactions:PartB , 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. The KIPS Transactions:PartB , 18, 2, (2011), 73-82. DOI: 10.3745/KIPSTB.2011.18.2.73.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals