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

基于镜像背压的封闭网络盲动态资源分配

Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure

Yash Kanoria, Pengyu Qian

摘要:

本文研究了一类封闭排队网络在一段时间内最大化收益的问题,该网络中的供应单元数量有限,且固定。需求是随机到达的,为需求单位(客户)提供服务会导致供应单位从客户的“原点”重新定位到“目的地”。关键的挑战是管理网络中的供应分配。我们考虑一般控制,包括客户进入控制,定价和分配。令人鼓舞的应用包括共享交通平台和代币系统。受镜像下降算法和网络控制反压策略的启发,我们引入了丰富的\emph{Mirror Backpressure}(MBP)控制策略。MBP策略简单实用,并且关键是不需要需求(客户)到达率的任何统计知识(这些速率允许随时间变化)。在温和的条件下,我们提出的MBP政策,可证明接近最优。具体来说,我们的策略相对于知道需求到达率的最优策略,最多损失每个客户的$O(\frac{K}{T}+\frac{1}{K} + \sqrt{ηK})$收益,其中$K$是供应单元的数量,$T$是时间范围内的客户总数,$η$是需求过程中每个客户到达的平均变化率。MBP的适应被发现在基于乘车数据的数值实验中表现良好。

英文摘要:

We study the problem of maximizing payoff generated over a period of time in a general class of closed queueing networks with a finite, fixed number of supply units which circulate in the system. Demand arrives stochastically, and serving a demand unit (customer) causes a supply unit to relocate from the ``origin'' to the ``destination'' of the customer. The key challenge is to manage the distribution of supply in the network. We consider general controls including customer entry control, pricing, and assignment. Motivating applications include shared transportation platforms and scrip systems. Inspired by the mirror descent algorithm for optimization and the backpressure policy for network control, we introduce a rich family of \emph{Mirror Backpressure} (MBP) control policies. The MBP policies are simple and practical, and crucially do not need any statistical knowledge of the demand (customer) arrival rates (these rates are permitted to vary in time). Under mild conditions, we propose MBP policies that are provably near optimal. Specifically, our policies lose at most $O(\frac{K}{T}+\frac{1}{K} + \sqrt{ηK})$ payoff per customer relative to the optimal policy that knows the demand arrival rates, where $K$ is the number of supply units, $T$ is the total number of customers over the time horizon, and $η$ is the demand process' average rate of change per customer arrival. An adaptation of MBP is found to perform well in numerical experiments based on data from ride-hailing.

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

↑