|

Improved Ephemeral Search and Nepenthes Algorithms for Diminution of True Power Loss

Авторы: Kanagasabai L. Опубликовано: 16.02.2022
Опубликовано в выпуске: #1(100)/2022  
DOI: 10.18698/1812-3368-2022-1-39-56

 
Раздел: Математика и механика | Рубрика: Вычислительная математика  
Ключевые слова: optimal, reactive power, transmission loss, Ephemeral search, chaotic, adaptive weight, neighbourhood learning, Nepenthes

Аннотация

In this paper Improved Ephemeral Search Algorithm and Nepenthes Algorithm are used for solving the power loss lessening problem. Ephemeral Search Algorithm is physics-based algorithm that mimics the ephemeral actions of switching circuits which made by one or more intermediary switching expedients (like inductor and capacitor circuits). Actions of inductor and capacitor circuits are mathematically formulated to design the algorithm. To improve the convergence rate of the algorithm and Improved Ephemeral Search Algorithm has been designed by integrating chaotic opposition learning approach (to engender superior preliminary populations). Logistic chaos possesses arbitrary, ergodic, and systematic characteristics and chaotic variables used for optimization exploration which features the algorithm to evade local optimum, endorse the population multiplicity. Subsequently an adaptive inertia weighting approach is used (to balance exploration and exploitation capability with good convergence speed) then a neighbour learning (dimension) approach is utilized (to uphold the population assortment with every iteration of weight pursuing). Learning between neighbours (dimensional), modernizing the coordinates of the present entity by means of some data (dimensional) of adjacent entities and the data (dimensional) of an entity is arbitrarily chosen from the total population. Then in this paper Nepenthes Algorithm for solving power loss lessening problem. Nepenthes Algorithm is moulded based on the deeds of Nepenthes plant. Certain plants enthral the prey for reproduction deprived of killing them and quite a few restrain or kill the intruders for protection obstinacies conversely do not digest the physical bodies. Although several plants do engross the nutrients from the numb faunas, hitherto they do not have the competence to kill it. They simply eat the physical bodies found in the topsoil or on the surface of leaf. Every entity is structured rendering to its fitness value in uphill order mode. The highest p Nepenthes plant solutions of the systematized population are measured as the "p Nepenthes plant" plants, NP; however, the left-over solutions (p prey) are the victim (prey). The method of combination is obligatory to simulate the atmosphere of each Nepenthes plant and its victim (prey). In the course of the combination method, the Victim (prey) with the outstanding fitness is allotted to the Rank one Nepenthes plant. In the same way, the consequent preys are allotted to consecutive Nepenthes plants, consistently. When fascination rate is mediocre to the produced capricious value, the prey is successful to spurt from the ploy and Nepenthes plant withstands to propagate. Authenticity of the Ephemeral Search Algorithm, Improved Ephemeral Search Algorithm and Nepenthes Algorithm are substantiated in IEEE 30 bus system. Actual power loss lessening is reached. Proportion of actual power loss lessening is augmented

Please cite this article as:

Lenin Kanagasabai. Improved Ephemeral Search and Nepenthes Algorithms for diminution of true power loss. Herald of the Bauman Moscow State Technical University, Series Natural Sciences, 2022, no. 1 (100), pp. 39--56. DOI: https://doi.org/10.18698/1812-3368-2022-1-39-56

Литература

[1] Lee K.Y., Park Y.M., Ortiz J.L. Fuel-cost minimisation for both real- and reactive-power dispatches. IEEE Proc. C, 1984, vol. 131, no. 3, pp. 85--93. DOI: https://doi.org/10.1049/ip-c.1984.0012

[2] Deeb N.I., Shahidehpour S.M. An efficient technique for reactive power dispatch using a revised linear programming approach. Electr. Power Syst. Res., 1998, vol. 15, iss. 2, pp. 121--134. DOI: https://doi.org/10.1016/0378-7796(88)90016-8

[3] Bjelogrlic M.R., Calovic M.S., Ristanovic P., et al. Application of Newton’s optimal power flow in voltage/reactive power control. IEEE Trans. Power Syst., 1990, vol. 5, iss. 4, pp. 1447--1454. DOI: https://doi.org/10.1109/59.99399

[4] Granville S. Optimal reactive dispatch through interior point method. IEEE Trans. Power Syst., 1994, vol. 9, iss. 1, pp. 136--146. DOI: https://doi.org/10.1109/59.317548

[5] Grudinin N. Reactive power optimization using successive quadratic programming method. IEEE Trans. Power Syst., 1998, vol. 13, iss. 4, pp. 1219--1225. DOI: http://dx.doi.org/10.1109/59.736232

[6] Khan Z., Li Y., Xu Y., et al. Distributed control algorithm for optimal reactive power control in power grids. Int. J. Electr. Power & Energy Syst., 2016, vol. 83, pp. 505--513. DOI: https://doi.org/10.1016/j.ijepes.2016.04.004

[7] Ng Shin Mei R., Sulaiman M.H., Mustaffa Z., et al. Optimal reactive power dispatch solution by loss minimization using moth-flame optimization technique. Appl. Soft Comput., 2017, vol. 59, pp. 210--222. DOI: https://doi.org/10.1016/j.asoc.2017.05.057

[8] Chen G., Liu L., Zhang Z., et al. Optimal reactive power dispatch by improved GSA-based algorithm with the novel strategies to handle constraints. Appl. Soft Comput., 2017, vol. 50, pp. 58--70. DOI: https://doi.org/10.1016/j.asoc.2016.11.008

[9] Naderi E., Narimani H., Fathi M., et al. A novel fuzzy adaptive configuration of particle swarm optimization to solve large-scale optimal reactive power dispatch. Appl. Soft Comput., 2017, vol. 53, pp. 441--456. DOI: https://doi.org/10.1016/j.asoc.2017.01.012

[10] Heidari A.A., Abbaspour R.A., Rezaee Jordehi A. Gaussian bare-bones water cycle algorithm for optimal reactive power dispatch in electrical power systems. Appl. Soft Comput., 2017, vol. 57, pp. 657--671. DOI: https://doi.org/10.1016/j.asoc.2017.04.048

[11] Mouassa S., Bouktir T., Salhi A. Ant lion optimizer for solving optimal reactive power dispatch problem in power systems. Eng. Sci. Technol. an Int. J., 2017, vol. 20, iss. 3, pp. 885--895. DOI: https://doi.org/10.1016/j.jestch.2017.03.006

[12] Mandal B., Roy P.K. Optimal reactive power dispatch using quasi-oppositional teaching learning based optimization. Int. J. Electr. Power & Energy Syst., 2013, vol. 53, pp. 123--134. DOI: https://doi.org/10.1016/j.ijepes.2013.04.011

[13] Khazali A.H., Kalantar M. Optimal reactive power dispatch based on harmony search algorithm. Int. J. Electr. Power & Energy Syst., 2011, vol. 33, iss. 3, pp. 684--692. DOI: https://doi.org/10.1016/j.ijepes.2010.11.018

[14] Tran H.V., Pham T.V., Pham L.H., et al. Finding optimal reactive power dispatch solutions by using a novel improved stochastic fractal search optimization algorithm. TELKOMNIKA, 2019, vol. 17, no. 5, pp. 2517--2526. DOI: http://dx.doi.org/10.12928/telkomnika.v17i5.10767

[15] Polprasert J., Ongsakul W., Dieu V.N. Optimal reactive power dispatch using improved pseudo-gradient search particle swarm optimization. Electr. Power Compon. Syst., 2016, vol. 44, iss. 5, pp. 518--532. DOI: https://doi.org/10.1080/15325008.2015.1112449

[16] Duong T.L., Duong M.Q., Phan V.D., et al. Optimal reactive power flow for large-scale power systems using an effective metaheuristic algorithm. J. Electr. Comput. Eng., 2020, vol. 2020, art. 6382507. DOI: https://doi.org/10.1155/2020/6382507

[17] Han C. An image encryption algorithm based on modified logistic chaotic map. Optik, 2019, vol. 181, pp. 779--785. DOI: https://doi.org/10.1016/j.ijleo.2018.12.178

[18] Taherkhani M., Safabakhsh R. A novel stability-based adaptive inertia weight for particle swarm optimization. Appl. Soft Comput., 2016, vol. 38, pp. 281--295. DOI: https://doi.org/10.1016/j.asoc.2015.10.004

[19] Nadimi-Shahraki M.H., Taghian S., Mirjalili S. An improved grey wolf optimizer for solving engineering problems. Expert Syst. Appl., 2021, vol. 166, art. 113917. DOI: https://doi.org/10.1016/j.eswa.2020.113917

[20] Illinois Center for a Smarter Electric Grid (ICSEG). Available at: https://icseg.iti.illinois.edu (accessed: 25.02.2019).

[21] Dai C., Chen W., Zhu Y., et al. Seeker optimization algorithm for optimal reactive power dispatch. IEEE Trans. Power Syst., 2009, vol. 24, iss. 3, pp. 1218--1231. DOI: https://doi.org/10.1109/TPWRS.2009.2021226

[22] Subbaraj P., Rajnarayan P.N. Optimal reactive power dispatch using self-adaptive real coded Genetic algorithm. Electr. Power Syst. Res., 2009, vol. 79, iss. 2, pp. 374--381. DOI: https://doi.org/10.1016/j.epsr.2008.07.008

[23] Pandya S., Roy R. Particle swarm optimization based optimal reactive power dispatch. Proc. ICECCT, 2015. DOI: https://doi.org/10.1109/ICECCT.2015.7225981

[24] Hussain A.N., Abdullah A.A., Neda O.M. Modified particle swarm optimization for solution of reactive power dispatch. Res. J. Appl. Sci. Eng. Techn., 2018, vol. 15, no. 8, pp. 316--327. DOI: https://doi.org/10.19026/rjaset.15.5917

[25] Vishnu M., Sunil Kumar T.K. An improved solution for reactive power dispatch problem using diversity-enhanced particle swarm optimization. Energies, 2020, vol. 13, iss. 11, art. 2862. DOI: https://doi.org/10.3390/en13112862