Dynamic Programming Based Metaheuristic ...
Type de document :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Titre :
Dynamic Programming Based Metaheuristic for the Unit Commitment Problem
Auteur(s) :
Jacquin, Sophie [Auteur correspondant]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Titre de la manifestation scientifique :
META
Ville :
Marrakech
Pays :
Maroc
Date de début de la manifestation scientifique :
2014-10-27
Mot(s)-clé(s) en anglais :
Metaheuristic
Discipline(s) HAL :
Mathématiques [math]/Optimisation et contrôle [math.OC]
Informatique [cs]/Algorithme et structure de données [cs.DS]
Informatique [cs]/Algorithme et structure de données [cs.DS]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01110444/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01110444/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- hspMeta.pdf
- Accès libre
- Accéder au document