Taxi dispatching strategies with compensations

• URL: http://arxiv.org/abs/2401.11553v1
• Date: Sun, 21 Jan 2024 17:54:46 GMT
• Title: Taxi dispatching strategies with compensations
• Authors: Holger Billhardt, Alberto Fern\'andez, Sascha Ossowski, Javier Palanca, Javier Bajo
• Abstract summary: 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.
• Score: 2.952318265191524
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Urban mobility efficiency is of utmost importance in big cities. Taxi vehicles are key elements in daily traffic activity. The advance of ICT and geo-positioning systems has given rise to new opportunities for improving the efficiency of taxi fleets in terms of waiting times of passengers, cost and time for drivers, traffic density, CO2 emissions, etc., by using more informed, intelligent dispatching. Still, the explicit spatial and temporal components, as well as the scale and, in particular, the dynamicity of the problem of pairing passengers and taxis in big towns, render traditional approaches for solving standard assignment problem useless for this purpose, and call for intelligent approximation strategies based on domain-specific heuristics. Furthermore, taxi drivers are often autonomous actors and may not agree to participate in assignments that, though globally efficient, may not be sufficently beneficial for them individually. This paper presents a new heuristic algorithm for taxi assignment to customers that considers taxi reassignments if this may lead to globally better solutions. In addition, as such new assignments may reduce the expected revenues of individual drivers, we propose an economic compensation scheme to make individually rational drivers agree to proposed modifications in their assigned clients. We carried out a set of experiments, where several commonly used assignment strategies are compared to three different instantiations of our heuristic algorithm. The results indicate that our proposal has the potential to reduce customer waiting times in fleets of autonomous taxis, while being also beneficial from an economic point of view.

Related papers

• GPT-Augmented Reinforcement Learning with Intelligent Control for Vehicle Dispatching [82.19172267487998]
  GARLIC: a framework of GPT-Augmented Reinforcement Learning with Intelligent Control for vehicle dispatching. This paper introduces GARLIC: a framework of GPT-Augmented Reinforcement Learning with Intelligent Control for vehicle dispatching.
  arXiv  Detail & Related papers  (2024-08-19T08:23:38Z)
• Cooperative Advisory Residual Policies for Congestion Mitigation [11.33450610735004]
  We develop a class of learned residual policies that can be used in cooperative advisory systems. Our policies advise drivers to behave in ways that mitigate traffic congestion while accounting for diverse driver behaviors. Our approaches successfully mitigate congestion while adapting to different driver behaviors.
  arXiv  Detail & Related papers  (2024-06-30T01:10:13Z)
• Finding A Taxi with Illegal Driver Substitution Activity via Behavior Modelings [42.090136287906915]
  Illegal Driver Substitution (IDS) activity for a taxi is a grave unlawful activity in the taxi industry. Currently, the IDS activity is manually supervised by law enforcers. We propose a computational method that helps law enforcers efficiently find the taxis which tend to have the IDS activity.
  arXiv  Detail & Related papers  (2024-04-18T01:47:31Z)
• 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)
• Studying the Impact of Semi-Cooperative Drivers on Overall Highway Flow [76.38515853201116]
  Semi-cooperative behaviors are intrinsic properties of human drivers and should be considered for autonomous driving. New autonomous planners can consider the social value orientation (SVO) of human drivers to generate socially-compliant trajectories. We present study of implicit semi-cooperative driving where agents deploy a game-theoretic version of iterative best response.
  arXiv  Detail & Related papers  (2023-04-23T16:01:36Z)
• Learning energy-efficient driving behaviors by imitating experts [75.12960180185105]
  This paper examines the role of imitation learning in bridging the gap between control strategies and realistic limitations in communication and sensing. We show that imitation learning can succeed in deriving policies that, if adopted by 5% of vehicles, may boost the energy-efficiency of networks with varying traffic conditions by 15% using only local observations.
  arXiv  Detail & Related papers  (2022-06-28T17:08:31Z)
• 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)
• Incentivizing Efficient Equilibria in Traffic Networks with Mixed Autonomy [17.513581783749707]
  Vehicle platooning can potentially reduce traffic congestion by increasing road capacity via vehicle platooning. We consider a network of parallel roads with two modes of transportation: (i) human drivers, who will choose the quickest route available to them, and (ii) a ride hailing service, which provides an array of autonomous vehicle route options, each with different prices, to users. We formalize a model of vehicle flow in mixed autonomy and a model of how autonomous service users make choices between routes with different prices and latencies.
  arXiv  Detail & Related papers  (2021-05-06T03:01:46Z)
• A Distributed Model-Free Ride-Sharing Approach for Joint Matching, Pricing, and Dispatching using Deep Reinforcement Learning [32.0512015286512]
  We present a dynamic, demand aware, and pricing-based vehicle-passenger matching and route planning framework. Our framework is validated using the New York City Taxi dataset. Experimental results show the effectiveness of our approach in real-time and large scale settings.
  arXiv  Detail & Related papers  (2020-10-05T03:13:47Z)
• Real-time and Large-scale Fleet Allocation of Autonomous Taxis: A Case Study in New York Manhattan Island [14.501650948647324]
  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.
  arXiv  Detail & Related papers  (2020-09-06T16:00:15Z)
• Balancing Taxi Distribution in A City-Scale Dynamic Ridesharing Service: A Hybrid Solution Based on Demand Learning [0.0]
  We study the challenging problem of how to balance taxi distribution across a city in a dynamic ridesharing service. We propose a hybrid solution involving a series of algorithms: the Correlated Pooling collects correlated rider requests, the Adjacency Ride-Matching based on Demand Learning assigns taxis to riders, and the Greedy Idle Movement aims to direct taxis without a current assignment to the areas with riders in need of service.
  arXiv  Detail & Related papers  (2020-07-27T07:08:02Z)

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.