arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1710.06331cs.DCcs.AIcs.CE
收藏

PRT网络中的分布式空车管理算法

Distributed algorithm for empty vehicles management in personal rapid transit (PRT) network

Institute of Computer Science, Warsaw University of Technology(华沙理工大学计算机科学研究所)

Wiktor B. Daszczuk, Jerzy Mieścicki, Waldemar Grabski

摘要:

提出了一种新的快速公交网络空车管理的启发式算法。该算法用于为等待的乘客提供空车,平衡网络内空车的分布,并为接近车站的车辆提供空的空间。这些任务中的每一个都涉及关于必须由所选择的空车辆从其实际位置到某个确定的目的地完成的行程的决策。这些决定是基于涉及一组因素和阈值的多参数函数。该算法的一个重要特点是,它不使用任何中央数据库的乘客输入(需求)和免费车辆的位置。相反,它是基于站点之间的本地数据交换:关于它们的状态和它们期望的车辆。因此,它似乎是为分布式实现量身定制的。该算法是统一的,这意味着相同的基本过程用于使用特定于任务的参数集的多个任务。

英文摘要:

In 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 task-specific set of parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑