Accelerating unit commitment problem under uncertainty of renewable energy resources.

Abstract

The recent increase in the power demand and the ever-growing need to satisfy that demand by the integration of the renewable energy resources have significantly rise the computational complexity of power systems to efficiently satisfy the demand. Consequently, a concept appeared to meet the demand at each hour called unit commitment problem (UCP) which contribute crucially to the daily planning for generating power unit of any power system and it is a fundamental problem in the electrical power industry. The UCP tries to minimise the generation cREosts which leads to a profit maximisation. In this work, the UCP is considered to operate in 24-bus test system, the process of accelerating it splits into three main parts: determining the generation shift factors, identifying the binding transmission constraints, and estimating the process schedule for the generating units corresponding to least costs over 168-hour period. This schedule must consider the constraints and restrictions that effecting the system to ensure all generating units work in regard of its technical limits. It has been demonstrated that by accelerating the UCP; only the binding constraints are considered, the computational complexity will significantly decrease while maintaining the exact same results with a much lower algorithm computing time.