Analysis of unit commitment problem through Lagrange relaxation and priority listing method

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

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

[3]  M. R. Mohan,et al.  An evolutionary programming-based tabu search method for solving the unit commitment problem , 2004, IEEE Transactions on Power Systems.

[4]  C. C. A. Rajan,et al.  A hybrid approach based on PSO and EP for proficient solving of Unit Commitment Problem , 2011, International Conference and Utility Exhibition on Green Energy for Sustainable Development.

[5]  Lawrence Hasdorff,et al.  Economic Dispatch Using Quadratic Programming , 1973 .

[6]  S. Saravanan,et al.  Performance Analysis of DVS Algorithms for Reducing Processor Energy Consumption , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[7]  Farid Benhamida,et al.  Enhanced Lagrangian relaxation solution to the generation scheduling problem , 2010 .