Welcome to Francis Academic Press

Academic Journal of Computing & Information Science, 2025, 8(1); doi: 10.25236/AJCIS.2025.080109.

Spatial Coverage Target-Oriented Matching Algorithm for Ride-Hailing Research

Author(s)

Yitong Zhang

Corresponding Author:
Yitong Zhang
Affiliation(s)

School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan, China

Abstract

As a new type of transportation, ride-hailing not only promotes the development of urban transportation, but also raises some new problems for urban management and management. When ride-hailing are empty, they often go to areas with high order rates to seek maximum benefits, so that they cannot meet the travel requirements of passengers under certain conditions. Due to the lack of a reasonable incentive mechanism, drivers often take negative measures against the “dispatch orders” required by the platform due to refusal to accept orders, shutdowns, and other reasons. In response to this problem, this paper starts with improving the coverage of ride-hailing, and induces the operating paths of ride-hailing without one-way trips by regulating the reward amount of each traffic area, so as to reduce their service in urban operations. Difference between allocation and target passenger distribution. This paper uses the concept of bipartite graph and greedy selection to determine the location of ride-hailing, and then achieves the purpose of improving the coverage of ride-hailing. Finally, through experiments, the model is verified.

Keywords

Ride-hailing, Matching Algorithm, Bipartite graph

Cite This Paper

Yitong Zhang. Spatial Coverage Target-Oriented Matching Algorithm for Ride-Hailing Research. Academic Journal of Computing & Information Science (2025), Vol. 8, Issue 1: 64-70. https://doi.org/10.25236/AJCIS.2025.080109.

References

[1] Tong Y, Zeng Y, Ding B, et al. Two-sided Online Micro-Task Assignment in Spatial Crowdsourcing [J]. IEEE Transactions on Knowledge and Data Engineering, 2020: 1-1. 

[2] Zhang X, Yang Z, Gong Y-J, et al. SpatialRecruiter: Maximizing Sensing Coverage in Selecting Workers for Spatial Crowdsourcing [J]. IEEE Transactions on Vehicular Technology, 2017, 66(6): 5229-5240 

[3] Zhu Y, Bao Y, Li B. On Maximizing Delay-Constrained Coverage of Urban Vehicular Networks [J]. IEEE Journal on Selected Areas in Communications, 2012, 30(4): 804-817 

[4] Song S, Liu Z, Li Z, et al. Coverage-Oriented Task Assignment for Mobile Crowdsensing [J]. IEEE Internet of Things Journal, 2020, 7(8): 7407-7418 

[5] Wu L, Xiong Y, Wu M, et al. A Task Assignment Method for Sweep Coverage Optimization Based on Crowdsensing [J]. IEEE Internet of Things Journal, 2019, 6(6): 10686-10699 

[6] Ai. Efficient Multi-Step Prediction Model That Considers the Influence of Spatial and Temporal Factors on Ride-Hailing Demand [J]. TRANSPORTATION RESEARCH RECORD, 2024.