Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?

The ubiquity of information and communication technology (ICT) and application of global positioning system (GPS) enabled cell phones provide new opportunities to implement ride-sharing in many ride-hailing platforms, where matching proposals with multiple riders are established on very short notice...

Full description

Bibliographic Details
Main Authors: Yue Yang, Qiong Tian, Yuqing Wang
Format: Article
Language:English
Published: KeAi Communications Co., Ltd. 2020-12-01
Series:Journal of Management Science and Engineering
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S2096232020300445
id doaj-f9caad64aba84c20b7640bed6dedb4e0
record_format Article
spelling doaj-f9caad64aba84c20b7640bed6dedb4e02020-12-25T05:07:59ZengKeAi Communications Co., Ltd.Journal of Management Science and Engineering2096-23202020-12-0154264286Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?Yue Yang0Qiong Tian1Yuqing Wang2School of Economics and Management, Beihang University, Beijing, 100191, ChinaCorresponding author.; School of Economics and Management, Beihang University, Beijing, 100191, ChinaSchool of Economics and Management, Beihang University, Beijing, 100191, ChinaThe ubiquity of information and communication technology (ICT) and application of global positioning system (GPS) enabled cell phones provide new opportunities to implement ride-sharing in many ride-hailing platforms, where matching proposals with multiple riders are established on very short notice. In this paper, the travelers joining in the ridesharing are assumed to be homogeneous in terms of having their own vehicles. When they have announced their travel requests, the ride-sharing platform will check whether they can be picked up by any other travelers. If failed, they will drive by themselves and become a driver who would like to pick up other passengers in the system. To solve this problem, the ride-matching problem is formulated as a set-partitioning problem and a so-called ordered greedy (OG) method is presented to get the approximately optimum under the large-scale circumstance. The results of simulation examples prove that the proposed method can achieve a reasonable matching result through Cplex within a few seconds but at most 3.8% worse than the exact optimum. Furthermore, several interesting results are also found via simulating generated data and the real-world data of Chengdu in China. In simulation experiments, with a higher level of demand density, the easiest place to find a ride is not in the center but a ring close by it, which is determined by traffic flows, OD distance and vehicles’ utilization. As a contrast, the optimal strategy for participants to be a rider is going to other specific regions rather than staying in the city center in real-world experiments.http://www.sciencedirect.com/science/article/pii/S2096232020300445Ride-matchingHeuristic algorithmPassenger ratioChengdu data
collection DOAJ
language English
format Article
sources DOAJ
author Yue Yang
Qiong Tian
Yuqing Wang
spellingShingle Yue Yang
Qiong Tian
Yuqing Wang
Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
Journal of Management Science and Engineering
Ride-matching
Heuristic algorithm
Passenger ratio
Chengdu data
author_facet Yue Yang
Qiong Tian
Yuqing Wang
author_sort Yue Yang
title Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
title_short Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
title_full Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
title_fullStr Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
title_full_unstemmed Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
title_sort who is more likely to get a ride and where is easier to be picked up in ride-sharing mode?
publisher KeAi Communications Co., Ltd.
series Journal of Management Science and Engineering
issn 2096-2320
publishDate 2020-12-01
description The ubiquity of information and communication technology (ICT) and application of global positioning system (GPS) enabled cell phones provide new opportunities to implement ride-sharing in many ride-hailing platforms, where matching proposals with multiple riders are established on very short notice. In this paper, the travelers joining in the ridesharing are assumed to be homogeneous in terms of having their own vehicles. When they have announced their travel requests, the ride-sharing platform will check whether they can be picked up by any other travelers. If failed, they will drive by themselves and become a driver who would like to pick up other passengers in the system. To solve this problem, the ride-matching problem is formulated as a set-partitioning problem and a so-called ordered greedy (OG) method is presented to get the approximately optimum under the large-scale circumstance. The results of simulation examples prove that the proposed method can achieve a reasonable matching result through Cplex within a few seconds but at most 3.8% worse than the exact optimum. Furthermore, several interesting results are also found via simulating generated data and the real-world data of Chengdu in China. In simulation experiments, with a higher level of demand density, the easiest place to find a ride is not in the center but a ring close by it, which is determined by traffic flows, OD distance and vehicles’ utilization. As a contrast, the optimal strategy for participants to be a rider is going to other specific regions rather than staying in the city center in real-world experiments.
topic Ride-matching
Heuristic algorithm
Passenger ratio
Chengdu data
url http://www.sciencedirect.com/science/article/pii/S2096232020300445
work_keys_str_mv AT yueyang whoismorelikelytogetarideandwhereiseasiertobepickedupinridesharingmode
AT qiongtian whoismorelikelytogetarideandwhereiseasiertobepickedupinridesharingmode
AT yuqingwang whoismorelikelytogetarideandwhereiseasiertobepickedupinridesharingmode
_version_ 1724371382791307264