Distributed algorithm for empty vehicles management in personal rapid transit (PRT) network
Wiktor B. Daszczuk , Jerzy Mieścicki , Waldemar Grabski
AbstractIn this paper, an original heuristic algorithm of empty vehicles management in personal rapid transit network is presented. The algorithm is used for the delivery of empty vehicles for waiting passengers, for balancing the distribution of empty vehicles within the network, and for providing an empty space for vehicles approaching a station. Each of these tasks involves a decision on the trip that has to be done by a selected empty vehicle from its actual location to some determined destination. The decisions are based on a multi-parameter function involving a set of factors and thresholds. An important feature of the algorithm is that it does not use any central database of passenger input (demand) and locations of free vehicles. Instead, it is based on the local exchange of data between stations: on their states and on the vehicles they expect. Therefore, it seems well-tailored for a distributed implementation. The algorithm is uniform, meaning that the same basic procedure is used for multiple tasks using a taskspecific set of parameters.
|Journal series||Journal of Advanced Transportation, ISSN 0197-6729|
|Publication size in sheets||1.05|
|Keywords in English||personal rapid transit; empty vehicles management; transport simulation; transportation|
|project||Development of new algorithms in the areas of software and computer architecture, artificial intelligence and information systems and computer graphics . Project leader: Rybiński Henryk,
, Phone: +48 22 234 7731, start date 18-05-2015, end date 30-11-2016, II/2015/DS/1, Completed
|Score|| = 30.0, 27-03-2017, ArticleFromJournal|
= 30.0, 27-03-2017, ArticleFromJournal
|Publication indicators||: 2016 = 1.813 (2) - 2016=1.977 (5)|
|Citation count*||8 (2018-02-16)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.