Skip to Main content Skip to Navigation
Conference papers

Dynamic Programming Based Metaheuristic for the Unit Commitment Problem

Sophie Jacquin 1, * Laetitia Jourdan 2 El-Ghazali Talbi 2
* Corresponding author
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Unit Commitment Problem (UCP) is a strategic optimization problem in power system operation. Its objective is to schedule the generating units online or offline over a scheduling horizon such that the power production cost is minimized with the load demand fully met and the operation constraints satisfied.In this paper an approach to solve the UCP called DYNAMOP for DYNAmic programming using Metaheuristic for Optimizations Problems is proposed. The main idea of this method is to use a genetic algorithm (GA) to run through the graph of Dynamic Programming.
Keywords : Metaheuristic
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01110444
Contributor : Sophie Jacquin <>
Submitted on : Wednesday, January 28, 2015 - 7:29:51 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Wednesday, April 29, 2015 - 10:31:39 AM

File

hspMeta.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01110444, version 1

Citation

Sophie Jacquin, Laetitia Jourdan, El-Ghazali Talbi. Dynamic Programming Based Metaheuristic for the Unit Commitment Problem. META, Oct 2014, Marrakech, Morocco. ⟨hal-01110444⟩

Share

Metrics

Record views

403

Files downloads

317