Abstract

The short-term economical operation (STEO) in hydropower station is nonlinear mixed integer problem, satisfying complex hydrologic constraints simultaneously. In this paper, we decomposed STEO into unit commitment (UC) and economical load dispatch (ELD) sub-problems. In terms of premature convergence and inefficient search performance of conventional shuffled frog leaping algorithm (SFLA), we proposed chaotic normal cloud model based discrete SFLA (CNCM-DSFLA). The CNCM-DSFLA incorporates novel population initialization based on renewed chaotic logistic mapping, three frog sub-populations including leader frog, follower frog and mutation frog, heuristic frog activation mechanism and frog mutation based on normal cloud model. The CNCM-DSFLA is applied to solve UC sub-problem and ELD sub-problem is handled based on optimal economic load distribution table. Moreover, reserve capacity supplement and repair, and minimum startup and shutdown repair strategies are introduced to deal with multiple hydrologic and electrical constraints. Finally, CNCM-DSFLA is verified by a case in Three Gorges hydropower station. Simulation results demonstrate that CNCM-DSFLA gets higher-quality solutions with less total water consumption and shorter computation time in comparison with other methods. Thus, validity and superiority of CNCM-DSFLA are verified and it can provide novel effective way for solving STEO problem in complex hydropower station system.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.