Skip to Main content Skip to Navigation
Conference papers

DYNAMOP Applied to the Unit Commitment Problem

Sophie Jacquin 1 Laetitia Jourdan 2 El-Ghazali Talbi 2
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Sophie Jacquin Connect in order to contact the contributor
Submitted on : Wednesday, January 28, 2015 - 11:21:05 AM
Last modification on : Saturday, December 18, 2021 - 3:05:28 AM


  • 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⟩



Les métriques sont temporairement indisponibles