Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¿ë·® Á¦¾àÀÌ ÀÖ´Â ¼³ºñ ¹èÄ¡ ¹®Á¦¿¡ ´ëÇÑ ÈÞ¸®½ºÆ½ ¹× ¼±Çü°èȹ¹ý ¿ÏÈÀÇ °è»êÀû ºÐ¼® |
¿µ¹®Á¦¸ñ(English Title) |
Computational Analysis of Heuristics and Linear Programming Relaxations for Capacitated Facility Location |
ÀúÀÚ(Author) |
À̽¹Î
¾ÈÇüÂù
Seungmin Lee
Hyung-Chan An
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 48 NO. 04 PP. 0377 ~ 0390 (2021. 04) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ¿ë·® Á¦¾àÀÌ ÀÖ´Â ¼³ºñ ¹èÄ¡ ¹®Á¦(CFL)¿¡ ´ëÇÑ ±Ù»ç ¾Ë°í¸®ÁòÀ» ½Ç¿ëÀûÀ¸·Î º¯ÇüÇÑ »õ·Î¿î ÈÞ¸®½ºÆ½°ú ÀÌ°ÍÀÌ ÀÌ¿ëÇÏ´Â ¼±Çü°èȹ¹ý ¿Ïȸ¦ ½ÇÇèÀûÀ¸·Î Æò°¡¡¤ºÐ¼®ÇÑ´Ù. CFLÀº ÄÄÇ»ÅÍ °úÇÐ ¹× ¿î¿ë°úÇÐ ºÐ¾ß¿¡¼ ³Î¸® ¿¬±¸µÇ¾î¿Â ¹®Á¦À̳ª, ¼±Çü°èȹ¹ý¿¡ ±â¹ÝÇÑ »ó¼ö ÀÎÀÚ ±Ù»ç ¾Ë°í¸®ÁòÀº ÃÖ±Ù¿¡¾ß ¹ß°ßµÇ¾ú´Ù. ±×·¯³ª, ±âÁ¸ÀÇ ´À½¼ÇÑ ºÐ¼®À¸·Î´Â ÇØ´ç ¼±Çü°èȹ¹ý ¿ÏÈÀÇ Á¤¼ö°ÝÂ÷(integrality gap)¸¦ 288·Î »óÇÑÇÒ ¼ö ÀÖÀ» »ÓÀ̾ú´Ù. º» ³í¹®Àº ½ÇÁ¦ µ¥ÀÌÅͼ¿¡¼ÀÇ ±Ù»çÀ²°ú Á¤¼ö°ÝÂ÷¸¦ ÃøÁ¤ÇÔÀ¸·Î½á, ÈÞ¸®½ºÆ½ ¹× ¿©±â¿¡ »ç¿ëµÈ ¼±Çü°èȹÀÇ ½ÇÁúÀûÀÎ ¼º´ÉÀ» Æò°¡ÇÔ°ú µ¿½Ã¿¡ ÀÌ·ÐÀûÀÎ ÃßÃøÀ» À§ÇÑ ±Ù°Å¸¦ ¸¶·ÃÇÏ°íÀÚ ÇÑ´Ù. ±âÁ¸ÀÇ ±Ù»ç ¾Ë°í¸®ÁòÀº ÀÌ·ÐÀûÀÎ °ÍÀÌ¾î¼ ½ÇÁ¦·Î ±¸ÇöÇϱ⿡´Â Áö³ªÄ¡°Ô ´À¸° ¼öÇà ½Ã°£À» °®´Â´Ù. º» ³í¹®¿¡¼´Â ¼öÄ¡Àû ¾ÈÁ¤¼ºÀ» ÇØÄ¡Áö ¾ÊÀ¸¸é¼µµ ¼öÇà½Ã°£À» °³¼±ÇÒ ¼ö ÀÖ´Â ÈÞ¸®½ºÆ½µéÀ» Á¦¾ÈÇÏ°í ¾Ë°í¸®ÁòÀÇ ÆĶó¹ÌÅ͸¦ ½ÇÇèÀûÀ¸·Î ÃÖÀûÈÇÏ¿© °í¼ÓÀÇ ±¸ÇöÀ» ¾ò´Â´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In this paper, we experimentally evaluate new practical heuristics based on approximation algorithms for capacitated facility location (CFL) and the linear programming (LP) relaxations used by them. Although CFL has been extensively studied in the fields of computer science and operations research, an LP-based constant-factor approximation algorithm was only discovered recently. However, the existing analysis only gives a loose upper bound of 288 on the integrality gap of the LP relaxation. By measuring the approximation ratio and the integrality gap in a concrete dataset, this paper aims at measuring the practical performance of the heuristics and the relaxation, which would also provide evidence for further theoretical exploration. Due to the highly theoretical nature of the existing approximation algorithm, its naive implementation is practically inefficient. In this paper, we propose heuristics that improve the running time without affecting the numerical stability and experimentally optimize the algorithms¡¯ parameters, thus obtaining an efficient implementation.
|
Å°¿öµå(Keyword) |
¿ë·® Á¦¾àÀÌ ÀÖ´Â ¼³ºñ ¹èÄ¡ ¹®Á¦
Á¶ÇÕ ÃÖÀûÈ ¾Ë°í¸®Áò
¼±Çü°èȹ¹ý
ÈÞ¸®½ºÆ½
capacitated facility location
combinatorial optimization algorithms
linear programming
heuristics
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|