ÇѱÛÁ¦¸ñ(Korean Title) |
TSP °æ·ÎŽ»öÀ» À§ÇÑ S-MINE ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
S-MINE Algorithm for the TSP |
ÀúÀÚ(Author) |
Ȳ¼÷Èñ
¿øÀÏ¿ë
°í¼º¹ü
ÀÌâÈÆ
SOOK-HI HWANG
IL-YONG WEON
SUNG-BUM KO
CHANG-HOON LEE
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 18-B NO. 02 PP. 0073 ~ 0082 (2011. 04) |
Çѱ۳»¿ë (Korean Abstract) |
¸ÞŸ ÈÞ¸®½ºÆ½ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇØ TSP (Traveling Salesman Problem) ¹®Á¦¸¦ Ç®°íÀÚ ÇÏ´Â ¸¹Àº ½Ãµµ°¡ ÀÌ·ç¾îÁö°í ÀÖ´Ù. TSP ¹®Á¦´Â ´ëÇ¥ÀûÀÎ NP_Hard ¹®Á¦·Î Ž»ö ¾Ë°í¸®ÁòÀ̳ª ÃÖÀûÈ ¾Ë°í¸®ÁòÀ» ½ÇÇèÇϴµ¥ ¸¹ÀÌ »ç¿ëµÇ°í ÀÖÀ¸¸ç, º¹ÀâÇÑ »çȸÀÇ ¸¹Àº ¹®Á¦µéÀÇ Ç¥ÁØ ¸ðµ¨·Î Á¦½ÃµÇ°í ÀÖ´Ù. º» ³í¹®¿¡¼´Â 2009³â Á¦¾ÈµÈ MINE ¾Ë°í¸®ÁòÀ» TSP ¿¡ Àû¿ë½ÃÄÑ ¸ÞŸ ÈÞ¸®½ºÆ½ ¾Ë°í¸®ÁòÀ¸·Î¼ÀÇ Å½»ö¼º´ÉÀ» ¾Ë¾Æº¸°íÀÚ ÇÏ¿´´Ù. ÀÌ¿¡ S-MINE (Search – MINE) ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÏ¿´À¸¸ç, TSP ¿¡ Àû¿ëÇÏ¿© ±× °á°ú¸¦ °íÂûÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English 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.
|
Å°¿öµå(Keyword) |
¸ÞŸ ÈÞ¸®½ºÆ½ ¾Ë°í¸®Áò
Ž»ö ¾Ë°í¸®Áò
¼øȸÆǸſø¹®Á¦
Meta Heuristic Algorithm
Search Algorithm
Traveling Salesman Problem
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|