Close category search window
 

Binary/real coded particle swarm optimization for unit commitment problem

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

2 Author(s)
Chandrasekaran, K. ; Dept. of Electr. & Electron. Eng., Nat. Inst. of Technol., Tiruchirappalli, India ; Simon, S.P.

This paper presents a new approach for binary and real coded particle swarm optimization (BRPSO) algorithm to solve the unit commitment problem (UCP). On solving UCP, the proposed binary coded PSO finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded PSO. Tanh function is proposed to improve the particle searching mechanism in binary PSO. The proposed methodology is tested and validated on 3, 17, 26 and 38 generating unit system for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.

Published in:
Power, Signals, Controls and Computation (EPSCICON), 2012 International Conference on

Date of Conference: 3-6 Jan. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.