Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem

摘要

This paper considers the planning problem arising in the maintenance of a power distribution grid. Maintenance works require the corresponding parts of the grid to be shut down for the entire duration of maintenance which could range from one day to several weeks. The planning specifies the starting times of the required outages for maintenance and should take into account the constrained resources as well as the uncertainty involved in the maintenance works which is characterized by the risk values provided by the grid operator. The problem was presented by the French company Reseau de Transport d'electricite for the 2020 ROADEF/EURO challenge. Several approaches were developed during the competition and all approaches are reported in this paper. We evaluate our approaches on the benchmark instances proposed for the competition. It is reported that the iterated local search metaheuristic with self-adaptive perturbation performed the best.