arrow
Return

Adaptive Dynamic Programming for Multi-Driver Order Dispatching at Large-Scale

delete2024-04-01
delete2
PRE
AI
K
Kai Jiang
曹越 cover
曹越 (Yue Cao) *
H
Huan Zhou
X
Xiangyu Wu
Z
Zhao Zhang
刘智 cover
刘智 (Zhi Liu)
DOI:10.1109/TCCN.2023.3327578delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Dispatching
Vehicle dynamics
Decision making
Optimization
Adaptation models
Uncertainty
Real-time systems
Order dispatching
adaptive dynamic programming
graph theory
Markov decision process

Journal

I
IEEE Transactions on Cognitive Communications and Networking
IF:
7
Papers:
1.6K
Citations:
5.5K

Organization

B
Beihang University
Scholars:
5.2W
Papers: 4.1W
Citations: 37
T
Temple University
Scholars:
1.1W
Papers: 8.8K
Citations: 1.9W
N
Northwestern Polytechnical University
Scholars:
4.6W
Papers: 3.7W
Citations: 5.3W
P
pennsylvania commonwealth system of higher education (pcshe)
Scholars:
12.9W
Papers: 11.7W
Citations: 177
W
wuhan university
Scholars:
8.1W
Papers: 5.8W
Citations: 70
researcher View more organizations
Cited Papers

Cited Papers

Prise en charge du risque hémostatique au cours des actes de radiologie interventionnelle
err2011-07-01
err0
PREAI
errJ. Potet; G. Weber-Donat; A. Thome; L. Valbousquet; E. Peroux; J. Konopacki; J. Baccialone; C.-A. Teriitehau
errShare
errSave
Federated Deep Reinforcement Learning for Traffic Monitoring in SDN-Based IoT Networks
err2021-12-01
err47
PREAI
errTri Gia Nguyen; Phan, Trung, V; Dinh Thai Hoang; Nguyen, Tu N.; So-In, Chakchai
errShare
errSave
Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests
err2019-02-01
err115
PREAI
errUlmer, Marlin W.; Goodson, Justin C.; Mattfeld, Dirk C.; Hennig, Marco
errShare
errSave
errShare
errSave
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
err2021-01-01
err3
errOAAI
errCrisan, Gloria Cerasela; Nechita, Elena; Simian, Dana
errShare
errSave
researcher View more