A Priori Approach of Real-time Ridesharing Problem with Intermediate Meeting Locations

نویسندگان

  • Kamel Aissat
  • Ammar Oulamara
چکیده

Ridesharing is a mobility concept in which a trip is shared by a vehicle’s driver and one or more passengers called riders. Ridesharing is considered as a more environmentally friendly alternative to single driver commutes in pollution-creating vehicles on overcrowded streets. In this paper, we present the core of a new strategy of the ridesharing system, making it more flexible and competitive than the recurring system. More precisely, we allow the driver and the rider to meet each other at an intermediate starting location and to separate at another intermediate ending location not necessarily their origins and destinations, respectively. This allows to reduce both the driver’s detour and the total travel cost. The term “A priori approach” means that the driver sets the sharing cost rate on the common path with rider in advance. An exact and heuristic approaches to identify meeting locations, while minimizing the total travel cost of both driver and rider are proposed. Finally, we analyze their empirical performance on a set of real road networks consisting of up to 3,5 million nodes and 8,7 million edges. Our experimental results show that our heuristics provide efficient performances within short CPU times and improves the recurring ridesharing approach in terms of cost-savings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Round-Trip Ridesharing Problem with Relay Stations

In this work, we investigate the potential benefits of introducing relay stations in the round-trip ridesharing problem. In the classical round-trip ridesharing system, the pick-up and drop-off locations for the rider don’t differ from his origin and destination, respectively, for both outgoing and return trips. This system is straightforward but inflexible and unbalanced as it puts the whole d...

متن کامل

A Real-Time Algorithm to Solve the Peer-to-Peer Ride-Matching Problem in a Flexible Ridesharing System

Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years, thanks to the wide-spread use of smart phones, mobile application development platforms, and online payment systems. An assignment of drivers to riders, known as the ride-matching problem, is the central component of a peer-to-peer ridesharing system. In this paper, we di...

متن کامل

Dynamic Optimization Models for Ridesharing and Carsharing

Collaborative consumption is the culture of sharing instead of ownership in consumer behaviours. Transportation services such as ridesharing, carsharing, and bikesharing have recently adopted collaborative business models. Such services require real-time management of the available fleets to increase revenues and reduce costs. This thesis proposes two dynamic models for real-time management of ...

متن کامل

Impact of Detour-Aware Policies on Maximizing Profit in Ridesharing

This paper provides efficient solutions to maximize profit for commercial ridesharing services, under a pricing model with detour-based discounts for passengers. We propose greedy heuristics for real-time ride matching that offer different trade-offs between optimality and speed. Simulations on New York City (NYC) taxi trip data show that our heuristics are up to 90% optimal and 10 times faster...

متن کامل

Large Scale Real-time Ridesharing with Service Guarantee on Road Networks

Urban traffic gridlock is a familiar scene. At the same time, the mean occupancy rate of personal vehicle trips in the United States is only 1.6 persons per vehicle mile. Ridesharing has the potential to solve many environmental, congestion, pollution, and energy problems. In this paper, we introduce the problem of large scale real-time ridesharing with service guarantee on road networks. Trip ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015