Optimizing matching time interval and matching radius in on-demand ride-sourcing markets

摘要

With the availability of the location information of drivers and passengers, ride-sourcing platforms can now provide increasingly efficient online matching compared with physical searching and meeting performed in the traditional taxi market. The matching time interval (the time interval over which waiting passengers and idle drivers are accumulated and then subjected to peer-to-peer matching) and matching radius (or maximum allowable pick-up distance, within which waiting passengers and idle drivers can be matched or paired) are two key control variables that a platform can employ to optimize system performance in an online matching system. By appropriately extending the matching time interval, the platform can accumulate large numbers of waiting (or unserved) passengers and idle drivers and thus match the two pools with a reduced expected pick-up distance. However, if the matching time interval is excessively long, certain passengers may become impatient and even abandon their requests. Meanwhile, a short matching radius can reduce the expected pick-up distance but may decrease the matching rate as well. Therefore, the matching time interval and matching radius should be optimized to enhance system efficiency in terms of passenger waiting time, vehicle utilization, and matching rate. This study proposes a model that delineates the online matching process in ride-sourcing markets. The model is then used to examine the impact of the matching time interval and matching radius on system performance and to jointly optimize the two variables under different levels of supply and demand. Numerical experiments are conducted to demonstrate how the proposed modeling and optimization approaches can improve the real-time matching of ride-sourcing platforms. (C) 2019 Elsevier Ltd. All rights reserved.