The Multiconstraint Team Orienteering Problem with Multiple Time Windows

This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC‐TOP‐MTW). In the MC‐TOP‐MTW, a set of vertices is given, each with a service time, one or more time windows, and a score. The goal is to maximize the sum of the collected scores, by a fixed number of tours. The tours are limited in length and restricted by the time windows and additional constraints. Next to a mathematical formulation of the MC‐TOP‐MTW, the main contribution of this paper is a fast and effective algorithm for tackling this problem, by hybridizing iterated local search with a greedy randomized adaptive search procedure. On a large test set, an average run has a score gap of only 5.19% with known high quality solutions, using 1.5 seconds of computational time. For 32% of the test instances, the known high quality solution was found or improved. This solution method also performs well on test instances of the TOPTW, the selective vehicle routing problem with time windows, and the MC‐TOP‐TW. A sensitivity analysis shows that the performance of the algorithm is insensitive to small changes in the parameter settings.