By Topic

Short-term generation scheduling with reliability constraint using ant colony optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Libao Shi ; Dept. of Electr. Eng., Shanghai Jiao Tong Univ., China ; Jin Hao ; Jiaqi Zhou ; Guoyu Xu

The ant colony optimization algorithm is applied to the solution of optimal unit commitment (UC) with probabilistic spinning reserve determination. In general, the purpose of UC is to enhance the economical efficiency as could as possible while simultaneously satisfying physical and operation constraints of individual unit. Consider the possibility of generating unit failure, the requirement, the sufficient spinning reserve capacity to ensure adequate reliability levels, must be satisfied by the commitment schedule. The security function approach is applied to evaluate the desired level of system security, and the ACO approach is adopted to solve the UC problems. The effectiveness of the ACO method has been demonstrated on the corresponding numerical results. Further, the sensitivity of the desired security level to the optima during optimization is investigated in this paper.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:6 )

Date of Conference:

15-19 June 2004