In this paper, we present a novel approach for solving a maintenance scheduling problem from the French electricity grid company RTE, as presented in the ROADEF 2020 challenge. Our approach combines constraint generation with a new family of cutting planes to address the nonconvexity of the problem. We provide mathematical proofs and separation algorithms for the cutting planes and study the practical impact of our approach on the challenge instances. This method is applicable to a wide range of problems involving the modeling of uncertainty, and is shown to improve results significantly on real-world instances.

翻译：本文针对法国电网公司RTE在ROADEF 2020挑战中提出的维护调度问题，提出了一种新型求解方法。该方法结合约束生成技术与新提出的割平面族，以应对问题的非凸性。我们给出了割平面族的数学证明与分离算法，并研究了该方法在挑战实例中的实际效果。该技术适用于涉及不确定性建模的广泛问题，并在实际案例中显著提升了求解结果。