A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications

Simple item page
dc.creatorBoussier, Sylvain
dc.creatorHashimoto, Hideki
dc.creatorVasquez, Michel
dc.date2007-09-06
dc.date.accessioned2026-07-07T08:27:57Z
dc.date.available2026-07-07T08:27:57Z
dc.descriptionThe subject of the 5th challenge proposed by the French Society of Operations Research and Decision Analysis (ROADEF) consists in scheduling technicians and interventions for telecommunications (http://www.g-scop.inpg.fr/ChallengeROADEF2007/ or http://www.roadef.org/). We detail the algorithm we proposed for this challenge which is a Greedy Randomized Adaptative Search Procedure (GRASP). Computational results led us to the 1st position in the Junior category and to the 4th position in All category of the Challenge ROADEF 2007.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0709.0906
dc.identifierhttp://arxiv.org/abs/0709.0906
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137451
dc.subjectDiscrete Mathematics
dc.titleA Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications
dc.typetext

Files

Collections

arXiv