A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications
Sylvain Boussier (LGI2P), Hideki Hashimoto, Michel Vasquez (LGI2P)
TL;DR
This paper presents a GRASP algorithm for scheduling technicians and interventions in telecommunications, achieving top rankings in the ROADEF 2007 challenge.
Contribution
It introduces a specific greedy randomized adaptive search procedure tailored for a complex scheduling problem in telecommunications.
Findings
Achieved 1st place in Junior category
Secured 4th place overall in the challenge
Demonstrated effectiveness of GRASP in scheduling problems
Abstract
The 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Embedded Systems Design Techniques · Optimization and Search Problems