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.
Cite
CITATION STYLE
Jacquin, S., Jourdan, L., & Talbi, E. G. (2015). DYNAMOP applied to the unit commitment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8994, pp. 223–228). Springer Verlag. https://doi.org/10.1007/978-3-319-19084-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
