A Hybrid TLBO-Cheetah Algorithm for Multi-Objective Optimization of SOP-Integrated Distribution Networks

The integration of Soft Open Points (SOPs) into distribution networks has been an essential method for enhancing operational flexibility and efficiency. But simultaneous optimization of network reconfiguration and SOP scheduling constitutes a difficult mixed-integer nonlinear programming (MINLP) problem that is likely to suffer from premature convergence with standard metaheuristic solvers, particularly in large power networks. This paper proposes a novel hybrid algorithm, hTLBO–CO, which synergistically integrates the exploitative capability of Teaching–Learning-Based Optimization (TLBO) with the explorative capability of the Cheetah Optimizer (CO). One of the notable contributions of our framework is an in-depth problem formulation that enables SOP locations on both tie and sectionalizing switches with an efficient constraint-handling scheme, preserving topo-logical feasibility through a minimum spanning tree repair scheme. The evolved hTLBO–CO algorithm is systematically validated across IEEE 33-, 69-, and 119-bus test feeders with differential operational scenarios. Results indicate consistent dominance over established metaheuristics (TLBO, CO, PSO, JAYA), showing significant efficiency improvement in power loss minimization, voltage profile enhancement, and convergence rate. Remarkably, in a situation with a large-scale 119-bus power grid, hTLBO–CO registered a significant 50.30% loss reduction in the single-objective reconfiguration-only scheme, beating existing state-of-the-art approaches by over 15 percentage points. These findings, further substantiated by comprehensive statistical and multi-objective analyses, confirm the proposed framework’s superiority, robustness, and scalability, establishing hTLBO–CO as a robust computational tool for the advanced optimization of future distribution networks.