Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Guangdong University of Technology》 2017-06
Add to Favorite Get Latest Update

Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm

Ma Liu-yang;Meng An-bo;Yin Hao;School of Automation, Guangdong University of Technology;  
With regard to the characteristics of the unit commitment problem, a hybrid crisscross optimization algorithm(CSO) is proposed, discrete CSO and continuous CSO are used for the unit status scheduling and power economic dispatch, respectively. In the process of evolution, horizontal crossover performs crossover on the same dimension of different particles to guarantee the global convergence ability, and vertical crossover performs crossover on different dimensions of the same particle to overcome the local optimal convergence, and the perfect combination of the two crossovers by a competitive algorithm not only speeds up the convergence rate but also ensures the ability of the global constraints. The heuristic strategy is introduced to modify the constraint conditions,such as the minimum up and down time and the power balance, which can effectively improve the accuracy of the solution. The feasibility and superiority of the proposed algorithm are verified by the simulation of two examples and the comparison with other algorithms.
【Fund】: 广东省科技计划项目(2016A010104016);; 广东电网公司科技项目(GDKJQQ20152066)
【CateGory Index】: TM73
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved