An International Journal House

Einstein International Journal Organization(EIJO)

Connecting People With Genius Thought

Einstein International Journal Organization(EIJO) is an international Genius Thought journals platform .
Articles
Current
Archive
Special
Editorial Board
Paper In Publication Desk
Author Instruction
Author Desk
Call for Paper
Upcoming Journals and Books
Indexing of ASIO Journals
Author Instructions for Manuscript
Model Manuscript
Covering Letter
Publication Charges
Our Journals
EIJO Journal of Engineering, Technology and Innovative Research (EIJO – JETIR) [ ISSN : 2455 - 9172 ]
EIJO Journal of Ayurveda, Herbal Medicine and Innovative Research (EIJO – AHMIR) [ ISSN : 2456 - 530X ]
EIJO Journal of Bio- Technology, Food Technology, Agriculture and Innovative Research (EIJO – JBTFTAIR) [ISSN : 2455 - 992X ]
EIJO Journal of Science, Technology and Innovative Research (EIJO – JSTIR) [ ISSN : 2455 - 9938 ]
EIJO Journal of Humanities, Social Affair, Management and Innovative Research (EIJO – JHSAMIR) [ ISSN : 2455 - 927X ]
EIJO Journal of Civil Engineering, Architecture, Interior Design and Innovative Research (EIJO–CEAIDIR) [ISSN: 2456 - 1819]
JOURNALS || EIJO Journal of Engineering, Technology and Innovative Research (EIJO – JETIR) [ ISSN : 2455 - 9172 ]
Solution of Unit Commitment Problem Using Monarch Butterfly Algorithm

Author Names : Babu Lal Samota1,Deepak Sharma2, Rajkumar Kaushik3,  Volume 4 Issue 4
Article Overview

Abstract  

In this paper, monarch butterfly algorithm (MBA) is used to solve the short-term unit commitment problem (UCP) and the enhanced lambda iteration (ELI) method is used to solve the economic dispatch (ED) sub-problem. Based on MBA, the migration and butterfly adjusting operators have been utilized in the operation of MBA and thus, enhanced the quality of the solution. Performance of MBA is tested on 2 test systems comprising of 4-unit and 10-unit over the scheduling time horizon of 8 hours and 24 hours respectively. Results demonstrate that the proposed method is superior to the other reported methods in the literature.

Keywords: economic dispatch; monarch butterfly algorithm; unit commitment

Reference
  1. A.J. Wood, and B.F. Wollenberg, Power Generation, Operation and Control, 2nd ed. India: Wiley, 2007, pp. 131-155.
  2. T. Senjyu, K. Shimabukuro, K. Uezato, and T. Funabashi, “A fast technique for unit commitment problem by extended priority list,” IEEE Trans. Power Syst., vol. 18, no. 2, pp. 882-888, May 2003.
  3. P.K. Singhal and R.N. Sharma, “Dynamic programming approach for solving power generating unit commitment problem,” in Proc. IEEE Int. Conf. Computer and Communication Technology, Sep. 2011, pp. 298-303. DOI: 10.1109/ICCCT.2011.6075161
  4. C.L. Chen, and S.C. Wang, “Branch-and-bound scheduling for thermal generating units,” IEEE Trans. Energy Convers., vol. 8, no. 2, pp. 184-189, Jun. 1993.
  5. M. Carrion, and J.M. Arroyo, “A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem,” IEEE Trans. Power Syst., vol. 21, no. 3, pp. 1371-1378, Aug. 2006.
  6. P.K. Singhal, “Generation scheduling methodology for thermal units using lagrangian relaxation,” in Proc. 2nd IEEE Int. Conf. Current Trends in Technology, pp. 1-6, Dec 2011.
  7. N. Simopoulos, S.D. Kavatza, and C.D. Vournas, “Unit commitment by an enhanced simulated annealing algorithm,” IEEE Trans. Power Syst., vol. 21, no. 1, pp. 68-76, Feb. 2006.
  8. K.A. Juste, H. Kita, E. Tanaka, and J. Hasegawa, “An evolutionary programming solution to the unit commitment problem,” IEEE Trans. Power Syst., vol. 14, no. 4, pp. 1452-1459, Nov. 1999.
  9. G. G. Wang, S. Deb, and Z. Cui, “Monarch butterfly optimization,” Neural Comput & Applic, 2015. doi: 10.1007/s00521-015-1923-y
  10. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Trans. Evolut. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
  11. X. Yuan, H. Nie, A. Su, L. Wang, and Y. Yuan, “An improved binary particle swarm optimization for unit commitment problem,” Exp. Syst. Appl., vol. 36, pp. 8049–8055, 2009.
  12. D. Datta, and S. Dutta, “A binary-real-coded differential evolution for unit commitment problem,” Int. J. Electric Power Energy Syst., vol. 42, pp. 517-524, 2012.
  13. M. Eslamian, S.H. Hosseinian, and B. Vahidi, “Bacterial foraging-based solution to the unit-commitment problem,” IEEE Trans. Power Syst., vol. 24, no. 3, pp. 1478-1488, Aug. 2009.
  14. M.M. Hadji, and B. Vahidi, “A solution to the unit commitment problem using imperialistic competition algorithm,” IEEE Trans. Power Syst., vol. 27, no. 1, pp. 117-124, Feb. 2012.
  15. Y. Pourjamal, and S.N. Ravadanegh, “HSA based solution to the UC problem,” Int. J. Electric Power Energy Syst., vol. 46, pp. 211-220, 2013.
  16. K. Chandrasekaran, S. Hemamalini, S.P. Simon, and N.P. Padhy, “Thermal unit commitment using binary/real coded artificial bee colony algorithm,” Electr. Power Syst. Res., vol. 84, pp. 109-119, 2012.
  17. C.P. Cheng, C.W. Liu, and C.C. Liu, “Unit commitment by lagrangian relaxation and genetic algorithms,” IEEE Trans. Power Syst., vol. 15, no. 2, pp. 707-714, May 2000
  18. A.H. Mantawy, Y.L.A. Magid, and S.Z. Selim, “A new genetic-based tabu search algorithm for unit commitment problem,” Electr. Power Syst. Res., vol. 49, pp. 71-78, 1999.
  19. C. Wang, and S. M. Shahidehpour, “Effects of ramp-rate limits on unit commitment and economic dispatch,” IEEE Trans. Power Syst., vol. 8, no. 3, pp. 1341-1350, Aug. 1993.
  20. P.K. Singhal, R. Naresh, V. Sharma, and K.N. Goutham, “Enhanced lambda iteration algorithm for the solution of large scale economic dispatch problem,” in Proc. IEEE Int. Conf. Recent Advances and Innovations in Engineering, May 2014, pp. 1-6.  DOI: 10.1109/ICRAIE.2014.6909294