A solution to unit commitment problem using fire works algorithm

doi:10.1016/j.ijepes.2015.11.030

2016-05-01

PRE

B. Saravanan *

C. Kumar

D. P. Kothari

DOI：10.1016/j.ijepes.2015.11.030

原文链接

原文求助

摘要

En 中文

This paper presents a new approach using swarm intelligence algorithm called Fireworks Algorithm applied to determine Unit Commitment and generation cost (UC) by considering prohibited operating zones. Inspired by the swarm behaviour of fireworks, an algorithm based on the explosion (search) process and the mechanisms of keeping the diversity of sparks has been developed to minimize the total generation cost over a given scheduled time period and to give the most cost-effective combination of generating units to meet forecasted load and reserve requirements, while adhering to generator and transmission constraints. The primary focus is to achieve better optimization while incorporating a large and often complicated set of constraints like generation limits, meeting the load demand, spinning reserves, minimum up/down time and including more realistic constraints, such as considering the restricted/prohibited operating zones of a generator. The generating units have certain ranges where operation is restricted based upon physical limitations of machine components or instability, e.g., due to steam valve or vibration in shaft bearings. Therefore, prohibited operating zones as a prominent constraint must be considered. In this paper the incorporating of complicated constraints of an optimization problem into the objective function is not considered by neglecting the penalty term. Numerical simulations have been carried out on 10 - unit 24 - hour system. (C) 2015 Elsevier Ltd. All rights reserved.

Keyword:

Swarm intelligence

Prohibited operating zone

Unit commitment

Evolutionary programming

Spinning reserve

Fireworks algorithm