• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.28-34
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.77-88
• /
• 2006

The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.