Dynamic Programming Based Metaheuristic for the Unit Commitment Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Dynamic Programming Based Metaheuristic for the Unit Commitment Problem

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.
Fichier principal
Vignette du fichier
hspMeta.pdf (123.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01110444 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More