Page tree

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.


In the past, solution techniques only considered a coarse discretization of the time horizon (weekly time steps) and the problem was decomposed into single production units (fossil fuel power plants, hydro-electric units,...). Stochastic aspects were considered at the unit level with scenario modeling for hydro inputs and marginal costs.  For the optimization over a single unit Dynamic Programming is a simple and efficient approach.

Nowadays, models are using a finer discretization (daily time steps). Technical coupling constraints between the different production units are incorporated (for eeg. g. limited resources ressources to perform certain operations). The main solution methods are local search heuristics, decomposition approaches (Bender's, Dantzig Wolfe and Lagrangean Relaxation) and occasional Mixed Integer Programming (MIP) or Model Predictive Control (MPC) models.

In practice MIP approaches require small time windows for the schedule of maintenance. Local search approaches are less restrictive but don't provide proofs of optimality. A flurry of approaches for this problem have been developed in the 2010 ROADEF Challenge. There is much room for future work in mathematical methodology. Stochastic models should cover aspects like demands, renewable productions, delays in maintenance operations and availability of power plants (failures, efficiency,...). A highly desirable aim is to achieve stability of the computed schedule with respect to small modifications in the input.  In deregulated markets game theoretic aspects enter because an independent system operator must approve time windows in view of the proposals of several competitors.



Prof. Christoph Helmberg, TU Chemnitz

Prof. Etienne de Klerk, Tilburg University

Dr Thomas Triboulet, EDF

Dr. Fabrizio Lacalandra, QuanTek