A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem

TL;DR

This paper proposes a novel multi-period inspector scheduling problem and develops a tabu search algorithm with specialized operators and bounds, demonstrating high-quality solutions through extensive experiments.

Contribution

Introduces the MPISP, a new variant of VRPTW, and develops a tabu search algorithm with tailored operators and bounds for effective solutions.

Findings

The algorithm produces high-quality solutions.

The shortest transit time computation is effective.

Extensive experiments validate the approach.

Abstract

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.