¶óÆæÆ®¦¢Ä«Æä¦¢ºí·Î±×¦¢´õº¸±â
¾ÆÄ«µ¥¹Ì Ȩ ¸í»çƯ°­ ´ëÇבּ¸½Ç޹æ Á¶°æ½Ç¹« µ¿¿µ»ó°­ÀÇ Çѱ¹ÀÇ ÀüÅëÁ¤¿ø ÇÐȸº° ³í¹®
ÇÐȸº° ³í¹®

Çѱ¹°Ç¼³°ü¸®ÇÐȸ
Çѱ¹°ÇÃà½Ã°øÇÐȸ
Çѱ¹µµ·ÎÇÐȸ
Çѱ¹»ý¹°È¯°æÁ¶ÀýÇÐȸ
Çѱ¹»ýÅÂÇÐȸ
Çѱ¹¼öÀÚ¿øÇÐȸ
Çѱ¹½Ä¹°ÇÐȸ
Çѱ¹½Ç³»µðÀÚÀÎÇÐȸ
Çѱ¹ÀÚ¿ø½Ä¹°ÇÐȸ
Çѱ¹ÀܵðÇÐȸ
Çѱ¹Á¶°æÇÐȸ
Çѱ¹Áö¹Ý°øÇÐȸ
Çѱ¹ÇÏõȣ¼öÇÐȸ
Çѱ¹È¯°æ»ý¹°ÇÐȸ
Çѱ¹È¯°æ»ýÅÂÇÐȸ

Çѱ¹¼öÀÚ¿øÇÐȸ / v.28, no.2, 1995³â, pp.169-180
Ãß°èÇÐÀû ÃÖÀûÈ­¹æ¹ý¿¡ ÀÇÇÑ ±âÁ¸°ü¼ö·Î½Ã½ºÅÛÀÇ º´¿­°ü·Î È®Àå
( Stochastic Optimization Approach for Parallel Expansion of the Existing Water Distribution Systems )
¾ÈÅÂÁø;ÃÖ°è¿î;¹ÚÁ¤ÀÀ; ³ó¾îÃÌÁøÈï°ø»ç, ³ó¾îÃÌ¿¬±¸¿ø;ÀÎõ´ëÇб³, Åä¸ñ°øÇаú; ¼­¿ï»ê¾÷´ëÇб³, Åä¸ñ°øÇаú;
 
ÃÊ ·Ï
°ü¸Á»ó¹è°ü(Looped networks)½Ã½ºÅÛ¿¡¼­ °ü¼ö·Î½Ã½ºÅÛÀÇ Àüüºñ¿ëÀº Æóȸ·ÎÀ¯·®(Loop flows)¿¡ µû¶ó ¿µÇâÀ» ¹Þ´Â´Ù. µû¶ó¼­ °ü¸Á»ó¹è°üÀÇ ÃÖÀû¼³°è¸¦ À§ÇÑ ¼öÇÐÀû¸ðÇüÀ» Ãß°èÇÐÀû ÃÖÀûÈ­¹æ¹ý¿¡ Àû¿ëÇϱâ À§ÇÏ¿© Æóȸ·ÎÀ¯·®ÀÇ ¼·µ¿(Perturbations)À¸·Î Àüüºñ¿ëÀÌ º¯ÇÏ°Ô ÇÏ¿´´Ù. °ü¸Á»ó ¹è°ü¹®Á¦ÀÇ ºÐ¼®°¡´É¿µ¿ªÀº ¼ö¸¹Àº ±¹ÁöÇØ(Local optimum)¸¦ °®´Â ºñº¼·Ï(Nonconvex)À̹ǷΠºÐ¼®°¡´É¿µ¿ªÀÇ È¿À²ÀûÀÎ ½É»ç¸¦ À§ÇÏ¿© ¼öÁ¤Ãß°èÇÐÀû ½É»ç¹æ¹ýÀ» Á¦¾ÈÇÏ¿´À¸¸ç ÀÌ ¹æ¹ýÀº ±¹ºÎ½É»ç´Ü°è(Global search phase)¿Í ±¹Áö½É»ç´Ü°è(Local search phase)·Î ±¸¼ºµÇ¾î ÀÖ´Ù. ±¹ºÎŽ»ç¿¡¼­´Â Á¡Â÷ÀûÀ¸·Î ±¹ÁöÇØ¸¦ ÁõÁø½ÃŰ¸ç ±¹ÁöŽ»ç¿¡¼­´Â ±¹ºÎŽ»ç´Ü°è¿¡¼­ ±³Âø»óÅ¿¡ ÀÖ´Â ±¹ÁöÇØ·Î ºÎÅÍ ¹þ¾î³ª°Ô Çϰųª ÃÖÁ¾±¹ÁöÇØ¸¦ ÁõÁø½ÃŲ´Ù. Á¦¾ÈÇÑ ¹æ¹ýÀÇ È¿À²¼ºÀ» °ËÁ¤Çϱâ À§ÇÏ¿© Âü°í¹®Çå¿¡ ÀÖ´Â ±âÁ¸°ü¼ö·Î½Ã½ºÅÛÀÇ º´¿­°ü·Î(Parallel pipe line) È®Àå¹®Á¦¸¦ Ç¥º»À¸·Î äÅÃÇÏ¿© Á¦¾ÈÇÑ ¹æ¹ýÀ» Àû¿ëÇÑ °á°ú ¸ÕÀú ¹ßÇ¥µÈ ¿¬±¸ÀÚµéÀÇ ºñ¿ëº¸´Ù ÀûÀº ºñ¿ëÀ¸·Î ¼³°èÇÒ ¼ö ÀÖ¾ú´Ù.
The cost of a looped pipe network is affected by a set of loop flows. The mathematical model for optimizing the looped pipe network is expressed in the optimal set of loop flows to apply to a stochastic optimization method. Because the feasible region of the looped pipe network problem is nonconvex with multiple local optima, the Modified Stochastic Probing Method is suggested to efficiently search the feasible region. The method consists of two phase: i) a global search phase(the stochastic probing method) and ii) a local search phase(the nearest neighbor method). While the global search sequentially improves a local minimum, the local search escapes out of a local minimum trapped in the global search phase and also refines a final solution. In order to test the method, a standard test problem from the literature is considered for the optimal design of the paralled expansion of an existing network. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.
 
Ű¿öµå
 
Çѱ¹¼öÀÚ¿øÇÐȸÁö / v.28, no.2, 1995³â, pp.169-180
Çѱ¹¼öÀÚ¿øÇÐȸ
ISSN : 1738-9488
UCI : G100:I100-KOI(KISTI1.1003/JNL.JAKO199511920095571)
¾ð¾î : ¿µ¾î
³í¹® Á¦°ø : KISTI Çѱ¹°úÇбâ¼úÁ¤º¸¿¬±¸¿ø
¸ñ·Ïº¸±â
ȸ»ç¼Ò°³ ±¤°í¾È³» ÀÌ¿ë¾à°ü °³ÀÎÁ¤º¸Ãë±Þ¹æÄ§ Ã¥ÀÓÀÇ ÇѰè¿Í ¹ýÀû°íÁö À̸ÞÀÏÁÖ¼Ò ¹«´Ü¼öÁý °ÅºÎ °í°´¼¾ÅÍ
   

ÇÏÀ§¹è³ÊÀ̵¿