Modeling an enhanced ridesharing system with meet points and time windows.

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 rideshari...

Full description

Bibliographic Details
Main Authors: Xin Li, Sangen Hu, Wenbo Fan, Kai Deng
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2018-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC5929516?pdf=render
id doaj-78c9cbba9f834f55822485be6e162182
record_format Article
spelling doaj-78c9cbba9f834f55822485be6e1621822020-11-24T20:41:39ZengPublic Library of Science (PLoS)PLoS ONE1932-62032018-01-01135e019592710.1371/journal.pone.0195927Modeling an enhanced ridesharing system with meet points and time windows.Xin LiSangen HuWenbo FanKai DengWith 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.http://europepmc.org/articles/PMC5929516?pdf=render
collection DOAJ
language English
format Article
sources DOAJ
author Xin Li
Sangen Hu
Wenbo Fan
Kai Deng
spellingShingle Xin Li
Sangen Hu
Wenbo Fan
Kai Deng
Modeling an enhanced ridesharing system with meet points and time windows.
PLoS ONE
author_facet Xin Li
Sangen Hu
Wenbo Fan
Kai Deng
author_sort Xin Li
title Modeling an enhanced ridesharing system with meet points and time windows.
title_short Modeling an enhanced ridesharing system with meet points and time windows.
title_full Modeling an enhanced ridesharing system with meet points and time windows.
title_fullStr Modeling an enhanced ridesharing system with meet points and time windows.
title_full_unstemmed Modeling an enhanced ridesharing system with meet points and time windows.
title_sort modeling an enhanced ridesharing system with meet points and time windows.
publisher Public Library of Science (PLoS)
series PLoS ONE
issn 1932-6203
publishDate 2018-01-01
description 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.
url http://europepmc.org/articles/PMC5929516?pdf=render
work_keys_str_mv AT xinli modelinganenhancedridesharingsystemwithmeetpointsandtimewindows
AT sangenhu modelinganenhancedridesharingsystemwithmeetpointsandtimewindows
AT wenbofan modelinganenhancedridesharingsystemwithmeetpointsandtimewindows
AT kaideng modelinganenhancedridesharingsystemwithmeetpointsandtimewindows
_version_ 1716824268524748800