Evolutionary Algorithms for the Unit Commitment Problem

This paper compares three evolutionary computation techniques, namely Steady-State Genetic Algorithms, Evolutionary Strategies and Differential Evolution for the Unit Commitment Problem. The comparison. is based on a set of experiments conducted on benchmark datasets as well as on real-world data obtained from the Turkish Interconnected Power System. The results of two state-of-the-art evolutionary approaches, namely a Generational Genetic Algorithm and a Memetic Algorithm for the same benchmark datasets are also included in. the paper for comparison. The tests show that Differential Evolution is the best performer among all approaches on the test data used in the paper. The performances of the other two evolutionary algorithms are also comparable to Differential Evolution. and the results of the algorithms taken from literature showing that all EA approaches tested here are applicable to the Unit Commitment Problem. The results of this experimental study are very promising and promote further study.