Multi-Area Unit Commitment Using Particle Swarm Optimization Approach

Abstract

This paper presents a novel approach to solve the Multi-Area unit commitment problem using particle swarm optimization algorithm. The objective of the multi-area unit commitment problem is to determine the optimal or a near optimal commitment strategy for generating units located in multiple areas that are interconnected via tie –lines. This strategy of multi-area joint operation of generation resources can result in significant operational cost savings. The dynamic programming method is applied to solve Multi- Area Unit Commitment problem and particle swarm optimization algorithm which is embedded for assigning optimum generation. The optimum allocation of generation is assigned to each area and the power is allocated to all committed units. The tie-line transfer limitations are considered as a set of constraints during the optimization process to ensure the system security and reliability. IEEE test systems are used as numerical examples to test the proposed algorithm. The feasibility of the new algorithm is demonstrated by the numerical example, and particle swarm optimization solution methodology is efficient than other algorithms.