Abstract
In this article, we propose DYNAMOP (DYNAmic programming using Metaheuristic for Optimization Problems) a new dynamic programming based on genetic algorithm to solve a hydro-scheduling problem. The representation which is based on a path in the graph of states of dynamic programming is adapted to dynamic structure of the problem and it allows to hybridize easily evolutionary algorithms with dynamic programming. DYNAMOP is tested on two case studies of hydro-scheduling problem with different price scenarios. Experiments indicate that the proposed approach performs considerably better than classical genetic algorithms and dynamic programming.
Cite
CITATION STYLE
Jacquin, S., Jourdan, L., & Talbi, E. G. (2014). Dynamic programming based metaheuristic for energy planning problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8602, pp. 165–176). Springer Verlag. https://doi.org/10.1007/978-3-662-45523-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
