Author(s)

S. R. P. CHITRA SELVI, R. P. KUMUDINI DEVI, C. CHRISTOBER ASIR RAJAN

.

This paper presents a novel approach to solve the Multi-Area unit commitment problem using particle swarm optimization technique. The objective of the multi-area unit commitment problem is to determine the optimal or a near optimal commitment strategy for generating the units. And it is located in multiple areas that are interconnected via tie lines and 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 technique is embedded for computing the generation assigned to each area and the power allocated to all committed unit. Particle Swarm Optimization technique is developed to derive its Pareto-optimal solutions. The tie-line transfer limits are considered as a set of constraints during the optimization process to ensure the system security and reliability. Case study of four areas each containing 26 units connected via tie lines has been taken for analysis. Numerical results are shown comparing the cost solutions and computation time obtained by using the Particle Swarm Optimization method is efficient than the conventional Dynamic Programming and Evolutionary Programming Method.

Multi-Area Unit Commitment, Evolutionary Programming, Dynamic Programming Method

S. SELVI, R. DEVI and C. RAJAN, "Multi-Area Unit Commitment Using Hybrid Particle Swarm Optimization Technique with Import and Export Constraints," Engineering, Vol. 1 No. 3, 2009, pp. 140-150. doi: 10.4236/eng.2009.13017.