Unit commitment by Genetic Algorithms

This paper presents an application of the Genetic Algorithms (GA) method for the unit commitment problem. Genetic Algorithms (GA's) are a general purpose optimization technique based on principle of natural selection and natural genetics. The La-grangian Relaxation (LR) method provides a fast solution but it may suffer from numerical convergence and solution quality problems. Numerical results on a system of 10 units are compared with results obtained using Lagrange Relaxation (LR) and Genetic Algorithms (GA's), show that the feature of easy implementation, better convergence, and highly near-optimal solution to the UC problem can be achieved by the GA.