A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem

Xingbin Zhan, W.Y. Szeto, C.S. Shui and Chen, Xiqun (Michael)

Transportation Research Part E: Logistics and Transportation Review, 2021, vol. 150, issue C

Abstract: Ride-hailing sharing involves grouping ride-hailing customers with similar trips and time schedules to share the same ride-hailing vehicle to reduce their total travel cost. With the current information and communication technology, ride-hailing customers and drivers can be matched in real-time via a ride-hailing platform. This paper formulates a dynamic ride-hailing sharing problem that simultaneously maximizes the number of served customers, minimizes the travel cost and travel time ratios, and considers the capacity, time window, and travel cost constraints. The travel cost ratio is the ratio of actual passengers’ fare to the passengers’ fare without ride-hailing sharing, whereas the travel time ratio is defined as the actual travel time (including waiting time) over the maximum allowable travel time. To solve the dynamic problem, it is divided into many small and continuous static subproblems with an equal time interval. Each subproblem is solved by a modified artificial bee colony (MABC) algorithm with path relinking, while the contraction hierarchies and vantage point tree are used to determine the shortest path and accelerate the algorithm, respectively. Problem properties and the performance of the proposed solution method are demonstrated using large-scale real-time data from Didi that is the largest ride-hailing company in China. The proposed method is shown to outperform the benchmark, i.e., greedy randomized adaptive search procedure (GRASP) with path relinking. The proposed method also performs better when the length of each time interval is longer, and the tolerance for the incremental travel time caused by detours is higher. We also demonstrate that (a) considering both travel cost and travel time ratios in the objective can achieve a better sharing percentage, and balance the increase in the travel time ratio and the decrease in the travel cost ratio compared with the objective that misses either travel time or the travel cost ratio; and (b) the passengers can gain a large out-of-pocket cost saving in the case of ride-hailing sharing while enduring a relatively small increase in travel time compared with the case without ride-hailing sharing.

Keywords: Dynamic ride-hailing sharing; Artificial bee colony algorithm; Path relinking; Vantage point tree (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554520307729
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:150:y:2021:i:c:s1366554520307729

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2020.102124

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().