arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.06801eess.SYcs.SIcs.SY
收藏

基于强化学习的网约车系统多目标车辆再平衡

Multi-Objective Vehicle Rebalancing for Ridehailing System using a Reinforcement Learning Approach

Yuntian Deng, Hao Chen, Shiping Shao, Jiacheng Tang, Jianzong Pi, Abhishek Gupta

摘要:

本文研究了需求不对称的大规模网约车系统的再平衡算法设计问题。我们提出的再平衡问题,在一个半马尔可夫决策问题(SMDP)的框架内,封闭队列的车辆服务静止,但不对称的需求,在一个大城市多个节点(代表街区)。我们假设乘客在每个节点排队,直到他们与车辆匹配。SMDP的目标是最小化乘客等待时间和总空车行驶里程的凸组合。由此产生的SMDP似乎是难以解决的再平衡策略的封闭形式的表达。因此,我们使用深度强化学习算法来确定SMDP的近似最优解。将训练的策略与其他众所周知的再平衡算法进行比较,这些算法旨在解决乘车问题的其他目标(例如最小化需求下降概率)。

英文摘要:

The problem of designing a rebalancing algorithm for a large-scale ridehailing system with asymmetric demand is considered here. We pose the rebalancing problem within a semi Markov decision problem (SMDP) framework with closed queues of vehicles serving stationary, but asymmetric demand, over a large city with multiple nodes (representing neighborhoods). We assume that the passengers queue up at every node until they are matched with a vehicle. The goal of the SMDP is to minimize a convex combination of the waiting time of the passengers and the total empty vehicle miles traveled. The resulting SMDP appears to be difficult to solve for closed-form expression for the rebalancing strategy. As a result, we use a deep reinforcement learning algorithm to determine the approximately optimal solution to the SMDP. The trained policy is compared with other well-known algorithms for rebalancing, which are designed to address other objectives (such as to minimize demand drop probability) for the ridehailing problem.

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

↑