Real-time and Large-scale Fleet Allocation of Autonomous Taxis: A Case Study in New York Manhattan Island

• URL: http://arxiv.org/abs/2009.02762v2
• Date: Tue, 20 Oct 2020 01:46:34 GMT
• Title: Real-time and Large-scale Fleet Allocation of Autonomous Taxis: A Case Study in New York Manhattan Island
• Authors: Yue Yang, Wencang Bao, Mohsen Ramezani, Zhe Xu
• Abstract summary: Traditional models fail to efficiently allocate the available fleet to deal with the imbalance of supply (autonomous taxis) and demand (trips) We employ a Constrained Multi-agent Markov Decision Processes (CMMDP) to model fleet allocation decisions. We also leverage a Column Generation algorithm to guarantee the efficiency and optimality in a large scale.
• Score: 14.501650948647324
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nowadays, autonomous taxis become a highly promising transportation mode, which helps relieve traffic congestion and avoid road accidents. However, it hinders the wide implementation of this service that traditional models fail to efficiently allocate the available fleet to deal with the imbalance of supply (autonomous taxis) and demand (trips), the poor cooperation of taxis, hardly satisfied resource constraints, and on-line platform's requirements. To figure out such urgent problems from a global and more farsighted view, we employ a Constrained Multi-agent Markov Decision Processes (CMMDP) to model fleet allocation decisions, which can be easily split into sub-problems formulated as a 'Dynamic assignment problem' combining both immediate rewards and future gains. We also leverage a Column Generation algorithm to guarantee the efficiency and optimality in a large scale. Through extensive experiments, the proposed approach not only achieves remarkable improvements over the state-of-the-art benchmarks in terms of the individual's efficiency (arriving at 12.40%, 6.54% rise of income and utilization, respectively) and the platform's profit (reaching 4.59% promotion) but also reveals a time-varying fleet adjustment policy to minimize the operation cost of the platform.

Related papers

• A methodological framework for Resilience as a Service (RaaS) in multimodal urban transportation networks [0.0]
  This study aims to explore the management of public transport disruptions through resilience as a service strategies. It develops an optimization model to effectively allocate resources and minimize the cost for operators and passengers. The proposed model is applied to a case study in the Ile de France region, Paris and suburbs.
  arXiv  Detail & Related papers  (2024-08-30T12:22:34Z)
• Taxi dispatching strategies with compensations [2.952318265191524]
  This paper presents a new algorithm for taxi assignment to customers that considers taxi reassignments. We propose an economic compensation scheme to make individually rational drivers agree to proposed modifications in their assigned clients.
  arXiv  Detail & Related papers  (2024-01-21T17:54:46Z)
• Fair collaborative vehicle routing: A deep multi-agent reinforcement learning approach [49.00137468773683]
  Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents. We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2023-10-26T15:42:29Z)
• Coalitional Bargaining via Reinforcement Learning: An Application to Collaborative Vehicle Routing [49.00137468773683]
  Collaborative Vehicle Routing is where delivery companies cooperate by sharing their delivery information and performing delivery requests on behalf of each other. This achieves economies of scale and thus reduces cost, greenhouse gas emissions, and road congestion. But which company should partner with whom, and how much should each company be compensated? Traditional game theoretic solution concepts, such as the Shapley value or nucleolus, are difficult to calculate for the real-world problem of Collaborative Vehicle Routing.
  arXiv  Detail & Related papers  (2023-10-26T15:04:23Z)
• Safe Model-Based Multi-Agent Mean-Field Reinforcement Learning [48.667697255912614]
  Mean-field reinforcement learning addresses the policy of a representative agent interacting with the infinite population of identical agents. We propose Safe-M$3$-UCRL, the first model-based mean-field reinforcement learning algorithm that attains safe policies even in the case of unknown transitions. Our algorithm effectively meets the demand in critical areas while ensuring service accessibility in regions with low demand.
  arXiv  Detail & Related papers  (2023-06-29T15:57:07Z)
• iPLAN: Intent-Aware Planning in Heterogeneous Traffic via Distributed Multi-Agent Reinforcement Learning [57.24340061741223]
  We introduce a distributed multi-agent reinforcement learning (MARL) algorithm that can predict trajectories and intents in dense and heterogeneous traffic scenarios. Our approach for intent-aware planning, iPLAN, allows agents to infer nearby drivers' intents solely from their local observations.
  arXiv  Detail & Related papers  (2023-06-09T20:12:02Z)
• Designing Optimal Personalized Incentive for Traffic Routing using BIG Hype algorithm [3.7597202216941783]
  We study the problem of optimally routing plug-in electric and conventional fuel vehicles on a city level. In our model, commuters selfishly aim to minimize a local cost that combines travel time, and the monetary cost of using city facilities, parking or service stations. We formalize the problem of designing these monetary incentives optimally as a large-scale bilevel game.
  arXiv  Detail & Related papers  (2023-04-24T11:13:10Z)
• Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control [8.020856741504794]
  We study online control algorithms for autonomous mobility-on-demand systems. We develop a novel hybrid enriched machine learning pipeline which learns online dispatching and rebalancing policies. We show that our approach outperforms state-of-the-art greedy, and model-predictive control approaches.
  arXiv  Detail & Related papers  (2023-02-08T09:40:30Z)
• Improving Operational Efficiency In EV Ridepooling Fleets By Predictive Exploitation of Idle Times [0.0]
  We present a real-time predictive charging method for ridepooling services with a single operator, called Idle Time Exploitation (ITX) ITX predicts the periods where vehicles are idle and exploits these periods to harvest energy. It relies on Graph Convolutional Networks and a linear assignment algorithm to devise an optimal pairing of vehicles and charging stations.
  arXiv  Detail & Related papers  (2022-08-30T08:41:40Z)
• Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing [84.47891614815325]
  This paper focuses on the core problem in P2P ridesharing: the matching of riders and drivers. We introduce novel notions of fairness and stability in P2P ridesharing. Results suggest that fair and stable solutions can be obtained in reasonable computational times.
  arXiv  Detail & Related papers  (2021-10-04T02:14:49Z)
• Value Function is All You Need: A Unified Learning Framework for Ride Hailing Platforms [57.21078336887961]
  Large ride-hailing platforms, such as DiDi, Uber and Lyft, connect tens of thousands of vehicles in a city to millions of ride demands throughout the day. We propose a unified value-based dynamic learning framework (V1D3) for tackling both tasks.
  arXiv  Detail & Related papers  (2021-05-18T19:22:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.