Optimizing Ride-Pooling Operations with Extended Pickup and Drop-Off Flexibility

• URL: http://arxiv.org/abs/2503.08472v1
• Date: Tue, 11 Mar 2025 14:17:30 GMT
• Title: Optimizing Ride-Pooling Operations with Extended Pickup and Drop-Off Flexibility
• Authors: Hao Jiang, Yixing Xu, Pradeep Varakantham,
• Abstract summary: Ride-Pool Matching Problem (RMP) is central to on-demand ride-pooling services.<n>Most existing RMP solutions assume passengers are picked up and dropped off at their original locations.<n>We propose a novel matching method that incorporates extended pickup and drop-off areas for passengers.
• Score: 16.399294770099615
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Ride-Pool Matching Problem (RMP) is central to on-demand ride-pooling services, where vehicles must be matched with multiple requests while adhering to service constraints such as pickup delays, detour limits, and vehicle capacity. Most existing RMP solutions assume passengers are picked up and dropped off at their original locations, neglecting the potential for passengers to walk to nearby spots to meet vehicles. This assumption restricts the optimization potential in ride-pooling operations. In this paper, we propose a novel matching method that incorporates extended pickup and drop-off areas for passengers. We first design a tree-based approach to efficiently generate feasible matches between passengers and vehicles. Next, we optimize vehicle routes to cover all designated pickup and drop-off locations while minimizing total travel distance. Finally, we employ dynamic assignment strategies to achieve optimal matching outcomes. Experiments on city-scale taxi datasets demonstrate that our method improves the number of served requests by up to 13\% and average travel distance by up to 21\% compared to leading existing solutions, underscoring the potential of leveraging passenger mobility to significantly enhance ride-pooling service efficiency.

Related papers

• Ride-Sourcing Vehicle Rebalancing with Service Accessibility Guarantees via Constrained Mean-Field Reinforcement Learning [42.070187224580344]
  Rapid expansion of services such as Uber, Lyft and Didi Chuxing has reshaped urban transportation by offering flexible, on-demand mobility via mobile applications. Inadequate rebalancing results in prolonged rider waiting times, inefficient vehicle utilization, and inequitable distribution services. We introduce continuous-state mean-field control (MFC) and reinforcement learning (MFRL) models that explicitly represent each vehicle's precise location and employ continuous repositioning actions guided by the distribution of other vehicles.
  arXiv  Detail & Related papers  (2025-03-31T15:00:11Z)
• Exploiting Prior Knowledge in Preferential Learning of Individualized Autonomous Vehicle Driving Styles [41.94295877935867]
  Trajectory planning for automated vehicles commonly employs optimization over a moving horizon - Model Predictive Control. Finding a suitable cost function that results in a driving style preferred by passengers remains an ongoing challenge. We employ preferential Bayesian optimization to learn the cost function by iteratively querying a passenger's preference.
  arXiv  Detail & Related papers  (2025-03-19T16:47:56Z)
• GARLIC: GPT-Augmented Reinforcement Learning with Intelligent Control for Vehicle Dispatching [81.82487256783674]
  GARLIC: a framework of GPT-Augmented Reinforcement Learning with Intelligent Control for vehicle dispatching.<n>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)
• A Bi-Objective Approach to Last-Mile Delivery Routing Considering Driver Preferences [42.16665455951525]
  The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry. This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and operators' decisions and preferences. We evaluate two approaches to address this objective: visually attractive route planning and data mining of historical driver behavior to plan similar routes.
  arXiv  Detail & Related papers  (2024-05-25T04:25:00Z)
• Mutual Information as Intrinsic Reward of Reinforcement Learning Agents for On-demand Ride Pooling [19.247162142334076]
  On-demand vehicle pooling services allow each vehicle to serve multiple passengers at a time. Existing algorithms often only consider revenue, which makes it difficult for requests with unusual distribution to get a ride. We propose a framework for dispatching for ride pooling tasks, which splits the city into discrete dispatching and uses the reinforcement learning (RL) algorithm to dispatch vehicles in these regions.
  arXiv  Detail & Related papers  (2023-12-23T08:34:52Z)
• Optimizing the Placement of Roadside LiDARs for Autonomous Driving [61.584278382844595]
  How to optimize the placement of roadside LiDARs is a crucial but often overlooked problem. This paper proposes an approach to optimize the placement of roadside LiDARs by selecting optimized positions within the scene. A dataset named Roadside-Opt is created using the CARLA simulator to facilitate research on the roadside LiDAR placement problem.
  arXiv  Detail & Related papers  (2023-10-11T07:24:27Z)
• A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services [7.476901945542385]
  We propose GoTogether, a recommender system for car pooling services. GoTogether builds the list of recommended rides in order to maximise the success rate of the offered matches. To test the performance of our scheme we use real data from Twitter and Foursquare sources.
  arXiv  Detail & Related papers  (2023-07-06T09:25:38Z)
• 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)
• A greedy approach for increased vehicle utilization in ridesharing networks [0.3480973072524161]
  ridesharing platforms have become a prominent mode of transportation for the residents of urban areas. We propose a k-hop-based sliding window approximation algorithm that reduces the search space from entire road network to a window. We evaluate our proposed model on real-world datasets and experimental results demonstrate superior performance by our proposed model.
  arXiv  Detail & Related papers  (2023-04-02T07:25:01Z)
• 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)
• 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)
• FlexPool: A Distributed Model-Free Deep Reinforcement Learning Algorithm for Joint Passengers & Goods Transportation [36.989179280016586]
  This paper considers combining passenger transportation with goods delivery to improve vehicle-based transportation. We propose FlexPool, a distributed model-free deep reinforcement learning algorithm that jointly serves passengers & goods workloads. We show that FlexPool achieves 30% higher fleet utilization and 35% higher fuel efficiency in comparison to model-free approaches.
  arXiv  Detail & Related papers  (2020-07-27T17:25:58Z)

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.