• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document : 7 / 19 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) µµ¸ÞÀÎ ¿ÂÅç·ÎÁö¸¦ ÀÌ¿ëÇÑ °Ë»ö ½Ã½ºÅÛ ¼³°è ¹× ±¸Çö
¿µ¹®Á¦¸ñ(English Title) Design and Implementation of Search System Using Domain Ontology
ÀúÀÚ(Author) °­·¡±¸   Á¤Ã¤¿µ   Rae-Goo Kang   Chai-Yeoung Jung  
¿ø¹®¼ö·Ïó(Citation) VOL 11 NO. 07 PP. 1318 ~ 1324 (2007. 07)
Çѱ۳»¿ë
(Korean Abstract)
Áö±Ý±îÁöÀÇ »óÇ° °Ë»ö ¹æ¹ýÀ¸·Î´Â ã°íÀÚ ÇÏ´Â Á¤º¸¸¦ °Ë»öÇÒ ¶§ ÁÖ·Î ´Ü¾îÀÇ ºóµµ¼ö³ª ¾îÈÖ Á¤º¸¸¦ ÀÌ¿ëÇÏ´Â Å°¿öµå ±â¹ÝÀÇ °Ë»öÀÌ ÁÖ·Î ¾²ÀÌ°í ÀÖ¾ú´Ù. Å°¿öµå ±â¹ÝÀÇ °Ë»ö¿¡¼­´Â »ç¿ëÀÚÀÇ ÁúÀÇ¿Í °ü·ÃÀÌ ¾ø´Â ¹®¼­µé±îÁöµµ °°Àº °á°ú·Î ³ªÅ¸³» ÁÖ°í ÀÌ·Î ÀÎÇØ »ç¿ëÀÚ´Â Á¦½ÃµÈ °á°ú¸¦ ÇÑ ¹ø ´õ ¼öµ¿ÀûÀ¸·Î °Ë»öÇؾßÇÏ´Â ºÎ´ãÀ» ¾Ê°Ô µÇ¾ú´Ù. ÀÌ·¯ÇÑ ¹®Á¦Á¡À» ÇØ°áÇϱâ À§ÇØ ¿ÂÅç·ÎÁö°¡ ´ëµÎµÇ¾ú´Ù. º» ³í¹®¿¡¼­´Â ¿ÂÅç·ÎÁö¸¦ ÀÌ¿ëÇÑ »óÇ° °Ë»ö ½Ã½ºÅÛÀ» Á÷Á¢ ±¸ÃàÇÏ¿© ºÐ·ùº° °Ë»öÀ» ÅëÇØ ¾ó¸¶³ª Á¤È®ÇÑ °Ë»öÀ» ÇÏ´ÂÁö ½ÇÇèÇÏ¿´´Ù. ½ÇÇèÀ» À§ÇØ Àü±¹ÀûÀ¸·Î On/Off¶óÀÎ ÇÒÀÎÁ¡À» ¿î¿µ Áß¿¡ ÀÖ´Â AÇÒÀÎÁ¡ÀÇ »óÇ° µ¥ÀÌÅÍ ¾à 40,00¿©°³¸¦ µ¥ÀÌÅͺ£À̽º·Î ±¸ÃàÇÏ¿´°í User Interface °³¹ßȯ°æÀº JSP¿Í PowerBuilder9.0À» »ç¿ëÇÏ¿© °Ë»ö ½Ã½ºÅÛÀ» °³¹ßÇÏ¿© ½ÇÇèÇÏ¿´´Ù. ±× °á°ú º» ³í¹®¿¡¼­ Á¦¾ÈÇÏ°í ¼³°èÇÑ »óÇ° µµ¸ÞÀÎ ¿ÂÅç·ÎÁö¸¦ ÀÌ¿ëÇÑ °Ë»ö ¹æ¹ýÀÌ ±âÁ¸ÀÇ Å°¿öµå ±â¹ÝÀÇ °Ë»ö ¹æ¹ýº¸´Ù ¿ì¼öÇÑ °á°ú¸¦ ³ªÅ¸³»°í ÀÖÀ½À» ÀÔÁõÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
TSP(Traveling Salesman Problem) is a problem finding out the shortest distance out of many courses where given cities of the number of N, one starts a certain city and turns back to a starting city, visiting city only once. As the number of cities having visited increases, the calculation rate increases geometrically. This problem makes TSP classified in NP-Hard Problem and genetic algorithm is used representatively. To obtain a better result in TSP, various operators have been developed and studied. This paper suggests new method of population initialization and of sequential transformation, and. then proves the improvement of capability by comparing them with existing methods.
Å°¿öµå(Keyword) Ontology   Áö´ÉÇü °Ë»ö   ºÐ·ùº° °Ë»ö   »óÇ° µµ¸ÞÀΠ 
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå