Title
DYNAMOP Applied to the Unit Commitment Problem
Abstract
In this article, 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.
Year
DOI
Venue
2015
10.1007/978-3-319-19084-6_20
Lecture Notes in Computer Science
Field
DocType
Volume
Dynamic programming,Graph,Mathematical optimization,Evolutionary algorithm,Computer science,Power system simulation,Artificial intelligence,Fuel cost,Optimization problem,Machine learning,Metaheuristic
Conference
8994
ISSN
Citations 
PageRank 
0302-9743
1
0.36
References 
Authors
2
3
Name
Order
Citations
PageRank
Sophie Jacquin151.92
Laetitia Jourdan256344.24
El-Ghazali Talbi32186179.85