A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services

• URL: http://arxiv.org/abs/2307.05697v1
• Date: Thu, 6 Jul 2023 09:25:38 GMT
• Title: A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services
• Authors: Mattia Giovanni Campana, Franca Delmastro, Raffaele Bruno
• Abstract summary: 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.
• Score: 7.476901945542385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Car pooling is expected to significantly help in reducing traffic congestion and pollution in cities by enabling drivers to share their cars with travellers with similar itineraries and time schedules. A number of car pooling matching services have been designed in order to efficiently find successful ride matches in a given pool of drivers and potential passengers. However, it is now recognised that many non-monetary aspects and social considerations, besides simple mobility needs, may influence the individual willingness of sharing a ride, which are difficult to predict. To address this problem, in this study we propose GoTogether, a recommender system for car pooling services that leverages on learning-to-rank techniques to automatically derive the personalised ranking model of each user from the history of her choices (i.e., the type of accepted or rejected shared rides). Then, 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 in order to generate a dataset of plausible mobility patterns and ride requests in a metropolitan area. The results show that the proposed solution quickly obtain an accurate prediction of the personalised user's choice model both in static and dynamic conditions.

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)
• MetaFollower: Adaptable Personalized Autonomous Car Following [63.90050686330677]
  We propose an adaptable personalized car-following framework - MetaFollower. We first utilize Model-Agnostic Meta-Learning (MAML) to extract common driving knowledge from various CF events. We additionally combine Long Short-Term Memory (LSTM) and Intelligent Driver Model (IDM) to reflect temporal heterogeneity with high interpretability.
  arXiv  Detail & Related papers  (2024-06-23T15:30:40Z)
• 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)
• Motion Planning and Control for Multi Vehicle Autonomous Racing at High Speeds [100.61456258283245]
  This paper presents a multi-layer motion planning and control architecture for autonomous racing. The proposed solution has been applied on a Dallara AV-21 racecar and tested at oval race tracks achieving lateral accelerations up to 25 $m/s2$.
  arXiv  Detail & Related papers  (2022-07-22T15:16:54Z)
• Meta-Learning over Time for Destination Prediction Tasks [53.12827614887103]
  A need to understand and predict vehicles' behavior underlies both public and private goals in the transportation domain. Recent studies have found, at best, only marginal improvements in predictive performance from incorporating temporal information. We propose an approach based on hypernetworks, in which a neural network learns to change its own weights in response to an input.
  arXiv  Detail & Related papers  (2022-06-29T17:58:12Z)
• Secure Your Ride: Real-time Matching Success Rate Prediction for Passenger-Driver Pairs [24.5737193355862]
  We propose the Multi-View model (MV) to accurately predict the MSR of passenger-driver. MV learns the interactions among the dynamic features of the passenger, driver, trip order, as well as context. We also design the Knowledge Distillation framework (KD) to supplement the model's predictive power for smaller cities.
  arXiv  Detail & Related papers  (2021-09-14T15:41:13Z)
• 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)
• Real-world Ride-hailing Vehicle Repositioning using Deep Reinforcement Learning [52.2663102239029]
  We present a new practical framework based on deep reinforcement learning and decision-time planning for real-world vehicle on idle-hailing platforms. Our approach learns ride-based state-value function using a batch training algorithm with deep value. We benchmark our algorithm with baselines in a ride-hailing simulation environment to demonstrate its superiority in improving income efficiency.
  arXiv  Detail & Related papers  (2021-03-08T05:34:05Z)
• Deep Structured Reactive Planning [94.92994828905984]
  We propose a novel data-driven, reactive planning objective for self-driving vehicles. We show that our model outperforms a non-reactive variant in successfully completing highly complex maneuvers.
  arXiv  Detail & Related papers  (2021-01-18T01:43:36Z)
• 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)
• 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.