LAUSR

This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.