Binary differential evolution for the unit commitment problem

13 years 11 months ago
Binary differential evolution for the unit commitment problem
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. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods and Search—Scheduling General Terms Algorithms, Design, Economics Keywords Differential Evolution, Binary Differential Evolution, Hill Climbing, Unit Commitment, Economic Dispatch
Ali Keles
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Authors Ali Keles
Comments (0)