CoopRide: Cooperate All Grids in City-Scale Ride-Hailing Dispatching with Multi-Agent Reinforcement Learning
Jingwei Wang, Qianyue Hao, Wenzhen Huang, Xiaochen Fan, Qin Zhang, Zhentao Tang, Bin Wang, Jianye Hao, Yong Li
Abstract
Ride-hailing services offer convenient travel options in urban transportation. To improve passengers' experience and platforms' revenue, plentiful studies use multi-agent reinforcement learning (MARL) for efficient order dispatching, controlling each grid with one agent to balance the supply-demand (drivers-orders) distribution. However, despite the critical role of cooperation among grids for efficient dispatching strategies, existing works neglect it or limit it within neighboring grids. There exist three key challenges in scaling the cooperation to the whole city: (1) cooperative strategies cause complex interactions among grids, making the grids' states coupled and complicating the information extraction from the states for decision-making; (2) cooperation among grids requires both within- and cross-grid dispatching, where the priorities of these two types of actions are difficult to balance; (3) the value of cooperation is not only heterogeneous over different pairs of grids, but also varies temporally, adding difficulty to dynamically determine the intensities of cooperation for each pair of grids and obtain the global cooperation rewards. In this paper, we propose the CoopRide framework to solve the above challenges. We model the interactions among agents with graphs and utilize graph neural network (GNN) for efficient information extraction. We uniformly encode both within- and cross-grid dispatching, enabling flexible choice of both types of actions in the embedding space. We also design to automatically learn the cooperation intensities among grids, thereby obtaining the cooperative rewards to drive the learning of global cooperation actions. We conduct experiments in three real-world datasets with millions of orders, and extensive results demonstrate the superior performance of CoopRide, outperforming the state-of-the-art baselines by up to 12.4%. Our source codes are available at https://github.com/tsinghua-fib-lab/CoopRide.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on3
- QPLEX: Duplex Dueling Multi-Agent Q-LearningJianhao Wang, Zhizhou Ren, Terry Liu, Yang Yu et al.ICLR 2021 · 595 citations
- Learning to Simulate Self-driven Particles System with Coordinated Policy OptimizationZhenghao Peng, Quanyi Li, Ka-Ming Hui, Chunxiao Liu et al.NeurIPS 2021 · 88 citations
- GAT-MF: Graph Attention Mean Field for Very Large Scale Multi-Agent Reinforcement LearningQianyue Hao, Wenzhen Huang, Tao Feng, Jian Yuan et al.KDD 2023 · 18 citations
Related papers
- Multi-Agent Reinforcement Learning for Urban Crowd Sensing with For-Hire VehiclesRong Ding, Zhaoxing Yang, Yifei Wei, Haiming Jin et al.INFOCOM 2021 · 39 citations
- Multi-Objective Order Dispatch for Urban Crowd Sensing with For-Hire VehiclesJiahui Sun, Haiming Jin, Rong Ding, Guiyun Fan et al.INFOCOM 2023 · 6 citations
- Rethinking Order Dispatching in Online Ride-Hailing PlatformsZhaoxing Yang, Haiming Jin, Guiyun Fan, Min Lu et al.KDD 2024 · 5 citations
- MARL-Based Pricing Strategy via Mutual Attention for MoD Systems with Ridesharing and RepositioningShuxin Ge, Xiaobo Zhou, Tie QiuINFOCOM 2025 · 3 citations
- When Recommender Systems Meet Fleet Management: Practical Study in Online Driver Repositioning SystemZhe Xu, Chang Men, Peng Li, Bicheng Jin et al.WWW 2020 · 36 citations
