Fast Algorithm About Unit Commitment Based on Revised BP Artificial Neural Network and Dynamic Search
CSTR:
Author:
Affiliation:

Clc Number:

TM732

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to reduce the operation cost and optimize the unit commitment,the fast algorithm about unit commitment based on revised BP ANN(Artificial Neural Network) and dynamic search is discussed.The BP ANN is trained with Levenberg-Marquardt algorithm,which aiming at its drawback of the storage of some matrices that can be quite large for certain problems,and a revised algorithm is presented.The BP ANN is used to generate a pre-schedule according to the input load profile.Then the dynamic search is performed some stages where the commitment states of some of the units are not certain.The experimental results indicate that the proposed algorithm can reduce the execution time and memory space without degrading the quality of the generation schedule.

    Reference
    Related
    Cited by
Get Citation

关仲 陈刚 张忠静 朱小军 谢松.人工神经网络与动态搜索的机组组合算法[J].重庆大学学报,2006,29(10):29~32

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 17,2006
  • Revised:June 17,2006
  • Adopted:
  • Online:
  • Published:
Article QR Code