Minimization of Active power loss by using Hybridization of Simulated Annealing and Nelder-Mead algorithm

In this paper, Hybridization of Simulated Annealing and Nelder-Mead (SANM) algorithm is proposed to solve optimal reactive power dispatch problem. The new-fangled algorithm (SANM) starts with a primary solution, which is generated arbitrarily and then the solution is alienated into partitions. The neighbourhood zone is generated, arbitrary number of partitions are selected and variables updating procedure is starting in order to generate a trail neighbour solutions. This process helps the SANM algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to progress the best solution found so far and accelerates the convergence in the final stage. The proposed SANM has been tested on standard IEEE 30 test system and simulation results show the better performance of the proposed algorithm in reducing the real power loss.