Application of Binary Slime Mould Optimization Algorithm for solving Unit Commitment Problem

Show simple item record

dc.contributor.author Niloy, Md. Ashaduzzaman
dc.contributor.author Rizvi, Mutasim Fuad
dc.contributor.author Rifat, Md. Sayed Hasan
dc.date.accessioned 2022-03-25T06:22:57Z
dc.date.available 2022-03-25T06:22:57Z
dc.date.issued 2021-03-30
dc.identifier.citation [1] Saleh Y Abujarad, MW Mustafa, and JJ Jamian. Recent approaches of unit commitment in the presence of intermittent renewable energy resources: A review. Renewable and Sustainable Energy Reviews, 70:215–223, 2017. [2] Andrew Adamatzky. Simulating strange attraction of acellular slime mould physarum polycephaum to herbal tablets. Mathematical and Computer Modelling, 55(3-4):884–900, 2012. [3] J Mary Anita and I Jacob Raglend. Solution of unit commitment problem using shuffled frog leaping algorithm. In 2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET), pages 109–115. IEEE, 2012. [4] X Bai and H Wei. Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints. IET Generation, Transmission & Distribution, 3(2):182–197, 2009. [5] Huseyin Hakan Balci and Jorge F Valenzuela. Scheduling electric power generators using particle swarm optimization combined with the lagrangian relaxation method. International Journal of Applied Mathematics and Computer Science, 14:411–421, 2004. [6] M Basu. Dynamic economic emission dispatch using nondominated sorting genetic algorithm-ii. International Journal of Electrical Power & Energy Systems, 30(2):140–149, 2008. [7] Madeleine Beekman and Tanya Latty. Brainless but multi-headed: decision making by the acellular slime mould physarum polycephalum. Journal of molecular biology, 427(23):3734–3743, 2015. [8] Madeleine Beekman and Tanya Latty. Brainless but multi-headed: decision making by the acellular slime mould physarum polycephalum. Journal of molecular biology, 427(23):3734–3743, 2015. [9] Syed Basit Ali Bukhari, Aftab Ahmad, Syed Auon Raza, and Muhammad Noman Siddique. A ring crossover genetic algorithm for the unit commitment problem. Turkish Journal of Electrical Engineering & Computer Sciences, 24(5):3862–3876, 2016. [10] W. G. Camp. A method of cultivating myxomycete plasmodia. Bulletin of the Torrey Botanical Club, 63(4):205–210, 1936. [11] K Chandram, N Subrahmanyam, and M Sydulu. Unit commitment by improved pre-prepared power demand table and muller method. International Journal of Electrical Power & Energy Systems, 33(1):106–114, 2011. [12] K Chandrasekaran, S Hemamalini, Sishaj P Simon, and Narayana Prasad Padhy. Thermal unit commitment using binary/real coded artificial bee colony algorithm. Electric Power Systems Research, 84(1):109–119, 2012. 46 [13] K Chandrasekaran and Sishaj P Simon. Optimal deviation based firefly algorithm tuned fuzzy design for multi-objective ucp. IEEE Transactions on power systems, 28(1):460–471, 2012. [14] Chuan-Ping Cheng, Chih-Wen Liu, and Chun-Chang Liu. Unit commitment by lagrangian relaxation and genetic algorithms. IEEE transactions on power systems, 15(2):707–714, 2000. [15] CY Chung, Han Yu, and Kit Po Wong. An advanced quantum-inspired evolutionary algorithm for unit commitment. IEEE Transactions on Power Systems, 26(2):847–854, 2010. [16] Arthur I Cohen and Miki Yoshimura. A branch-and-bound algorithm for unit commitment. IEEE Transactions on Power Apparatus and Systems, (2):444–451, 1983. [17] A Lakshmi Devi and O Vamsi Krishna. Combined economic and emission dispatch using evolutionary algorithms-a case study. ARPN Journal of engineering and applied sciences, 3(6):28–35, 2008. [18] Javad Ebrahimi, Seyed Hossein Hosseinian, and Gevorg B Gharehpetian. Unit commitment problem solution using shuffled frog leaping algorithm. IEEE Transactions on Power Systems, 26(2):573–581, 2010. [19] M Jabbari Ghadi, Alfred Baghramian, and M Hosseini Imani. An ica based approach for solving profit based unit commitment problem market. Applied Soft Computing, 38:487–500, 2016. [20] Moosa Moghimi Hadji and Behrooz Vahidi. A solution to the unit commitment problem using imperialistic competition algorithm. IEEE Transactions on Power Systems, 27(1):117–124, 2011. [21] Kuk-Hyun Han and Jong-Hwan Kim. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. Trans. Evol. Comp, 6(6):580–593, December 2002. [22] Ali Asghar Heidari, Seyedali Mirjalili, Hossam Faris, Ibrahim Aljarah, Majdi Mafarja, and Huiling Chen. Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems, 97:849–872, 2019. [23] RA Jabr. Rank-constrained semidefinite program for unit commitment. International Journal of Electrical Power & Energy Systems, 47:13–20, 2013. [24] Yun-Won Jeong, Woo-Nam Lee, Hyun-Houng Kim, Jong-Bae Park, and Joong-Rin Shin. Thermal unit commitment using binary differential evolution. Journal of Electrical Engineering and Technology, 4(3):323–329, 2009. [25] Yun-Won Jeong, Jong-Bae Park, Se-Hwan Jang, and Kwang Y Lee. A new quantum-inspired binary pso for thermal unit commitment problems. In 2009 15th International Conference on Intelligent System Applications to Power Systems, pages 1–6. IEEE, 2009. 47 [26] Yun-Won Jeong, Jong-Bae Park, Se-Hwan Jang, and Kwang Y Lee. A new quantum-inspired binary pso: application to unit commitment problems for power systems. IEEE Transactions on Power Systems, 25(3):1486–1495, 2010. [27] Bin Ji, Xiaohui Yuan, Xianshan Li, Yuehua Huang, and Wenwu Li. Application of quantuminspired binary gravitational search algorithm for thermal unit commitment with wind power integration. Energy conversion and management, 87:589–598, 2014. [28] Ruiwei Jiang, Jianhui Wang, and Yongpei Guan. Robust unit commitment with wind power and pumped storage hydro. IEEE Transactions on Power Systems, 27(2):800–810, 2011. [29] K. A. Juste, H. Kita, E. Tanaka, and J. Hasegawa. An evolutionary programming solution to the unit commitment problem. IEEE Transactions on Power Systems, 14(4):1452–1459, 1999. [30] Vikram Kumar Kamboj. A novel hybrid pso–gwo approach for unit commitment problem. Neural Computing and Applications, 27(6):1643–1655, 2016. [31] Vikram Kumar Kamboj. A novel hybrid pso–gwo approach for unit commitment problem. Neural Computing and Applications, 27(6):1643–1655, 2016. [32] Vikram Kumar Kamboj, SK Bath, and JS Dhillon. Implementation of hybrid harmony search/random search algorithm for single area unit commitment problem. International Journal of Electrical Power & Energy Systems, 77:228–249, 2016. [33] Noburo Kamiya. The control of protoplasmic streaming. Science, 92(2394):462–463, 1940. [34] Peter Kareiva and Garrett Odell. Swarms of predators exhibit" preytaxis" if individual predators use area-restricted search. The American Naturalist, 130(2):233–270, 1987. [35] S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis. A genetic algorithm solution to the unit commitment problem. IEEE Transactions on Power Systems, 11(1):83–92, 1996. [36] J. Kennedy and R. Eberhart. Particle swarm optimization. In Proceedings of ICNN’95 - International Conference on Neural Networks, volume 4, pages 1942–1948 vol.4, 1995. [37] James Kennedy and Russell C Eberhart. A discrete binary version of the particle swarm algorithm. In 1997 IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, volume 5, pages 4104–4108. IEEE, 1997. [38] Dietrich Kessler. Plasmodial structure and motility. Cell biology of Physarum and Didymium/edited by Henry C. Aldrich, John W. Daniel, 1982. [39] S Khanmohammadi, M Amiri, and M Tarafdar Haque. A new three-stage method for solving unit commitment problem. Energy, 35(7):3072–3080, 2010. 48 [40] Banumalar Koodalsamy, Manikandan Bairavan Veerayan, Chandrasekaran Koodalsamy, and Sishaj Pulikottil Simon. Firefly algorithm with multiple workers for the power system unit commitment problem. Turkish Journal of Electrical Engineering & Computer Sciences, 24(6):4773–4789, 2016. [41] Vijay Kumar and Dinesh Kumar. Binary whale optimization algorithm and its application to unit commitment problem. Neural Computing and Applications, pages 1–29, 2018. [42] Tanya Latty and Madeleine Beekman. Food quality and the risk of light exposure affect patchchoice decisions in the slime mold physarum polycephalum. Ecology, 91(1):22–27, 2010. [43] Tanya Latty and Madeleine Beekman. Speed–accuracy trade-offs during foraging decisions in the acellular slime mould physarum polycephalum. Proceedings of the Royal Society B: Biological Sciences, 278(1705):539–545, 2011. [44] Tanya Latty and Madeleine Beekman. Slime moulds use heuristics based on within-patch experience to decide when to leave. Journal of Experimental Biology, 218(8):1175–1179, 2015. [45] Bei Li, Robin Roche, and Abdellatif Miraoui. Microgrid sizing with combined evolutionary algorithm and milp unit commitment. Applied energy, 188:547–562, 2017. [46] Shimin Li, Huiling Chen, Mingjing Wang, Ali Asghar Heidari, and Seyedali Mirjalili. Slime mould algorithm: A new method for stochastic optimization. Future Generation Computer Systems, 2020. [47] Rammohan Mallipeddi and Ponnuthurai Nagaratnam Suganthan. Unit commitment - a survey and comparison of conventional and nature inspired algorithms. Int. J. Bio-Inspired Comput., 6(2):71–90, April 2014. [48] Seyedali Mirjalili, Amir H Gandomi, Seyedeh Zahra Mirjalili, Shahrzad Saremi, Hossam Faris, and Seyed Mohammad Mirjalili. Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Advances in Engineering Software, 114:163–191, 2017. [49] Seyedali Mirjalili, Seyed Mohammad Mirjalili, and Andrew Lewis. Grey wolf optimizer. Advances in engineering software, 69:46–61, 2014. [50] Toshiyuki Nakagaki, Hiroyasu Yamada, and Tetsuo Ueda. Interaction between cell shape and contraction pattern in the physarum plasmodium. Biophysical chemistry, 84(3):195–204, 2000. [51] Mohsen Nemati, Martin Braun, and Stefan Tenbohlen. Optimization of unit commitment and economic dispatch in microgrids based on genetic algorithm and mixed integer linear programming. Applied energy, 210:944–963, 2018. 49 [52] Nidhi, S. Reddy, R. Kumar, and B. K. Panigrahi. Binary bat search algorithm for unit commitment problem in power system. In 2017 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE), pages 121–124, 2017. [53] Taher Niknam, Amin Khodaei, and Farhad Fallahi. A new decomposition approach for the thermal unit commitment problem. Applied Energy, 86(9):1667–1674, 2009. [54] Weerakorn Ongsakul and Nit Petcharaks. Unit commitment by enhanced adaptive lagrangian relaxation. IEEE Transactions on Power Systems, 19(1):620–628, 2004. [55] Lokesh Kumar Panwar, Srikanth Reddy, and Rajesh Kumar. Binary fireworks algorithm based thermal unit commitment. International Journal of Swarm Intelligence Research (IJSIR), 6(2):87– 101, 2015. [56] Lokesh Kumar Panwar, Srikanth Reddy, Ashu Verma, Bijaya K Panigrahi, and Rajesh Kumar. Binary grey wolf optimizer for large scale unit commitment problem. Swarm and Evolutionary Computation, 38:251–266, 2018. [57] I Jacob Raglend and Narayana Prasad Padhy. Solutions to practical unit commitment problems with operational, power flow and environmental constraints. In 2006 IEEE Power Engineering Society General Meeting, pages 8–pp. IEEE, 2006. [58] I Jacob Raglend, C Raghuveer, G Rakesh Avinash, Narayana Prasad Padhy, and DP Kothari. Solution to profit based unit commitment problem using particle swarm optimization. Applied Soft Computing, 10(4):1247–1256, 2010. [59] Provas Kumar Roy and Ranadhir Sarkar. Solution of unit commitment problem using quasioppositional teaching learning based algorithm. International Journal of Electrical Power & Energy Systems, 60:96–106, 2014. [60] Navid Abdolhoseyni Saber, Mahdi Salimi, and Davar Mirabbasi. A priority list based approach for solving thermal unit commitment problem with novel hybrid genetic-imperialist competitive algorithm. Energy, 117:272–280, 2016. [61] Dimitris N Simopoulos, Stavroula D Kavatza, and Costas D Vournas. Unit commitment by an enhanced simulated annealing algorithm. IEEE Transactions on Power Systems, 21(1):68–76, 2006. [62] P. K. Singhal, R. Naresh, V. Sharma, and Goutham Kumar N. Enhanced lambda iteration algorithm for the solution of large scale economic dispatch problem. In International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014), pages 1–6, 2014. en_US
dc.identifier.uri http://hdl.handle.net/123456789/1282
dc.description Supervised by Dr. Ashik Ahmed, Supervisor and Professor, Electrical and Electronic Engineering Department, Islamic University of Technology (IUT) Boardbazar, Gazipur-1704. en_US
dc.description.abstract The Unit Commitment Problem (UCP) is a complex engineering optimization problem of electrical power generation domain. Determining the scheduling for economic consumption of production assets over a specific period of time is the premier objective of UCP. This paper presents a take on solving UCP with Binary Slime Mould Algorithm (BSMA) optimizer. SMA is a recently developed nature-inspired stochastic optimization technique that imitates the selective vegetative growth of slime mould while foraging. A binarized SMA with constraint handling through heuristic adjustment is proposed and implemented to unit commitment problem to generate optimal scheduling for available power resources. Implementing modern heuristic techniques ensures an efficient solution to this non-linear, non-convex and complex constraint driven optimization problem for any number of generating units with maximum profit. To test BSMA as a UCP optimizer, IEEE standard power generating systems ranging from 10 to 100 units along with IEEE 118-bus system are used and the results are then compared with existing classical, evolutionary and hybridized approaches. The comparison reveals superiority of BSMA over all the classical and evolutionary approaches and most of the hybridized methods that are considered in this paper in terms of total cost and convergence characteristics. en_US
dc.language.iso en en_US
dc.publisher Department of Electrical and Electronic Engineering, Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh en_US
dc.subject Binary Slime Mould Algorithm (BSMA), Heuristic optimization algorithm, Unit Commitment Problem (UCP), Economic Load Dispatch (ELD), Power system optimization. en_US
dc.title Application of Binary Slime Mould Optimization Algorithm for solving Unit Commitment Problem en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search IUT Repository


Advanced Search

Browse

My Account

Statistics