DYNAMOP Applied to the Unit Commitment Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

DYNAMOP Applied to the Unit Commitment Problem


In tho sarticle,we propose to apply a hybrid method called DYNAMOP (DYNAmic programming using Metaheuristic for Optimization Problems) to solve the Unit Commitment Problem (UCP). DYNAMOP uses a representation based on a path in the graph of states of dynamic programming, which is adapted to the dynamic structure of the problem and facilitates the hybridization between evolutionary algorithms and dynamic programming. Experiments indicate that the proposed approach outperforms the best known approach in literature.
No file

Dates and versions

hal-01110448 , version 1 (28-01-2015)


  • HAL Id : hal-01110448 , version 1


Sophie Jacquin, Laetitia Jourdan, El-Ghazali Talbi. DYNAMOP Applied to the Unit Commitment Problem. LION, Jan 2015, Lille, France. ⟨hal-01110448⟩
111 View
0 Download


Gmail Facebook X LinkedIn More