Nuclear power plants must be regularly shut down in order to perform refueling and maintenance operations. The scheduling of the outages is the first problem to be solved in electricity production management. It is a hard combinatorial problem for which an exact solving is impossible. Our approach consists in modelling the problem by a two-level problem. First, we fix a feasible schedule of the dates of the outages. Then, we solve a low-level problem of optimization of electricity production, by respecting the initial planning. In our model, the low-level problem is a deterministic convex optimal control problem. Given the set of solutions and Lagrange multipliers of the low-level problem, we can perform a sensitivity analysis with respect to dates of the outages. The approximation of the value function which is obtained could be used for the optimization of the schedule with a local search algorithm.
[1]
E. G. Golʹshteĭn.
Theory of convex programming
,
1972
.
[2]
E. Gol′šteĭn,et al.
Theory of Convex Programming
,
1972
.
[3]
Mohand Ou Idir Khemmoudj,et al.
When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages
,
2006,
CP.
[4]
Ellis L. Johnson,et al.
Optimizing nuclear power plant refueling with mixed-integer programming
,
1997
.
[5]
Mohand Ou Idir Khemmoudj.
Modélisation et résolution de systèmes de contraintes : application au problème de placement des arrêts et de la production des réacteurs nucléaires d'EDF
,
2007
.
[6]
Benjamin Pfaff,et al.
Perturbation Analysis Of Optimization Problems
,
2016
.