arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.06156cs.CY
收藏

有多少城市交通正在寻找停车位?将路边停车场模拟为有限容量停车场网络

How Much Urban Traffic is Searching for Parking? Simulating Curbside Parking as a Network of Finite Capacity Queues

Chase Dowling, Tanner Fiez, Lillian Ratliff, Baosen Zhang

摘要:

随着由数字停车计时器收集的交易数据的可用性的增加,付费路边停车可以有利地被建模为相互依赖的队列的网络。在这篇文章中,我们介绍的方法来分析一类特殊的网络的有限容量的队列,任务从一个外源到达,加入队列,如果有一个可用的服务器或被拒绝,并移动到另一个队列中搜索服务,根据网络拓扑结构。这样的网络可以用于建模路边停车,因为网络中的队列执行相同的功能,并且搜索可用服务器的驾驶员处于组合约束下,并且操纵不是瞬时的。此外,我们提供了一个激励的例子,这种网络的有限容量队列的背景下,司机寻找停车在附近的贝尔敦在西雅图,华盛顿州,美国。最后,由于静态分布的这种网络模型停车是很难令人满意的特点,我们还介绍了一个模拟工具的目的是测试的假设,估计有趣的性能指标。我们的研究结果表明,马尔可夫松弛的问题时,解决的平均速率指标是可比的确定性服务时间反映司机的倾向,停车的最大允许时间。

英文摘要:

With the increasing availability of transaction data collected by digital parking meters, paid curbside parking can be advantageously modeled as a network of interdependent queues. In this article we introduce methods for analyzing a special class of networks of finite capacity queues, where tasks arrive from an exogenous source, join the queue if there is an available server or are rejected and move to another queue in search of service according to the network topology. Such networks can be useful for modeling curbside parking since queues in the network perform the same function and drivers searching for an available server are under combinatorial constraints and jockeying is not instantaneous. Further, we provide a motivating example for such networks of finite capacity queues in the context of drivers searching for parking in the neighborhood of Belltown in Seattle, Washington, USA. Lastly, since the stationary distribution of such networks used to model parking are difficult to satisfactorily characterize, we also introduce a simulation tool for the purpose of testing the assumptions made to estimate interesting performance metrics. Our results suggest that a Markovian relaxation of the problem when solving for the mean rate metrics is comparable to deterministic service times reflective of a driver's tendency to park for the maximum allowable time.

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

↑