• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Dynamic Programming Based Metaheuristic ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Title :
Dynamic Programming Based Metaheuristic for the Unit Commitment Problem
Author(s) :
Jacquin, Sophie [Auteur correspondant]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur] refId
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur] refId
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Conference title :
META
City :
Marrakech
Country :
Maroc
Start date of the conference :
2014-10-27
English keyword(s) :
Metaheuristic
HAL domain(s) :
Mathématiques [math]/Optimisation et contrôle [math.OC]
Informatique [cs]/Algorithme et structure de données [cs.DS]
English abstract : [en]
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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.inria.fr/hal-01110444/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/hal-01110444/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017