|
|
|
Çѱ¹µµ·ÎÇÐȸ / v.13, no.1, 2011³â, pp.197-206
|
±³Åë¾àÀÚÀÇ ´ëÁß±³Åëȯ½ÂÀ» À§ÇÑ K°æ·Î ¾Ë°í¸®Áò Àû¿ë¼º ¿¬±¸
( Applicability of K-path Algorithm for the Transit Transfer of the Mobility Handicapped ) |
| ±èÀÀö;±èÅÂÈ£;ÃÖÀºÁø; ÀÎõ´ëÇб³ °Ç¼³È¯°æ°øÇÐ;ÀÎõ¹ßÀü¿¬±¸¿ø µµ½Ã±³Å뿬±¸½Ç;ÀÎõ´ëÇб³ Åä¸ñȯ°æ°øÇаú;
|
|
|
 |
|
| |
| ÃÊ ·Ï |
| Á¤ºÎ´Â ±³Åë¾àÀÚ¿¡°Ô À̵¿¼ºÀ» È®º¸ÇØ ´ëÁß±³Åë ÀÌ¿ëÀÇ ÇüÆò¼ºÀ» Á¦°øÇϱâ À§ÇØ ±³Åë¼ö´Ü°ú ½Ã¼³°ø±Þ À§ÁÖÀÇ °³¼±»ç¾÷¿¡ ÁÖ·ÂÇϰí ÀÖ´Ù. ±×·¯³ª ½Ã¼³À§ÁÖÀÇ °ø±Þ¸¸À¸·Î È¿°úÀûÀÎ ±³Åë¾àÀÚ À̵¿ÆíÀǼº ÁõÁøÀ» µµ¸ðÇϱ⿡´Â ¿ªºÎÁ·ÀÌ´Ù. ±×·¯¹Ç·Î º¸´Ù Àû±ØÀûÀΠȰ¼ºÈ ¹æ¾ÈÀÇ ÀÏȯÀ¸·Î, ±³Åë¾àÀÚ°¡ ´ëÁß±³ÅëÀ» ÀÌ¿ëÇϴµ¥ ÀÖ¾î¼ ±âÇÇÇÏ´Â ¿ä¼Ò¿Í ¼±È£ÇÏ´Â ¿ä¼Ò¸¦ ºÐ¼®ÇÏ¿© Çʿ信 ºÎÇÕÇÏ´Â °æ·ÎÁ¤º¸Á¦°ø¼ºñ½º°¡ ÇÊ¿äÇÏ´Ù. ÀÌ¿¡ º» ¿¬±¸¿¡¼´Â À¯ÀÔ¸µÅ©±â¹ÝÀÇ Àüü°æ·Î»èÁ¦¹æ¹ýÀ» ³×Æ®¿öÅ©¿¡ È®Àå Àû¿ëÇØº½À¸·Î½á ¸µÅ©(¼ö´Ü)ÅëÇà°æ·Î¸¦ ÃÖ¼ÒÅëÇà½Ã°£ ¼øÀ¸·Î Ž»öÇÏ´Â K°æ·ÎŽ»ö ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÏ¿© ±³Åë¾àÀÚÀÇ Æ¯¼ºÀ» ¹Ý¿µÇÑ °æ·ÎÁ¤º¸Á¦°ø¾Ë°í¸®Áò ¹× ±× Àû¿ë¼º Æò°¡¸¦ ½ÃµµÇÏ¿´´Ù. ÇØ´ç ¾Ë°í¸®Áò¿¡¼ ±³Åë¾àÀÚÀÇ Æ¯¼ºÀº ȯ½Â¼Ó¼ºÀ¸·Î ¹Ý¿µÇÏ¿´À¸¸ç, ȯ½Â¼Ó¼ºÀº ±³Åë¾àÀÚÀÇ À¯Çü¿¡ µû¸¥ »óÀÌÇÑ È¯½Âµµº¸½Ã°£°ú ȯ½ÂÀ̵¿½Ã ÇÊ¿äÇÑ ÆíÀǽü³ÀÇ À¯¹«¿Í ¼±È£ÇÏ´Â ½Ã¼³¿¡ µû¸¥ °¡ÁßÄ¡¸¦ µÒÀ¸·Î½á Àû¿ëÇÏ¿´´Ù. ¶ÇÇÑ ÇØ´ç ¾Ë°í¸®Áò¿¡ ´ëÇÑ ½ÇÁ¦ ³×Æ®¿öÅ©¿¡¼ÀÇ Àû¿ë¼ºÀ» °ËÁõÇϱâ À§ÇØ ¼öµµ±ÇÀüö¸ÁÀ» ³ëµå¿Í ¸µÅ©ÀÇ ³×Æ®¿öÅ©·Î ±¸ÃàÇÏ¿© Àû¿ë¼ºÀ» Æò°¡ÇÏ¿´´Ù. Æò°¡°á°ú K°æ·ÎŽ»ö ¾Ë°í¸®ÁòÀÇ Àû¿ë¼ºÀÌ Å¸´çÇÑ °ÍÀ¸·Î ºÐ¼®µÇ¾úÀ¸¸ç ÇâÈÄ È®À强ÀÌ È®ÀεǾú´Ù. |
|
| The Korean government concentrates on supplying public transit facilities for the mobility handicapped. In other hands, increasing needs of transfer information when the mobility handicapped use transit facilities are substantial but not satisfactory as a whole. This study focuses on evaluating the applicability of developed K-path algorithm to provide user-customized route information that could make an active using of public transit while considering the mobility handicapped preferences. Developed algorithm reflects on requirements considering transfer attributes of the mobility handicapped. Trip attributes of the handicapped are addressed distinguished from handicapped types such as transfer walking time, transfer ratio, facility preferences and etc. This study examines the verification and application of the proposed algorithm that searches the least time K-paths by testing on actual subway networks in Seoul metropolitan areas. It is shown that the K-path algorithm is good enough to provide paths that meet the needs of the mobility handicapped and to be adoptable for the future expansion. |
| |
| Ű¿öµå |
| ±³Åë¾àÀÚ;ÅëÇàÆ¯¼º;ȯ½Â;K°æ·Î ¾Ë°í¸®Áò;°æ·Î»èÁ¦¹æ¹ý;the mobility handicapped;travel characteristic;transfer;K-path algorithm;path deletion method; |
| |
|
|
 |
|
Çѱ¹µµ·ÎÇÐȸ³í¹®Áý / v.13, no.1, 2011³â, pp.197-206
Çѱ¹µµ·ÎÇÐȸ
ISSN : 1738-7159
UCI : G100:I100-KOI(KISTI1.1003/JNL.JAKO201117148819917)
¾ð¾î : Çѱ¹¾î |
|
| ³í¹® Á¦°ø : KISTI Çѱ¹°úÇбâ¼úÁ¤º¸¿¬±¸¿ø |
|
|
|
|
|
|