Optimization of hydro energy storage plants by using differential evolution algorithm

The optimal dispatching of cascade Hydro Power Plants is known as a complex optimization problem. In order to solve this problem the authors have applied an adapted differential evolution algorithm by using a fixed and dynamic population size. According to the dynamic population size, the proposed algorithm uses novel random and minimum to maximum sort strategy in order to create new populations with decreased or increased sizes. This implementation enables global search with fast convergence. It also uses a multi-core processor, where all the necessary optimization data are sent to the individual core of a central processing unit. The main aim of the optimization process is to satisfy 24 h demand by minimizing the water quantity used per electrical energy produced. This optimization process also satisfies the desired reservoir levels at the end of the day. The models used in this paper were the real parameters' models of eight cascade Hydro Power Plants located in Slovenia (Europe). Also the standard model from the literature is used in order to compare the performance of the adapted optimization algorithm.