@article{Lenin_2018, title={AMPLIFIED NELDER-MEAD ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER PROBLEM}, volume={6}, url={https://www.granthaalayahpublication.org/journals/granthaalayah/article/view/IJRG18_A11_1796}, DOI={10.29121/granthaalayah.v6.i11.2018.1131}, abstractNote={<p>This paper presents Hybridization of Simulated Annealing with Nelder-Mead algorithm (SN) is proposed to solve optimal reactive power problem. The proposed Hybridized - Simulated Annealing, Nelder-Mead algorithm starts with a prime solution, which is produced arbitrarily and then the solution is disturbed into partitions. The vicinity zone is created, arbitrary numbers of partitions are selected and variables modernizing procedure is started in order to create a trail of neighbour solutions. This procedure helps the SN algorithm to explore the region around an existing iterate solution. The Nelder- Mead algorithm is used in the last stage in order to progress the most excellent solution found so far and hasten the convergence in the closing stage. The proposed Hybridization of Simulated Annealing with Nelder-Mead algorithm (SN) has been tested in standard IEEE 57,118 bus systems and simulation results show the superior performance of the proposed SN algorithm in reducing the real power loss and voltage profiles are within the limits.</p>}, number={11}, journal={International Journal of Research -GRANTHAALAYAH}, author={Lenin, K.}, year={2018}, month={Nov.}, pages={299–306} }