mlsanityData to 7 Oct 2026

AdaPool: A Diurnal-Adaptive Fleet Management Framework using Model-Free Deep Reinforcement Learning and Change Point Detection

arXiv 2104.00203 ↗First posted 1 Apr 2021cs.AI cs.MAcited by 4

Not on the map. Why?

Abstract (arXiv)

This paper introduces an adaptive model-free deep reinforcement approach that can recognize and adapt to the diurnal patterns in the ride-sharing environment with car-pooling. Deep Reinforcement Learning (RL) suffers from catastrophic forgetting due to being agnostic to the timescale of changes in the distribution of experiences. Although RL algorithms are guaranteed to converge to optimal policies in Markov decision processes (MDPs), this only holds in the presence of static environments. However, this assumption is very restrictive. In many real-world problems like ride-sharing, traffic control, etc., we are dealing with highly dynamic environments, where RL methods yield only sub-optimal decisions. To mitigate this problem in highly dynamic environments, we (1) adopt an online Dirichlet change point detection (ODCP) algorithm to detect the changes in the distribution of experiences, (2) develop a Deep Q Network (DQN) agent that is capable of recognizing diurnal patterns and making informed dispatching decisions according to the changes in the underlying environment. Rather than fixing patterns by time of week, the proposed approach automatically detects that the MDP has changed, and uses the results of the new model. In addition to the adaptation logic in dispatching, this paper also proposes a dynamic, demand-aware vehicle-passenger matching and route planning framework that dynamically generates optimal routes for each vehicle based on online demand, vehicle capacities, and locations. Evaluation on New York City Taxi public dataset shows the effectiveness of our approach in improving the fleet utilization, where less than 50% of the fleet are utilized to serve the demand of up to 90% of the requests, while maximizing profits and minimizing idle times.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 12 of its 49 references that are in the map. First posted on arXiv 1 Apr 2021.

Builds on

12 of 49 references.

References · 12

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2016Learning without Forgettingcited by 2,465
  3. 2017Measuring Catastrophic Forgetting in Neural Networkscited by 359
  4. 2019DeepPool: Distributed Model-free Algorithm for Ride-sharing using Deep Reinforcement Learningcited by 54
  5. 2019Variational Regret Bounds for Reinforcement Learningcited by 32
  6. 2018MOVI: A Model-Free Approach to Dynamic Fleet Managementcited by 23
  7. 2020A Distributed Model-Free Ride-Sharing Approach for Joint Matching, Pricing, and Dispatching using Deep Reinforcement Learningcited by 17
  8. 2019A Distributed Model-Free Algorithm for Multi-hop Ride-sharing using Deep Reinforcement Learningcited by 11
  9. 2019Reinforcement Learning in Non-Stationary Environmentscited by 10
  10. 2019Learning and Planning for Time-Varying MDPs Using Maximum Likelihood Estimationcited by 10
  11. 2020FlexPool: A Distributed Model-Free Deep Reinforcement Learning Algorithm for Joint Passengers & Goods Transportationcited by 6
  12. 2020PassGoodPool: Joint Passengers and Goods Fleet Management with Reinforcement Learning aided Pricing, Matching, and Route Planningcited by 4

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 3.

4 papers.