A hybrid heuristic for the multi-activity tour scheduling problem - Université Sorbonne Paris Nord Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2018

A hybrid heuristic for the multi-activity tour scheduling problem

Résumé

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.

Dates et versions

hal-03554323 , version 1 (03-02-2022)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Stefania Pan, Mahuna Akplogan, Nora Touati, Lucas Létocart, Roberto Wolfler Calvo, et al.. A hybrid heuristic for the multi-activity tour scheduling problem. Electronic Notes in Discrete Mathematics, 2018, 69 (2), pp. 333-340. ⟨10.1016/j.endm.2018.07.043⟩. ⟨hal-03554323⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More