Fast technique for unit commitment by genetic algorithm based on unit clustering

The paper presents a new approach to the large-scale unit-commitment problem. To reduce computation time and to satisfy the minimum up/down-time constraint easily, a group of units having analogous characteristics is clustered. Then, this ‘clustered compress’ problem is solved by means of a genetic algorithm. Besides, problem-oriented powerful tools such as relaxed-pruned ELD, intelligent mutation, shift operator etc. make the proposed approach more effective with respect to both cost and execution time. The proposed algorithm is tested using the reported problem data set. Simulation results for systems of up to 100-unit are compared with previous reported results. Numerical results show an improvement in the solution cost compared with the results obtained from a genetic algorithm with standard operations.

[1]  Gerald B. Sheblé,et al.  A profit-based unit commitment GA for the competitive environment , 2000 .

[2]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

[3]  Malcolm Irving,et al.  Large scale unit commitment using a hybrid genetic algorithm , 1997 .

[4]  A. J. Svoboda,et al.  A new unit commitment method , 1997 .

[5]  Tomonobu Senjyu,et al.  Fast solution technique for large-scale unit commitment problem using genetic algorithm , 2003 .

[6]  D. Bertsekas,et al.  Solution of Large-Scale Optimal Unit Commitment Problems , 1982, IEEE Transactions on Power Apparatus and Systems.

[7]  A. H. Mantawy,et al.  A simulated annealing algorithm for unit commitment , 1998 .

[8]  A. J. Svoboda,et al.  Short-term resource scheduling with ramp constraints [power generation scheduling] , 1997 .

[9]  L. Jenkins,et al.  Simulated annealing with local search-a hybrid algorithm for unit commitment , 2002 .

[10]  A. Bakirtzis,et al.  A solution to the unit-commitment problem using integer-coded genetic algorithm , 2004, IEEE Transactions on Power Systems.

[11]  Gerald B. Sheblé,et al.  Genetic-based unit commitment algorithm , 1996 .

[12]  Chuan-Ping Cheng,et al.  Unit commitment by Lagrangian relaxation and genetic algorithms , 2000 .

[13]  Alice E. Smith,et al.  A Seeded Memetic Algorithm for Large Unit Commitment Problems , 2002, J. Heuristics.

[14]  Eiichi Tanaka,et al.  An Evolutionary Programming Solution to the Unit Commitment Problem , 1997 .