Empty vehicles management may improve the average waiting time for vehicle delivery in the Personal Rapid Transit (PRT) network. In this study, original heuristic algorithm of empty vehicle management is presented. The algorithm is tested in several benchmark PRT structures under Feniks simulation environment. The results show that significant improvements of average waiting time may be achieved just because of the multi‐parameter analysis of the present network state alone rather than by the predictive use of forecasted demand. The algorithm does not use any central database of demand and location of free vehicles. Instead, it assumes the local exchange of data between stations on their state and expected vehicles. Therefore it seems well tailored to a distributed implementation.
Empty vehicles management as a method for reducing passenger waiting time in Personal Rapid Transit networks
IET Intelligent Transport Systems ; 9 , 3 ; 231-239
2015-04-01
9 pages
Article (Journal)
Electronic Resource
English
personal rapid transit networks , Feniks simulation environment , average waiting time improvement , electronic data interchange , railways , PRT network , multiparameter analysis , empty vehicles management , demand forecasting , heuristic algorithm , rapid transit systems , passenger waiting time reduction method , local data exchange , vehicle delivery
Reallocation of Empty Personal Rapid Transit Vehicles an Route
Online Contents | 2003
|Reallocation of Empty Personal Rapid Transit Vehicles en Route
Transportation Research Record | 2003
|Distributed algorithm for empty vehicles management in personal rapid transit (PRT) network
Online Contents | 2016
|Reallocation of Empty Personal Rapid Transit Vehicles en Route
British Library Conference Proceedings | 2003
|