Abstract

Under consideration is some new real-world application of vehicle routing planning in a finite time horizon. Let a company have a set of capacitated vehicles in some depots and serve some set of customers. There is a frequency for each customer which describes how often the customer should be visited. Time intervals between two consecutive visits are fixed, but the visiting schedule is flexible. To obtain some competitive advantage, the company tries to increase the service quality. To this end, each customer should be visited by one driver only. The goal is to minimize the total length of the vehicle paths over the planning horizon under the frequency constraints and driver shift length constraints. We present a mixed-integer linear programming model for this new consistent capacitated vehicle routing problem. To find near optimal solutions, we design the variable neighborhood search metaheuristic with several neighborhood structures. The driver shift length and capacitated constraints are penalized and included into the objective function. Some numerical results for the real test instances are discussed.

中文翻译：

---

一致的周期车辆路径问题的混合局部搜索算法

摘要

正在考虑在有限的时间范围内将某些新的实际应用应用于车辆路径规划。让公司在某些仓库中配备一套载重汽车，并为某些客户提供服务。每个客户都有一个频率来描述应多久拜访一次客户。两次连续访问之间的时间间隔是固定的，但是访问时间表是灵活的。为了获得一些竞争优势，该公司试图提高服务质量。为此，每个客户只能拜访一位司机。目标是在频率约束和驾驶员换档长度约束下，使规划范围内车辆路径的总长度最小。我们针对此新的一致容量车辆路径问题提出了混合整数线性规划模型。为了找到最佳解决方案，我们设计了具有几种邻域结构的可变邻域搜索元启发式方法。驾驶员的换挡长度和受限制的约束均受到惩罚，并包含在目标函数中。讨论了实际测试实例的一些数值结果。