arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.02265math.OC
收藏

包含行程时间的网约车系统动态定价与调度控制的排队模型

A Queueing Model of Dynamic Pricing and Dispatch Control for Ride-Hailing Systems Incorporating Travel Times

The University of Chicago Booth School of Business(芝加哥大学布斯商学院)

Amir Anastasios Alwan, Baris Ata, Yuwei Zhou

AI总结:

针对网约车应用,提出一个包含行程时间的排队网络模型,通过重流量分析和贝尔曼方程求解,给出动态定价与调度控制策略,并仿真验证有效性。

摘要:

系统管理者在受网约车应用启发的排队网络模型中做出动态定价和调度控制决策。该模型的一个新颖特征是它包含了行程时间。不幸的是,这使得问题的精确分析变得棘手。因此,我们在重流量条件下研究该问题。在完全资源池化和共同行程分布的假设下,我们通过分析相应的贝尔曼方程,以闭式形式解决了该问题。利用这一解,我们为排队系统提出了一种策略,并在仿真研究中展示了其有效性。

英文摘要:

A system manager makes dynamic pricing and dispatch control decisions in a queueing network model motivated by ride-hailing applications. A novel feature of the model is that it incorporates travel times. Unfortunately, this renders the exact analysis of the problem intractable. Therefore, we study this problem in the heavy traffic regime. Under the assumptions of complete resource pooling and common travel distribution, we solve the problem in closed form by analyzing the corresponding Bellman equation. Using this solution, we propose a policy for the queueing system and illustrate its effectiveness in a simulation study.

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

↑