科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper proposes a discrete binary differential evolution (DBDE) approach to solve the unit commitment problem (UCP). The proposed method is enhanced by priority list based on the unit characteristics and heuristic search strategies to handle constraints effectively. The implementation of the proposed method for UCP consists of three stages. Firstly, the DBDE based on priority list is applied for unit scheduling when neglecting the minimum up/down time constraints. Secondly. repairing strategies are used to handle the minimum up/down time constraints and decommit excess spinning reserve units. Finally, heuristic unit substitution search and gray zone modification algorithm are used to improve optimal solution further. Furthermore, the effects of two crucial parameters on performance of the DBDE for solving UCP are studied as well. To verify the advantages of the method, the proposed method is tested and compared to the other methods on the systems with the number of units in the range of 10-100. Numerical results demonstrate that the proposed method is superior to other methods reported in the literature.
