Scheduling and planning for optimal operations of power plants using a unit commitment approach

2017

Closed access Metadata (CSL-JSON)
DOI 10.4324/9781315267302-7
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The traditional dispatch planning methods used in Kazakhstan are extremely conservative and result in excessive consumption of resources. Moreover, the effect is multiplied by the low overall efficiency of Kazakhstan&s;s power fleet. This chapter uses the security-constrained unit commitment (SCUC) formulation for planning and scheduling of power generator loadings in the Karaganda region of Kazakhstan. The objective of the final model is to obtain least-cost online scheduling for a definite timeline, and at the same time the schedule must comply with the network security constraints and be robust for contingencies. Since system security is the most important factor in the operation of a power system, traditional scheduling provides strong back-up against pre-contingencies by securing considerable preventive dispatch. The introduction of power sector load planning and scheduling has the potential to reduce carbon emissions and the overall expenditure required for dispatch. The proposed rolling-horizon (RH)-SCUC approaches are based entirely on the actual demand from historical data.