Solving unit commitment problem by using modified minority charge carrier inspired algorithm

Abstract EN

The main aim in an interconnected power systems operation is to minimize total cost of generating real power at variou^s stations while satisfyin^g the loads an^d losses in the tran^smission links.

This economy of operation is called economic dispatch problem.

The problem of economic dispatch can be portioned in to two Some sub problems, one is optimum allocation (Unit Commitment (UC)) of generators for various system load levels and the other one is load schedulin^g (LS) problem.

This problem contains high level of complexity, various constrained par^m^eters, integer decision variables etc.

Hen^ce, in this paper a new method based on "Minority Ch^arge Carrier Inspired Al^gorithm (MCl) "has been applied to complex optimization problem (UC and LS) for io generatin^g units for a period of 24 hours and results ha^s been explored.

With the proposed algorithm, the total cost of the system has been reduced effectively with less computation^al time.

Also, this al^gorithm has a look ahead capability to forecast the load deman^ds with its previou^s data^.

Various test cases have been studied an^d results have been explored.