Fast Security Constraint Unit Commitment by Utilizing Chaotic Crow Search Algorithm

Abhishek Patel and Rajesh Anand

MPRA Paper from University Library of Munich, Germany

Abstract: This paper investigates the optimal operation of security constraint unit commitment (SCUC) as one of the most important concern in power system operation. SCUC is a mixed integer nonlinear problem (MINLP) which is hard to solve and also the optimal solution is not guarantee. To overcome this drawback, a new evolutionary method known as the chaotic crow search algorithm is developed. The proposed problem includes some significant constraints such as spinning reserve, generators ramp rate, load balance, and power limits. Finally, the proposed method is examined on a 10-unit distribution network. The results show the effectiveness and merit of the proposed technique.

Keywords: Control and Optimization; Evolutionary Algorithm; Power systems; Reliability; Unit Commitment (search for similar items in EconPapers)
JEL-codes: C0 C3 C8 Z0 (search for similar items in EconPapers)
Date: 2019-05-01
New Economics Papers: this item is included in nep-cmp and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/93971/1/MPRA_paper_93971.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:93971

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().