This research addresses a new variant of the vehicle routing problem, called the two-echelon vehicle routing problem with time windows, covering options, and occasional drivers (2E-VRPTW-CO-OD). In this problem, two types of fleets are available to serve customers, city freighters and occasional drivers (ODs), while two delivery options are available to customers, home delivery and alternative delivery. For customers choosing the alternative delivery, their demands are delivered to one of the available covering locations for them to pick up. The objective of 2E-VRPTW-CO-OD is to minimize the total cost consisting of routing costs, connection costs, and compensations paid to ODs while satisfying all demands. We formulate a mixed integer linear programming model and propose an effective adaptive large neighborhood search (ALNS) for solving 2E-VRPTW-CO-OD. In addition, the proposed ALNS provides comparable results with those obtained by state-of-the-art algorithms for the two echelon vehicle routing problem, which is a special case of 2E-VRPTW-CO-OD. Lastly, the effects of occasional drivers and covering locations are presented.

这项研究解决了车辆路径选择问题的一个新变体，称为具有时间窗、覆盖选项和临时驾驶员的两级车辆路径问题 (2E-VRPTW-CO-OD)。在这个问题中，有两种类型的车队可以为客户提供服务，城市货机和临时司机 (OD)，而客户可以使用两种送货方式，送货上门和替代送货。对于选择替代交付的客户，他们的需求将被交付到可用的覆盖地点之一供他们取货。2E-VRPTW-CO-OD 的目标是在满足所有需求的同时最小化包括路由成本、连接成本和支付给 OD 的补偿在内的总成本。我们制定了一个混合整数线性规划模型，并提出了一种有效的自适应大邻域搜索 (ALNS) 来解决 2E-VRPTW-CO-OD。此外，所提出的 ALNS 为两梯队车辆路径问题提供了与通过最先进算法获得的结果相当的结果，这是 2E-VRPTW-CO-OD 的一个特例。最后，介绍了偶尔驱动程序和覆盖位置的影响。