Renewable energy unit commitment, with different acceptance of balanced power, solved by simulated annealing

Abstract This paper formulates a unit commitment optimisation problem for renewable energy sources distributed in a micro-grid formed by a complex of intelligent buildings of both office and residential characters, including a wide range of amenities. We present a description of the solution of this task using the simulated annealing heuristic optimisation technique. The simple experiment is performed in three different variants of acceptance of balanced power constraining condition. In one of the variants is used fuzzy model of mentioned constraining condition. The experiment was processed in the specialised computer programme.

[1]  T. Numnonda,et al.  Unit commitment by parallel simulated annealing , 1995 .

[2]  Hong-Tzer Yang,et al.  Solving the unit commitment problem with a genetic algorithm through a constraint satisfaction technique , 1996 .

[3]  K. S. Swarp,et al.  Unit Connuitment Solution Methodology Using Genetic Algorithm , 2002, IEEE Power Engineering Review.

[4]  S. M. Shahidehpour,et al.  Combination of Lagrangian-relaxation and linear-programming approaches for fuel-constrained unit-commitment problems , 1989 .

[5]  W. J. Hobbs,et al.  An enhanced dynamic programming approach for unit commitment , 1988 .

[6]  Gerald B. Sheblé,et al.  Unit commitment by genetic algorithm and expert system , 1994 .

[7]  Yuan-Yih Hsu,et al.  Fuzzy dynamic programming: an application to unit commitment , 1991 .

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[10]  A. H. Mantawy,et al.  Unit commitment by tabu search , 1998 .

[11]  S. M. Shahidehpour,et al.  An intelligent dynamic programming for unit commitment application , 1991 .

[12]  Hiroshi Sasaki,et al.  A solution method of unit commitment by artificial neural networks , 1992 .

[13]  Mark O'Malley,et al.  Augmented Hopfield network for unit commitment and economic dispatch , 1997 .

[14]  P. G. Lowery,et al.  Generating Unit Commitment by Dynamic Programming , 1966 .

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

[16]  Arthur I. Cohen,et al.  A Branch-and-Bound Algorithm for Unit Commitment , 1983, IEEE Transactions on Power Apparatus and Systems.

[17]  S. M. Shahidehpour,et al.  A hybrid artificial neural network-dynamic programming approach to unit commitment , 1992 .

[18]  R. Nieva,et al.  Lagrangian Reduction of Search-Range for Large-Scale Unit Commitment , 1987, IEEE Power Engineering Review.

[19]  Antonio J. Conejo,et al.  A Parallel Repair Genetic Algorithm to Solve the Unit Commitment Problem , 2002, IEEE Power Engineering Review.

[20]  P. J. Van Den Bosch,et al.  A Solution of the Unit Commitment Problem Via Decomposition and Dynamic Programming , 1985, IEEE Transactions on Power Apparatus and Systems.

[21]  V. Quintana,et al.  An interior-point/cutting-plane method to solve unit commitment problems , 1999 .

[22]  Narayana Prasad Padhy,et al.  Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms , 2001 .

[23]  K. Manivannan,et al.  Neural Based Tabu Search method for solving unit commitment problem , 2002 .

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

[25]  Gerald B. Sheblé,et al.  Unit commitment by genetic algorithm with penalty methods and a comparison of Lagrangian search and genetic algorithm—economic dispatch example , 1996 .

[26]  H. A. Smolleck,et al.  A fuzzy logic approach to unit commitment , 1997 .

[27]  Narayana Prasad Padhy,et al.  A hybrid fuzzy neural network-expert system for a short term unit commitment problem , 1997 .

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

[29]  Xiaohong Guan,et al.  Unit Commitment with Identical Units: Successive Subproblem Solving Method Based on Lagrangian Relaxation , 2002, IEEE Power Engineering Review.

[30]  Shokri Z. Selim,et al.  Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem , 1999 .

[31]  F. Albuyeh,et al.  Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit Commitments , 1981, IEEE Transactions on Power Apparatus and Systems.

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

[33]  John R. Birge,et al.  A stochastic model for the unit commitment problem , 1996 .

[34]  J. Birge,et al.  Using integer programming to refine Lagrangian-based unit commitment solutions , 2000 .