휠체어 사용자의 환승 난이도와 혼잡도를 고려한 지하철 경로 최적화

초록

This study proposes an optimal route search algorithm for wheelchair users in the Seoul subway system. The algorithm aims to enhance mobility and improve the welfare of wheelchair users by considering transfer difficulty, congestion, and real-time train schedules. To achieve this, data on the subway network, train schedules, transfer paths, transfer difficulty, and congestion were collected and processed. The algorithm is based on Yen’s K-shortest path search algorithm and incorporates user-specific constraints and preferences. The effectiveness of the proposed system was validated through four case studies, comparing route recommendations for wheelchair users and non-disabled individuals. The results revealed significant differences in route rankings and travel times between the two groups, underscoring the necessity of considering transfer difficulty and congestion for wheelchair users. This study highlights the importance of tailored route recommendation services for people with disabilities and suggests future research directions, such as integration with other modes of public transportation, refinement of data to reflect various wheelchair types and user characteristics, and expansion to other transportation-vulnerable populations. The proposed algorithm contributes to improving the travel experience of wheelchair users and provides valuable insights for developing inclusive transportation policies and services.

키워드