Thumbnail

A hybrid heuristic for the multi-activity tour scheduling problem

Létocart, Lucas; Furini, Fabio; Liberti, Leo; Traversi, Emiliano; Bettiol, Enrico; Rinaldi, Francesco (2018), A hybrid heuristic for the multi-activity tour scheduling problem, Electronic Notes in Discrete Mathematics, 69, 2, p. 333-340. 10.1016/j.endm.2018.07.043

Voir/Ouvrir
Type
Article accepté pour publication ou publié
Lien vers un document non conservé dans cette base
https://hal.archives-ouvertes.fr/hal-03554323
Date
2018
Nom de la revue
Electronic Notes in Discrete Mathematics
Volume
69
Numéro
2
Éditeur
Elsevier
Pages
333-340
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Létocart, Lucas
Furini, Fabio
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Liberti, Leo
Traversi, Emiliano
Bettiol, Enrico
Rinaldi, Francesco
Résumé (EN)
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.
Mots-clés
Tabu search; large neighborhood search; multi-activity tour scheduling