Reference Hub25
Binary Fireworks Algorithm Based Thermal Unit Commitment

Binary Fireworks Algorithm Based Thermal Unit Commitment

Lokesh Kumar Panwar, Srikanth Reddy K, Rajesh Kumar
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 15
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466678286|DOI: 10.4018/IJSIR.2015040104
Cite Article Cite Article

MLA

Panwar, Lokesh Kumar, et al. "Binary Fireworks Algorithm Based Thermal Unit Commitment." IJSIR vol.6, no.2 2015: pp.87-101. http://doi.org/10.4018/IJSIR.2015040104

APA

Panwar, L. K., Srikanth Reddy K, & Kumar, R. (2015). Binary Fireworks Algorithm Based Thermal Unit Commitment. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 87-101. http://doi.org/10.4018/IJSIR.2015040104

Chicago

Panwar, Lokesh Kumar, Srikanth Reddy K, and Rajesh Kumar. "Binary Fireworks Algorithm Based Thermal Unit Commitment," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 87-101. http://doi.org/10.4018/IJSIR.2015040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper presents the first application of fireworks algorithm to solve thermal unit commitment and scheduling problem. The scheduling problem accompanied by many constraints i.e., equality constraints like load balance and inequality constraints like system reserve and bounds like power generation, up/down time and ramp rate limits, finally shapes into a complex optimization problem. In this work, the scheduling and commitment problem is solved using binary fireworks algorithm (BFWA), which mimics explosion of fireworks in the sky to define search space and distance between associated sparks to evaluate global minimum. Further, the effectiveness of fireworks pertaining to problem dimension, wide range of generation units from 10 to 100 are considered and evaluated. In addition, simulations results are compared to the existing optimization techniques in literature used for unit commitment and scheduling problem and it is observed that, BFWA is superior to some of the profound existing algorithms in achieving near optimal scheduling.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.