Unit Commitment Scheduling Using a Hybrid ANN and Lagrangian Relaxation Method

A hybrid artificial neural network (ANN) Lagrangian relaxation approach to combinatorial optimization problems in power systems, in particular to unit commitment is presented in this paper. Until now, the Lagrangian relaxation method has been studied as it appeared to be the most practical method for obtaining an approximate solution to unit commitment. Based on the use of supervised learning neural-net technology and the adaptive pattern recognition concept, which presume the relationship between power demand pattern and Lagrange multipliers (LMPs). The numerical results obtained are very encouraging.

[1]  Haruki Matsuura,et al.  Power generation scheduling by neural network , 1992 .

[2]  A. Merlin,et al.  A New Method for Unit Commitment at Electricite De France , 1983, IEEE Transactions on Power Apparatus and Systems.

[3]  D.R. Hush,et al.  Progress in supervised neural networks , 1993, IEEE Signal Processing Magazine.

[4]  Richard C. Wilson,et al.  An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems , 1968 .

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

[6]  Walter L. Snyder,et al.  Dynamic Programming Approach to Unit Commitment , 1987, IEEE Transactions on Power Systems.