OPTIMUM UNIT COMMITMENT SOLUTION OF A POWER SYSTEM BASED ON SALP SWARM ALGORITHM

Abstract

This paper presents an algorithm to solve the unit commitment problem in a power system. The proposed algorithm employs the Salp swarm algorithm technique to search the optimum unit schedule for a particular daily demand pattern and specific time horizon. Different constraints are taken into consideration, transition cost (start-up and shut down )cost, mean-up time, mean-down time, spinning reserve, and power balance. The proposed algorithm is applied to 10-units and 26-unit. The obtained results are compared with other methods. It reveals the robustness of the proposed algorithm in terms of minimizing overall running costs.