| Summary: | The reconfiguration of distribution networks plays a crucial role in minimizing active power losses and enhancing reliability, but the problem becomes increasingly complex with the integration of distributed generation (DG). Traditional optimization methods and even earlier hybrid metaheuristics often suffer from premature convergence or require problem reformulations that compromise feasibility. To overcome these limitations, this paper proposes a novel hybrid algorithm that couples Particle Swarm Optimization (PSO) with Simulated Annealing (SA) through an adaptive inertia weight mechanism derived from the Lundy–Mees cooling schedule. Unlike prior hybrid approaches, our method directly addresses the original non-convex, combinatorial nature of the Distribution Network Reconfiguration (DNR) problem without convexification or post-processing adjustments. The main contributions of this study are fourfold: (i) proposing a PSO-SA hybridization strategy that enhances global exploration and avoids stagnation; (ii) introducing an adaptive inertia weight rule tuned by SA, more effective than traditional schemes; (iii) applying a stagnation-based stopping criterion to speed up convergence and reduce computational cost; and (iv) validating the approach on 5-, 33-, and 69-bus systems, with and without DG, showing robustness, recurrence rates above 80%, and low variability compared to conventional PSO. Simulation results confirm that the proposed PSO-SA algorithm achieves superior performance in both loss minimization and solution stability, positioning it as a competitive and scalable alternative for modern active distribution systems.
|
|---|
