Journal Article

Modeling an enhanced ridesharing system with meet points and time windows

Deng, Kai, Fan, Wenbo, Li, Xin, Hu, Sangen

2018

Overview

With the rising of e-hailing services in urban areas, ride sharing is becoming a common mode of transportation. This paper presents a mathematical model to design an enhanced ridesharing system with meet points and users' preferable time windows. The introduction of meet points allows ridesharing operators to trade off the benefits of saving en-route delays and the cost of additional walking for some passengers to be collectively picked up or dropped off. This extension to the traditional door-to-door ridesharing problem brings more operation flexibility in urban areas (where potential requests may be densely distributed in neighborhood), and thus could achieve better system performance in terms of reducing the total travel time and increasing the served passengers. We design and implement a Tabu-based meta-heuristic algorithm to solve the proposed mixed integer linear program (MILP). To evaluate the validation and effectiveness of the proposed model and solution algorithm, several scenarios are designed and also resolved to optimality by CPLEX. Results demonstrate that (i) detailed route plan associated with passenger assignment to meet points can be obtained with en-route delay savings; (ii) as compared to CPLEX, the meta-heuristic algorithm bears the advantage of higher computation efficiency and produces good quality solutions with 8%~15% difference from the global optima; and (iii) introducing meet points to ridesharing system saves the total travel time by 2.7%-3.8% for small-scale ridesharing systems. More benefits are expected for ridesharing systems with large size of fleet. This study provides a new tool to efficiently operate the ridesharing system, particularly when the ride sharing vehicles are in short supply during peak hours. Traffic congestion mitigation will also be expected.

• Publisher: Public Library of Science,Public Library of Science (PLoS)
• Subject: Advantages / Algorithms / Analysis / Car pools / Car sharing / Computer and Information Sciences / Computing time / Cost control / Earth Sciences / Engineering and Technology / Heuristic / Heuristic methods / Integer programming / Linear programming / Logistics / Mathematical models / Mitigation / Mixed integer / Neighborhoods / Neural networks / Operations research / Operators (mathematics) / Passengers / Physical Sciences / Research and Analysis Methods / Ride sharing services / Ridesharing / Ridesharing services / Routing / Scheduling / Social Sciences / Traffic congestion / Transportation services / Travel / Travel time / Urban areas / Vehicles / Windows (intervals)