English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Global: Zendy Plus monthly

This paper presents a novel technique to solve the problem of unit commitment through sorting of units into different clusters. This sorting is implemented in order to decrease the overall operating cost and to assure the various constraints that involve minimum up/down. Unit commitment problem is an important optimization task in daily operational planning of power systems which can be mathematically formulated as a large scale nonlinear mixed-integer minimization problem. A new methodology employing the concept of cluster algorithm called as additive and divisive hierarchical clustering has been employed in order to carry out the technique of unit commitment. Proposed methodology involves two individual algorithms. While the load is increasing, additive cluster algorithm has been employed while divisive cluster algorithm is used when the load is decreasing. The proposed technique is tested on a system with generating units in range of 10-100 and the performance of the proposed technique has been reported through simulation results.

ADDITIVE AND DIVISIVE CLUSTER ALGORITHM FOR COST REDUCTION IN UNIT COMMITMENT