A Dispatching and Routing Algorithm for Personal Rapid Transit by Considering Congestion

Abstract

-Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

Minimal Decision-based Online Dispatching of Personal Rapid Transits

“…PRT는 차량이 가벼워 에너지 효율이 높으며 전기 동력을 사 용하므로 대기오염 물질을 배출하지 않는다. 이와 같은 이유 로 현재 PRT는 친환경 대중교통수단으로 각광받고 있으며, 우 리나라를 비롯한 세계 여러 나라에서 도입되고 있다 (Han et al, 2015). 우리나라에서는 2018년부터 세종 신도시 일부에서 시범 운행될 예정이다 (Chungbuk Daily, 2017 (Theis, 2015) 는 경로계획을 구체적으로 세우지 않으며 계획수정 또한 필요 하지 않다.…”