多周期检验员调度问题的禁忌搜索算法
A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem
摘要:
提出了一种多周期检查员调度问题(MPISP),它是带时间窗的多行程车辆路径问题(VRPTW)的一个新变种。在MPISP中,每个检查员都被安排在给定的多周期计划范围内执行路线。在每个阶段结束时,每个检查员不需要返回仓库,但必须留在其中一个顶点进行休养。如果当前周期的剩余时间不足以让检查员从他/她的当前顶点$A$行进到某个顶点B,则他/她可以选择在顶点A等待直到下一周期开始,或者行进到更靠近顶点B的顶点C。因此,任何顶点对之间的最短渡越时间受周期长度和出发时间的影响。我们首先描述了一种计算任意出发时间的任意一对顶点之间的最短渡越时间的方法。为了解决MPISP,我们提出了几个本地搜索算子,从经典的VRPTW运营商,并将它们集成到一个禁忌搜索框架。此外,我们提出了一个约束背包模型,能够产生一个上限的问题。最后,我们评估我们的算法的有效性进行了广泛的实验的基础上的一组测试实例。我们的计算结果表明,我们的方法产生高质量的解决方案。
英文摘要:
This paper introduces a multi-period inspector scheduling problem (MPISP), which is a new variant of the multi-trip vehicle routing problem with time windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route in a given multi-period planning horizon. At the end of each period, each inspector is not required to return to the depot but has to stay at one of the vertices for recuperation. If the remaining time of the current period is insufficient for an inspector to travel from his/her current vertex $A$ to a certain vertex B, he/she can choose either waiting at vertex A until the start of the next period or traveling to a vertex C that is closer to vertex B. Therefore, the shortest transit time between any vertex pair is affected by the length of the period and the departure time. We first describe an approach of computing the shortest transit time between any pair of vertices with an arbitrary departure time. To solve the MPISP, we then propose several local search operators adapted from classical operators for the VRPTW and integrate them into a tabu search framework. In addition, we present a constrained knapsack model that is able to produce an upper bound for the problem. Finally, we evaluate the effectiveness of our algorithm with extensive experiments based on a set of test instances. Our computational results indicate that our approach generates high-quality solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。