Binary real coded firefly algorithm for solving unit commitment problem

被引:66
作者
Chandrasekaran, K. [1 ]
Simon, Sishaj P. [2 ]
Padhy, Narayana Prasad [3 ]
机构
[1] Kamaraj Coll Engn & Technol, Dept EEE, Virudunagar 620001, India
[2] Natl Inst Technol, Dept EEE, Tiruchirappalli 620015, Tamil Nadu, India
[3] Indian Inst Technol, Dept EE, Roorkee 247667, Uttar Pradesh, India
关键词
Binary real coded firefly algorithm; Economic dispatch problem; Unit commitment problem; ANT COLONY OPTIMIZATION; GENETIC ALGORITHM; NETWORK;
D O I
10.1016/j.ins.2013.06.022
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a new biologically-inspired binary real coded firefly (BRCFF) algorithm to solve the unit commitment problem (UCP) by considering system and generating unit constraints. The firefly (FF) algorithm is inspired by the flashing behavior of fireflies and the phenomenon of bioluminescent communication. Upon solving UCP, the proposed binary coded FF algorithm determines the ON/OFF status of the generating units, while the economic dispatch problem (EDP) is solved using the real coded FF algorithm. The manner of firefly communication through luminescent flashes and their synchronization is imitated and suitably implemented in UCP. An effective constraint handling mechanism is introduced to solve complicated system and unit constraints. Finally, the proposed algorithm is applied to 3, 12, 17, 26, and 38 generating unit systems for a 24 h scheduling horizon and a comparative study is conducted using other recently reported results. Numerical results clarify and verify the significance of the proposed algorithm. The results obtained indicate that the proposed biologically-inspired algorithm could be an important player in swarm-based optimization. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:67 / 84
页数:18
相关论文
共 59 条
[1]  
[Anonymous], 2010, Int. J. Ind. Eng. Comput, DOI DOI 10.5267/J.IJIEC.2010.01.001
[2]  
Apostolopoulos T., 2010, International Journal of Combinatorics, V2011, P1, DOI [DOI 10.1155/2011/523806, 10.1155/2011/523806]
[3]   A T-cell algorithm for solving dynamic optimization problems [J].
Aragon, Victoria S. ;
Esquivel, Susana C. ;
Coello Coello, Carlos A. .
INFORMATION SCIENCES, 2011, 181 (17) :3614-3637
[4]   Analysis of Optimal Spinning Reserve Procurement with Demand Response Resources Under Social Cost Minimization [J].
Behrangrad, Mahdi ;
Sugihara, Hideharu ;
Funaki, Tsuyoshi .
IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2011, 6 (03) :211-220
[5]  
Billinton R., 1994, RELIABILITY EVALUATI, DOI DOI 10.1007/978-1-4615-7731-7
[6]   A self-optimizing mobile network: Auto-tuning the network with firefly-synchronized agents [J].
Bojic, Iva ;
Podobnik, Vedran ;
Ljubi, Igor ;
Jezic, Gordan ;
Kusek, Mario .
INFORMATION SCIENCES, 2012, 182 (01) :77-92
[7]  
Burns RM, 1975, PROCEEDING IEEE POWE, P453
[8]   Optimal Thermal Unit Commitment Integrated with Renewable Energy Sources Using Advanced Particle Swarm Optimization [J].
Chakraborty, Shantanu ;
Senjyu, Tomonobu ;
Saber, Ahmed Yousuf ;
Yona, Atsushi ;
Funabashi, Toshihisa .
IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2009, 4 (05) :609-617
[9]  
Chandrasekaran K., 2012, INT REV ELECTR ENG-I, V7, P199
[10]   BRANCH-AND-BOUND SCHEDULING FOR THERMAL GENERATING-UNITS [J].
CHEN, CL ;
WANG, SC .
IEEE TRANSACTIONS ON ENERGY CONVERSION, 1993, 8 (02) :184-189