A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem

Author： Orero S.O. Irving M.R.

Publisher： Elsevier

ISSN： 0378-7796

Source： Electric Power Systems Research, Vol.43, Iss.3, 1997-12, pp. : 149-156

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Unit commitment using a hybrid model between Lagrangian relaxation and genetic algorithm in competitive electricity markets

By Yamin H.Y. Shahidehpour S.M.

Electric Power Systems Research, Vol. 68, Iss. 2, 2003-02 ,pp. : 83-92

Elsevier

Access to resources Recommend Favorite

Solving the unit commitment problem with a genetic algorithm through a constraint satisfaction technique

By Pai-Chuan Y. Hong-Tzer Y. Ching-Lien H.

Electric Power Systems Research, Vol. 37, Iss. 1, 1996-04 ,pp. : 55-65

Elsevier

Access to resources Recommend Favorite

A new genetic-based tabu search algorithm for unit commitment problem

By Mantawy A.H. L. Abdel-Magid Y. Z. Selim S.

Electric Power Systems Research, Vol. 49, Iss. 2, 1999-03 ,pp. : 71-78

Elsevier

Access to resources Recommend Favorite

A New Lagrangian Multiplier Update Approach for Lagrangian Relaxation Based Unit Commitment

By Feng Xiaoming

Electric Power Components and Systems, Vol. 34, Iss. 8, 2006-08 ,pp. : 857-866

Taylor & Francis Ltd

Access to resources Recommend Favorite

A solution for unit commitment using Lagrangian relaxation combined with evolutionary programming

By Duo H. Sasaki H. Nagata T. Fujita H.

Electric Power Systems Research, Vol. 51, Iss. 1, 1999-07 ,pp. : 71-77

Elsevier

Access to resources Recommend Favorite