Implementation of clustering based unit commitment employing imperialistic competition algorithm

• A technique to solve problem of unit commitment based on Imperialistic Competition Algorithm (ICA) has been presented.
• A technique employing concept of cluster algorithm called as additive and divisive clustering has been employed to form clusters of units.
• The technique that has been developed has been tested on system with generating units in range of 10–100.

Saving of fuel cost can be done through proper commitment of available generating units. This paper presents a novel technique to solve the problem of unit commitment through sorting of units into different clusters based on Imperialistic Competition Algorithm (ICA). This sorting is implemented in order to decrease the overall operating cost and to assure the various constraints that involve minimum up/down. The technique of unit commitment is a significant assignment in the normal working of power systems which can actually be represented as a large scale minimization problem that involves non linear mixed integers. A new technique employing the concept of cluster algorithm called as additive and divisive hierarchical clustering has been used based on a new technique called as Imperialistic Competition Algorithm in order to carry out the technique of unit commitment. Proposed methodology involves two individual algorithms. Additive cluster algorithm has been employed while the load is increasing while divisive cluster algorithm has been used when the load is decreasing. The technique that has been developed has been tested on system with generating units in range of 10–100 and the superior performance of the technique has been reported through simulation results.