.png){kind=icon}
返回
Adaptive Dynamic Programming for Multi-Driver Order Dispatching at Large-Scale
.png){kind=icon}
PRE
AI
DOI：10.1109/TCCN.2023.3327578.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Order dispatching, which involves assigning orders to demand-matched vehicles, is an underlying issue for ride-sharing services. Previous works on order dispatching are often quasi-static and myopic 1, thus performing unsatisfactorily in the ride-sharing setting. To address these challenges, recent studies attempt to augment large-scale decision optimization from a data-driven perspective. Among them, Adaptive Dynamic Programming (ADP) has exhibited its particular potential for sequential decision-making with a long-term objective under uncertainty. In this paper, we investigate order dispatching with consideration of vehicle repositioning by exploiting ADP. We first formulate the optimization problem as a Markov Decision Process (MDP), where the dispatching decision is determined by a series of agents (the decision-making entity) under the time sequence model. Then, based on the generated available trips by a graph theory-based method, an ADP-based Multi-driver Order Dispatching method (AMOD) is proposed. In particular, AMOD reconstructs the Bellman update process around the post-decision states to avoid approximating the embedded expectations explicitly. As for non-linear function approximation, it converts the value function into a linear combination by a quadratic decomposition, and estimates the decomposed value function with neural network-based parameter approximation. In addition, vehicle repositioning is performed along with each batch dispatching to balance ride supply across geographic dimensions. Extensive simulations are conducted based on real-world data. Especially, AMOD can achieve 34.6% improvement at maximum and 15.9% on average compared with other baselines, when the capacity constraint is 10.
Keyword:
Dispatching
Vehicle dynamics
Decision making
Optimization
Adaptation models
Uncertainty
Real-time systems
Order dispatching
adaptive dynamic programming
graph theory
Markov decision process
期刊
I
IF:
7
论文数:
1.6K
被引数:
5.5K
机构
引用论文
.png){kind=icon}
Federated Deep Reinforcement Learning for Traffic Monitoring in SDN-Based IoT Networks基于SDN的物联网网络流量监控的联合深度强化学习
PREAI
分享收藏分享收藏
Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests具有随机请求的动态车辆路径的离线在线近似动态规划
PREAI
分享收藏OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networksOSMnx: 获取、构建、分析和可视化复杂街道网络的新方法
OAAI
OAAI分享收藏
查看更多内容