A hybrid heuristic for the multi-activity tour scheduling problem

Abstract

This work investigates the tour scheduling problem with a multi-activity context, a challenging problem that often arises in personnel scheduling. We propose a hybrid heuristic, which combines tabu search and large neighborhood search techniques. We present computational experiments on weekly time horizon problems dealing with up to five work activities. The results show that the proposed approach is able to find good quality solutions.