Le problème de planification de techniciens et d'interventions pour les télécommunications (TIST pour Technicians and Interventions Scheduling Problem for Telecommunications) comprend la planification d'interventions et l'affectation d'équipes de techniciens à ces interventions. Chaque intervention est caractérisée, entre autres, par une priorité. L'objectif de ce problème est de séquencer les interventions en tenant compte de leur priorité tout en satisfaisant un ensemble de contraintes comme l'ordre d'exécution de certaines interventions et le nombre minimum de techniciens d'un niveau de compétence donné à affecter à chaque intervention. La résolution de ce problème est centrée sur un algorithme GRASP (Greedy Randomized Adaptive Search Procedure) caractérisé par une mise à jour dynamique des critères de choix des interventions. Pour évaluer la qualité des résultats obtenus par cette approche heuristique, nous présentons également un calcul de bornes inférieures.
The Technicians and Interventions Scheduling Problem for Telecommunications embeds the scheduling of interventions, the assignment of teams to interventions and the assignment of technicians to teams. Every intervention is characterized, among other attributes, by a priority. The objective of this problem is to schedule interventions such that the interventions with the highest priority are scheduled at the earliest time possible while satisfying a set of constraints like the precedence between some interventions and the minimum number of technicians needed with the required skill levels for the intervention. We present a Greedy Randomized Adaptive Search Procedure (GRASP) for solving this problem. In the proposed implementation, we integrate dynamic update of the insertion criteria to the GRASP framework in order to generate good-quality solutions using information brought by previous ones. We also compute lower bounds and present experimental results that validate the effectiveness of this approach.
Keywords: technicians and intervention scheduling, GRASP, metaheuristics
Mots-clés : planification, heuristique, mémoire adaptative
@article{RO_2009__43_4_387_0,
author = {Boussier, Sylvain and Hashimoto, Hideki and Vasquez, Michel and Wilbaut, Christophe},
title = {Un algorithme {GRASP} pour le probl\`eme de planification de techniciens et d'interventions pour les t\'el\'ecommunications},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {387--407},
publisher = {EDP-Sciences},
volume = {43},
number = {4},
year = {2009},
doi = {10.1051/ro/2009027},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ro/2009027/}
}
TY - JOUR AU - Boussier, Sylvain AU - Hashimoto, Hideki AU - Vasquez, Michel AU - Wilbaut, Christophe TI - Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2009 SP - 387 EP - 407 VL - 43 IS - 4 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2009027/ DO - 10.1051/ro/2009027 LA - en ID - RO_2009__43_4_387_0 ER -
%0 Journal Article %A Boussier, Sylvain %A Hashimoto, Hideki %A Vasquez, Michel %A Wilbaut, Christophe %T Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications %J RAIRO - Operations Research - Recherche Opérationnelle %D 2009 %P 387-407 %V 43 %N 4 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2009027/ %R 10.1051/ro/2009027 %G en %F RO_2009__43_4_387_0
Boussier, Sylvain; Hashimoto, Hideki; Vasquez, Michel; Wilbaut, Christophe. Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications. RAIRO - Operations Research - Recherche Opérationnelle, Tome 43 (2009) no. 4, pp. 387-407. doi : 10.1051/ro/2009027. http://archive.numdam.org/articles/10.1051/ro/2009027/
[1] , A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. J. Oper. Res. Soc. 49 (1998) 700-708. | Zbl
[2] , , and , Introduction to algorithms, 2nd ed. The MIT Press (2001). | MR | Zbl
[3] and , Technicians and interventions scheduling for telecommunications (ROADEF challenge subject). Technical report, France Telecom R&D (2006).
[4] and , A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8 (1989) 67-71. | MR | Zbl
[5] and , GRASP An annotated bibliography, in Essays and surveys in metaheuristics, C.C. Ribeiro and P. Hansen (Eds.), Kluwer Academic Publishers (2002) 325-367. | MR | Zbl
[6] and , Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11 (1999) 198-204. | MR | Zbl
[7] , Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 (1986) 533-549. | MR | Zbl
[8] , and , Knapsack Problems. Springer (2004). | MR | Zbl
[9] , and , Models and bounds for two-dimensional level packing problems. J. Comb. Optim. 8 (2004) 363-379. | MR | Zbl
[10] and , A GRASP for graph planarization. Networks 29 (1997) 173-189. | Zbl
[11] and , Greedy randomized adaptive search procedures, in Handbook of Metaheuristics, F. Glover and G.A. Kochenberger (Eds.), Kluwer Academic Publishers (2003) 219-249. | MR | Zbl
[12] , , and , Adaptive memory programming A unified view of metaheuristics. Eur. J. Oper. Res. 135 (2001) 1-16. | MR | Zbl
[13] , and , Transp. Res. Part E. Logist. Transp. Rev. 43 (2007) 591-609.
[14] and , Fast local search and guided local search and their application to british telecom's workforce scheduling problem. Oper. Res. Lett. 20 (1997) 119-127. | Zbl
[15] and , Effective heuristic procedures for a field technician scheduling problem. J. Heurist. 7 (2001) 495-509. | Zbl
Cité par Sources :
