Parallel Binary Sine Cosine with Optimal Priority List Algorithm for Unit Commitment

摘要

The scheduling of the generating units is a very important issue in the power system operation, which is defined as unit commitment problem (UCP). The aim of the UCP scheduling to minimize the total generation costs with satisfying the power demand, spinning reserve, ramp rate and other operation constraints. In this paper, a proposed procedure binary Sine Cosine (BSC) optimization technique with optimal priority list (OPL) algorithm is introduced to procedure solves UCP. The proposed procedure is achieved through two stages; the first stage aims to shrunk search space by introducing optimal priority list (OPL), while the second stage adopts the BSC optimization technique to find the optimal solution of UCP, by accelerating the search process of BSC optimization technique. The different types of priority lists are introduced with binary particle swarm optimization (BPSO) technique then these results are comprised to find the optimal binary result, a lowest cost and OPL. The procedure proposed is applied to IEEE test system. The results of these algorithms are compared to show the capability and efficiently of the optimal algorithm. Based on the obtained results, it can be concluding that, the proposed procedure gives the best results and saves the computational efforts.