Title of Paper:Multicore Parallel Dynamic Programming Algorithm for Short-Term Hydro-Unit Load Dispatching of Huge Hydropower Stations Serving Multiple Power Grids

Hits:

Date of Publication:2020-01-01

Journal:WATER RESOURCES MANAGEMENT

Included Journals:EI、SCIE

Volume:34

Issue:1

Page Number:359-376

ISSN No.:0920-4741

Key Words:Short-term hydro-unit load distribution; Multicore parallel dynamic programming; Xiluodu hydropower station; Multiple power grids; Fork; join framework

Abstract:Short-term hydro-unit load dispatching (SHULD) refers to the determination of the power output of each unit within a hydropower station over a planning horizon to minimize the operational cost or maximize the power-generation profit while satisfying hydraulic and electrical constraints. In China, huge hydropower stations, such as the Three Gorges (TG) and Xiluodu (XLD) stations, are composed of a large number of hydro units, which feature a high installed capacity and a high water head. SHULD models of these stations are more complex and difficult to solve compared with those of traditional stations, especially when the stations serve multiple power grids. This study develops a practical method for optimizing SHULD models by considering the XLD hydropower station as a case study. First, a SHULD model for huge hydropower stations with multiple vibration zones and multiple receiving power grids is presented. Second, classical and sophisticated dynamic programming (DP) is applied to the SHULD model, and a practical strategy is proposed to balance the available water in a reservoir's left and right banks to satisfy their load demands. Finally, the Fork/Join framework is used to parallelize DP to reduce the computation time and fully utilize the computer resources. The wet and dry season results demonstrate that the approach is efficient and suitable for huge hydropower stations with a high water head and multiple receiving power grids, thereby demonstrating its potential practicability and validity for solving the SHULD problem.