Two-level, two-objective evolutionary algorithms for solving unit commitment problems

A two-level, two-objective optimization scheme based on evolutionary algorithms (EAs) is proposed for solving power generating Unit Commitment (UC) problems by considering stochastic power demand variations. Apart from the total operating cost to cover a known power demand distribution over the scheduling horizon, which is the first objective, the risk of not fulfilling possible demand variations forms the second objective to be minimized. For this kind of problems with a high number of decision variables, conventional EAs become inefficient optimization tools, since they require a high number of evaluations before reaching the optimal solution(s). To considerably reduce the computational burden, a two-level algorithm is proposed. At the low level, a coarsened UC problem is defined and solved using EAs to locate promising solutions at low cost: a strategy for coarsening the UCÂ problem is proposed. Promising solutions migrate upwards to be injected into the high level EA population for further refinement. In addition, at the high level, the scheduling horizon is partitioned in a small number of subperiods of time which are optimized iteratively using EAs, based on objective function(s) penalized to ensure smooth transition from/to the adjacent subperiods. Handling shorter chromosomes due to partitioning increases method's efficiency despite the need for iterating. The proposed two-level method and conventional EAs are compared on representative test problems.

[1]  Tony Greenfield,et al.  Theory and Problems of Probability and Statistics , 1982 .

[2]  S. M. Shahidehpour,et al.  A heuristic short-term unit commitment , 1991 .

[3]  Minqiang Li,et al.  A floating-point genetic algorithm for solving the unit commitment problem , 2007, Eur. J. Oper. Res..

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

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

[6]  B. Norman,et al.  A solution to the stochastic unit commitment problem using chance constrained programming , 2004 .

[7]  Francisco D. Galiana,et al.  Unit commitment by simulated annealing , 1990 .

[8]  Werner Römisch,et al.  Optimal Power Generation under Uncertainty via Stochastic Programming , 1998 .

[9]  T. Senjyu,et al.  Fuzzy unit commitment scheduling using absolutely stochastic simulated annealing , 2006, IEEE Transactions on Power Systems.

[10]  S. M. Shahidehpour,et al.  A new approach for GenCos profit based unit commitment in day-ahead competitive electricity markets considering reserve uncertainty , 2007 .

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

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

[13]  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 .

[14]  Eva Thorin,et al.  Long-term optimization of cogeneration systems in a competitive market environment , 2005 .

[15]  A. G. Bakirtzis,et al.  Lambda of Lagrangian relaxation solution to unit commitment problem , 2000 .

[16]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[17]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[18]  Bruce F. Wollenberg,et al.  A unit commitment expert system (power system control) , 1988 .

[19]  Chu Kiong Loo,et al.  Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization , 2003, J. Heuristics.

[20]  N.P. Padhy,et al.  Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.

[21]  H. Chen,et al.  Cooperative Coevolutionary Algorithm for Unit Commitment , 2002, IEEE Power Engineering Review.

[22]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

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

[24]  Manfred Morari,et al.  Modeling and control of co-generation power plants: a hybrid system approach , 2004, IEEE Trans. Control. Syst. Technol..

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

[26]  D. Dasgupta,et al.  Thermal unit commitment using genetic algorithms , 1994 .

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

[28]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[29]  S. M. Shahidehpour,et al.  Hydrothermal unit commitment with probabilistic constraints using segmentation method , 1990 .

[30]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

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

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

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

[35]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[36]  P. Carpentier,et al.  Stochastic optimization of unit commitment: a new decomposition framework , 1996 .

[37]  Werner Römisch,et al.  Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty , 2000, Ann. Oper. Res..

[38]  Hong-Tzer Yang,et al.  A parallel genetic algorithm approach to solving the unit commitment problem: implementation on the transputer networks , 1997 .

[39]  Costas Vournas,et al.  Unit commitment by an enhanced simulated annealing algorithm , 2006 .