运筹与管理 ›› 2024, Vol. 33 ›› Issue (4): 153-158.DOI: 10.12005/orms.2024.0126

• 应用研究 • 上一篇    下一篇

网约车实时订单在线选择策略设计与竞争分析

武小平, 兰梦月   

  1. 西安邮电大学 现代邮政学院,陕西 西安 710061
  • 收稿日期:2022-02-24 出版日期:2024-04-25 发布日期:2024-06-13
  • 通讯作者: 兰梦月(1996-),通讯作者,女,陕西西安人,硕士研究生,研究方向:交通运输管理。
  • 作者简介:武小平(1978-),男,陕西咸阳人,博士,副教授,研究方向:不确定性决策。
  • 基金资助:
    陕西省自然科学基金项目(2019JM-369)

Design and Competitive Analysis of Online Selection Strategy for Real-time Orders of Car-hailing Drivers

WU Xiaoping, LAN Mengyue   

  1. Modern Postal College, Xi’an University of Posts and Telecommunications, Xi’an 710061, China
  • Received:2022-02-24 Online:2024-04-25 Published:2024-06-13

摘要: 针对现实中网约车司机追求自身利益最大化而产生的频繁“拒单”现象,为优化乘客满意度、网约车平台调度效率和司机个人收益,提出派单模式下网约车司机实时订单决策问题,并采用在线策略设计与竞争分析展开研究。本文讨论了订单行驶距离小于返空距离的情形,即订单不收取车辆返空费。研究了一般网络上网约车实时在线调度的竞争比下界,并设计了最优调度策略——阈值策略(PT策略),分析了策略的竞争性能。最后,通过算例分析证明,PT策略能有效帮助网约车司机提高工作期间实时订单的总收益,从而降低司机“拒单”行为,在实际生活中具有很强的实用性,对网约车司机、网约车平台和政府具有一定管理启示。

关键词: 网约车调度, 实时订单选择, 在线问题, 竞争比

Abstract: With the rapid development of Internet technology, the online car-hailing industry is also growing, gradually becoming the primary choice for urban residents to travel. However, with the gradual expansion of the scale of online car-hailing, online car-hailing platforms need to effectively match a large number of random orders, and it is difficult for the current scheme to meet the requirements for effective order scheduling. In reality, in order to pursue higher order profits, the phenomenon of “rejecting orders” emerges constantly, which reduces the satisfaction of passengers and the efficiency of vehicle scheduling. In order to improve the response rate of online car-hailing orders and optimize the vehicle scheduling scheme of online car-hailing platforms, this paper uses online algorithms and competition analysis methods to design online strategies to optimize the order decision-making of online car-hailing drivers and improve the income of drivers.
Most online car-hailing platforms in the market now have two basic order matching systems: Assigning Mode and Grabbing Mode, and the corresponding order services are Real-time Order Service and Reservation Order Service.
According to the billing rules of the car-hailing companies, when the travel distance of the order exceeds a certain distance, an additional unit price will be charged according to the original billing rules according to the excess distance. This distance is named as the Empty Drive Distance, and the charge is called the Empty Drive Fee.
This paper discusses the situation where drivers receive real-time orders under assigning mode, and the driving distance of the order is less than the empty drive distance, that is, no empty drive fee will be charged. For drivers, whether they use assigning mode or grabbing mode for order service, only when the online car-hailing platform transmits the passenger order information to the driver and will they know the corresponding service information: the service time of the order, the starting place and destination, the driving distance of order, the driving time of order and the estimated revenue available for serving the order.And they need to immediately decide whether to serve the order based on the above service information. This type of decision maker needs to make decisions about the current state when the future information is partially known or unknown, which is suitable for solving by using online algorithms and competitive analysis methods.
Online algorithms and competitive analysis methods are mainly used in the field of optimization. The essence of optimization theory is the optimization theory, which is an effective algorithm for solving decision problems under incomplete information. The theory of online algorithms and competitive strategy was first used to solve problems related to machine scheduling, and then ones in the field of computer and finance. As uncertain decision-making problems, online ones are widely used in various fields in real life, such as leasing, procurement, scheduling and so on.Many researches on vehicle scheduling problems are carried out on the basis of in-depth researches on traveling salesman problems.
According to the method of online algorithm and strategy analysis, after describing the problem of online real-time order selection for online car-hailing drivers and making environmental assumptions, the lower bound of the competitive ratio of this problem is analyzed by analyzing the ratio of the minimum order revenue of online drivers and the maximum revenue of offline drivers. Then, the Profit Threshold strategy (PT strategy) is designed, and by analyzing the competitive ratio lower bound of the strategy, it is proved that online drivers could avoid getting the worst returns by using the PT strategy. Finally, a simple arithmetic case analysis is conducted through Python to demonstrate the practical effect of the designed PT strategy by comparing the total value of the driver’s work gain and the competitive ratio with the lower bound of the competitive ratio.
The research results of this paper have certain management implications for improving the benefits and work efficiency of car-hailing drivers, platforms and governments. It not only provides suggestions and guidance for improving the benefits of real-time order decision-making for drivers, but also reduces the safety risks of distracted order selection by drivers while driving. Moreover, by reducing the driver’s rejection rate, the scheduling efficiency of the car-hailing platform is improved. Residents’ satisfaction with online car travel has increased, which has also increased the probability of choosing online car travel, and alleviated the environmental governance problems caused by a large number of private cars. Further research from more types of orders may be considered in the future.

Key words: car-hailing dispatch, real-time order selection, online problems, competitive ratio

中图分类号: