DYNAMOP Applied to the Unit Commitment Problem - Archive ouverte HAL Access content directly
Conference Papers Year :

DYNAMOP Applied to the Unit Commitment Problem

(1) , (2) , (2)
1
2

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-01110448 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More