This paper proposes a ridesharing routing problem for airport riders motivated by a practical application. This problem designs routes for electric vehicles owned by an airport to provide pickup and delivery service for riders both departing from and traveling to the airport. To maintain a high quality of ridesharing service, it is assumed that drivers should ensure that all riders on board from the airport are completely delivered before they pick up new riders to the airport. The departure time from the airport and the return time to the airport of electric vehicles are affected by the flight schedules of riders. Additionally, due to the limited driving range of electric vehicles, the partial recharging at the airport is considered. The proposed ridesharing routing problem is formulated as a trip-based mixed integer linear programming model. An efficient method is proposed to enumerate all non-dominated feasible trips to form a trip-based graph for the model. A branch-and-price algorithm is developed to solve the proposed problem, in which a tailored labeling algorithm with feasibility checking process is designed to solve the pricing subproblem. The numerical experiments indicate that the trip-based model is more efficient compared with the rider-based model, and the proposed branch-and-price algorithm could solve large scale instances efficiently. The effects of acceptable extra time ratio, trip duration, capacity, and battery capacity on both airport and rider sides are discussed by sensitivity analysis.

中文翻译：

---

机场电动汽车乘客的拼车路线问题

本文基于实际应用提出了机场乘客的拼车路线问题。该问题为机场拥有的电动汽车设计路线，为出发和前往机场的乘客提供接送服务。为了保持高质量的拼车服务，司机应该确保所有从机场出发的乘客在接新乘客到机场之前都已完全交付。电动车从机场出发的时间和返回机场的时间受骑手航班时刻的影响。另外，由于电动汽车的续驶里程有限，考虑在机场进行部分充电。所提出的乘车共享路线问题被表述为基于行程的混合整数线性规划模型。提出了一种有效的方法来枚举所有非支配可行行程，以形成模型的基于行程的图。开发了分支和价格算法来解决所提出的问题，其中设计了具有可行性检查过程的定制标记算法来解决定价子问题。数值实验表明，与基于乘客的模型相比，基于行程的模型更有效，并且所提出的分支和价格算法可以有效地解决大规模实例。通过敏感性分析讨论了可接受的加时比、行程持续时间、容量和电池容量对机场和乘客双方的影响。