Cart (Loading....) | Create Account
Close category search window

Unit commitment by heuristics and absolutely stochastic simulated annealing

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 $31
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

5 Author(s)
Saber, A.Y. ; Fac. of Eng., Univ. of the Ryukyus, Nishihara ; Senjyu, T. ; Miyagi, T. ; Urasaki, N.
more authors

A new approach to unit commitment problem is presented using absolutely stochastic simulated annealing method. In every iteration, a solution is taken with a certain probability. Typically in simulated annealing minimisation method, a higher cost feasible solution is accepted with temperature-dependent probability; however, other solutions are accepted deterministically. That may lead to the near optimisation slowly. However, all the solutions of both higher and lower costs, are associated with acceptance probabilities to make an early jump from one local minimum to other so that it can search and compare more local minima within the same time/iteration limit. Besides, the number of bits flipping is decided by the appropriate distribution. Excess units with system-dependent probability distribution handle constraints efficiently. Sensitivity of the distribution parameters is tolerable. To reduce economic load dispatch calculations, a sign bit vector is introduced as well. The proposed method is then tested using the reported problem data set. Simulation results are compared to previous reported results. Numerical results show an improvement in solution cost and time compared to the results obtained from powerful algorithms

Published in:

Generation, Transmission & Distribution, IET  (Volume:1 ,  Issue: 2 )

Date of Publication:

March 2007

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.