Unit commitment - a survey and comparison of conventional and nature inspired algorithms
by Rammohan Mallipeddi; Ponnuthurai Nagaratnam Suganthan
International Journal of Bio-Inspired Computation (IJBIC), Vol. 6, No. 2, 2014

Abstract: Unit commitment problem (UCP) which has a significant influence on secure and economic operation of power systems is considered to be one of the most difficult optimisation problems due to the number/type of variables and constraints present. To provide quality solutions to UCP several solution methodologies that include deterministic and stochastic search algorithms have been proposed. Deterministic and stochastic algorithms have their own share of advantages and disadvantages. In this paper, we provide a literature survey on the algorithms developed for UCP and try to compare their performance on some standard benchmark problems by taking the results from the literature. The literature survey along with the performance comparison will be useful for the researchers in the area of power engineering.

Online publication date: Sat, 27-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com