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

2007/09/06 by Sylvain Boussier, Boussier, Sylvain, Hideki Hashimoto +3
Computer Science · Engineering · #Discrete Mathematics (cs.DM) #Embedded Systems Design Techniques #FOS: Computer and information sciences #Optimization and Search Problems #VLSI and FPGA Design Techniques

paper · pdf · doi:10.48550/arxiv.0709.0906

openalex publication_date 2007/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Enhanced Iterated local search for the technician routing and scheduling problem
• Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling
• Learning to Schedule Deadline- and Operator-Sensitive Tasks
• Improving a State-of-the-Art Heuristic for the Minimum Latency Problem\n with Data Mining
• HyFlex: A Benchmark Framework for Cross-domain Heuristic Search