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 (CRIStAL) - 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.
Type de document :
Communication dans un congrès
LION, Jan 2015, Lille, France
Liste complète des métadonnées

https://hal.inria.fr/hal-01110448
Contributeur : Sophie Jacquin <>
Soumis le : mercredi 28 janvier 2015 - 11:21:05
Dernière modification le : jeudi 11 janvier 2018 - 06:27:32

Identifiants

  • HAL Id : hal-01110448, version 1

Citation

Sophie Jacquin, Laetitia Jourdan, El-Ghazali Talbi. DYNAMOP Applied to the Unit Commitment Problem. LION, Jan 2015, Lille, France. 〈hal-01110448〉

Partager

Métriques

Consultations de la notice

340