This paper proposes a ride-hailing sharing problem with parcel transportation. In the study, both passengers and parcels can be transported by ordering the requests through a ride-hailing platform, in which the passengers can only be delivered by ride-hailing vehicles (RHVs) while parcels can be delivered by both RHVs and electric motorcycles (EMs). Compared with RHVs, EMs have a lower speed, a smaller capacity for parcels, and a lower driving cost per kilometer. Parcels are divided into eight classes according to the size of parcels (i.e., extra small, small, middle, and large) and the urgency of parcels (i.e., urgent and non-urgent). Passengers and passengers, passengers and parcels, as well as multiple parcels, are allowed to share the same vehicles in this problem. A two-level lexicographic multi-objective function is proposed from the perspective of the ride-hailing platform, where the first-level objective is to maximize the profit of the platform and the second-level objective is to minimize the total driving cost of RHVs and EMs. The time-varying property of passenger requests is considered and the proposed problem is divided into a set of continuous and small-scale ride-hailing subproblems. Each subproblem is formulated to match both passenger and parcel requests to RHVs and EMs, and to determine vehicle routes. Time window constraints, RHV capacity constraints for passengers, RHV trunk capacity constraints for parcels and luggage, and EM delivery box capacity constraints are considered. The modified artificial bee colony (MABC) algorithm is proposed based on the framework developed by Zhan et al. (2022) to solve the ride-hailing sharing problem with parcel transportation. The results of numerical experiments show that allowing RHVs to transport parcels can significantly increase the profit of the platform, the number of matched requests, and the average profit of RHV drivers. If RHVs are allowed to pick up parcels, the government should encourage the replacement of all EMs with RHVs under the more-passengers-fewer-parcels scenario. However, the government should not encourage the replacement of all EMs with RHVs and allow some EMs in the ride-hailing market under the fewer-passengers-more-parcels scenario.

本文提出了包裹运输的网约车共享问题。在这项研究中，乘客和包裹都可以通过网约车平台订购请求来运输，其中乘客只能通过网约车（RHV）运送，而包裹可以通过网约车和电动摩托车运送（ EM）。与 RHV 相比，EM 具有更低的速度、更小的包裹容量以及更低的每公里行驶成本。包裹根据包裹的大小（即特小、小、中、大）和包裹的紧急程度（即加急和非加急）分为八个等级。乘客与乘客，乘客与包裹，以及多个包裹，在这个问题中允许共享同一辆车。从网约车平台的角度提出了一个二级字典序多目标函数，第一级目标是平台利润最大化，第二级目标是RHV总驾驶成本最小化和新兴市场。考虑到乘客请求的时变特性，将提出的问题划分为一组连续的小规模网约车子问题。每个子问题的制定都是为了将​​乘客和包裹请求与 RHV 和 EM 相匹配，并确定车辆路线。考虑了时间窗口约束、乘客的 RHV 容量约束、包裹和行李的 RHV 主干容量约束以及 EM 投递箱容量约束。改进的人工蜂群（MABC）算法是基于由詹等。(2022)解决网约车共享包裹运输问题。数值实验结果表明，允许RHV运输包裹可以显着提高平台利润、匹配请求数和RHV司机的平均利润。如果允许 RHV 提取包裹，政府应该鼓励在乘客更多，包裹更少的情况下，将所有 EM 替换为 RHV。但是，政府不应该鼓励将所有 EM 替换为 RHV，并在更少的乘客更多包裹的情况下允许一些 EM 进入乘车市场。