The aim of this paper is to solve the optimal reactive power dispatch (ORPD) prob lem. Metaheuristic algorithms have b een extensively used to solve optimization problems in a reasonab le time without requiring in-depth knowledge of the treated prob lem. The perform ance of a metaheuristic requires a compromise b etween exploitation and exploration of the search space. However, it is rarely to have the two characteristics in the same search method, where the current emergence of hyb rid methods. This paper presents a hyb rid formulation b etween two different metaheuristics: differential evolution (b ased on a population of solution) and simulated annealing (b ased on a unique solution) to solve ORPD. The first one is characterized with the high capacity of exploration, whil e the second has a good exploitation of the search space. For the control variab les, a mixed representation (continuous/discrete), is proposed. The rob ustness of the method is tested on the IEEE 30 b us test system.