Research on Online Car-Hailing Scheduling Problem Based on Resource Allocation

  •  Rongyuan Chen    
  •  Geng Qian    
  •  Zhixiong He    
  •  Yuanxing Shi    
  •  Minmin Hu    


In recent years, with the rapid development of Internet technology, various online car-hailing platforms (Uber, DiDi, CaoCao, etc.) have swept the world. The convenient and fast information exchange of "Internet +" greatly alleviates the information obstruction caused by the space-time deviation between passengers and drivers in the traditional taxi system, and becomes a powerful tool to improve the efficiency of the taxi market. In order to improve the utilization of resource allocation, this paper designs a model based on the vehicle's empty driving distance, and uses the Hungarian solution to obtain the shortest vehicle's empty driving distance to optimize the resource allocation problem. Then, according to the position coordinates and the travel route of the vehicle, the vehicle information of eleven times a day is calculated, and it is found that the result obtained by the algorithm is ideal;At the same time, we design the subsidy pricing model and its scheme. Finally, we make a systematic summary of the research content of this paper and look forward to the possible research directions in the future.

This work is licensed under a Creative Commons Attribution 4.0 License.