A genetic algorithm solution to the unit commitment problem

Abstract

This paper presents a genetic algorithm (GA) solution to the unit commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple GA algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the varying quality function technique and adding problem specific operators, satisfactory solutions to the unit commitment problem were obtained. Test results for power systems of up to 100 units and comparisons with results obtained using Lagrangian relaxation and dynamic programming are also reported.