Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
From MaRDI portal
Publication:2178143
DOI10.1016/j.ejor.2020.01.033zbMath1441.90014arXiv1810.08124OpenAlexW3002585184WikidataQ126304798 ScholiaQ126304798MaRDI QIDQ2178143
Warren B. Powell, Lina Al-Kanj, Juliana Nascimento
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.08124
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)
Related Items (11)
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem ⋮ Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging ⋮ Recent advances in integrating demand management and vehicle routing: a methodological review ⋮ Optimized ensemble value function approximation for dynamic programming ⋮ Dynamic priority rules for combining on-demand passenger transportation and transportation of goods ⋮ A reinforcement learning approach to the stochastic cutting stock problem ⋮ Dynamic scheduling with uncertain job types ⋮ An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet ⋮ Ride solo or pool: designing price-service menus for a ride-sharing platform ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ Opportunities for reinforcement learning in stochastic dynamic vehicle routing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Bagging predictors
- The share-a-ride problem: people and parcels sharing taxis
- An optimization framework for the development of efficient one-way car-sharing systems
- Optimal pricing for ride-sourcing platforms
- Optimization for dynamic ride-sharing: a review
- Optimal battery purchasing and charging strategy at electric vehicle battery swap stations
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Optimal Learning in Experimental Design Using the Knowledge Gradient Policy with Application to Characterizing Nanoemulsion Stability
- Approximate Dynamic Programming
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Empty-Car Routing in Ridesharing Systems
- A representational paradigm for dynamic resource transformation problems
This page was built for publication: Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
