2008•Unpublished venueRequires access

Evolutionary Algorithms for the Unit Commitment Problem

A. Şima Uyar, Belgin Emre Türkay

Open publisher page 27 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Memetic algorithm, Benchmark (surveying), Differential evolution, Evolutionary algorithm, Evolutionary computation, Computer science, Set (abstract data type), Genetic algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Evolutionary Algorithms for the Unit Commitment Problem — Research Paper | ScholarLens