Binary differential evolution for the unit commitment problem

Authors:
Ali Keles
Affiliations:
Istanbul Technical University, Istanbul, Turkey
Venue:
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Year:
2007

Citing 4
Cited 1

A Seeded Memetic Algorithm for Large Unit Commitment Problems

Journal of Heuristics
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation

A binary-real-coded differential evolution for unit commitment problem: a preliminary study

MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize operation costs while satisfying the hourly power demand constraints. Various approaches exist in the literature for solving this problem. This paper reports the results of experiments performed on a series of the UCP test data using the binary differential evolution approach combined with a simple local search mechanism. In the future stages of the project, the algorithm will be applied to solve the UCP for the Turkish interconnected power system.