Every time you flip a light switch, electricity races through a vast web of wires, transformers and substations known as the distribution network. Unlike the high-voltage transmission backbone that carries power across continents, this final layer of the grid is the part you actually interact with, and it is also where a surprising amount of energy quietly disappears. Resistance in cables bleeds off power as heat, and the losses depend heavily on how the network is wired together. Now, a team of researchers in China has developed an artificial intelligence method that can reconfigure these networks on the fly, finding wiring arrangements that slash energy waste while keeping the lights on reliably. The work, published in Cluster Computing, could help utilities squeeze more capacity out of existing infrastructure at a moment when electricity demand is climbing and renewable energy is making grid operations more unpredictable than ever.
The technique, called a graph-guided data-driven evolutionary algorithm with multi-feature weight-fused modeling, or GGDDEA-MFWM, was developed by Ruxin Zhao, Jiajie Kang and colleagues at Yangzhou University, along with Chang Liu of Yangzhou Polytechnic Institute. Their target is a notoriously difficult optimization problem known as distribution network reconfiguration. In principle, the idea is simple: distribution networks contain normally open switches and normally closed switches, and by changing which lines are active, operators can reroute power flows to reduce losses, relieve overloaded equipment and stabilize voltages. In practice, the number of possible switch combinations explodes combinatorially with network size, and every candidate configuration must satisfy strict engineering constraints, including that the network remain connected and radial, meaning power flows along tree-like structures without loops, and that voltages and currents stay within safe limits.
Compounding the difficulty is the rise of renewable energy. Solar panels and wind turbines inject power at scattered points across the network, and their output fluctuates with weather and time of day. That variability means a switch configuration that minimizes losses at noon may perform poorly at dusk, and the physics of power flow shifts continuously as injections change. Traditional approaches either evaluate every candidate configuration with full power-flow simulations, which is computationally expensive, or rely on heuristic rules that can miss the best solutions. The Yangzhou team took a third path: use machine learning to build fast surrogate models that approximate the expensive physics, then let an evolutionary algorithm search the vast space of configurations guided by those models.
The heart of the method is its multi-feature weight-fused modeling. Rather than training a single predictor of power loss, the researchers trained three separate radial basis function models, each capturing the relationship between power loss and a different family of physical features: voltage characteristics, current characteristics and network topology. Radial basis function networks are a class of machine learning models that interpolate from known data points, making them well suited to approximating smooth physical relationships. Because each model captures a different aspect of how the grid behaves, fusing their predictions can yield more accurate estimates than any single model alone. But how much should each model be trusted? The answer changes with the amount of empirical data available, the scale of the network and the density of feature distributions in the data.
To handle that variability, the team dynamically tuned each model’s k value, a parameter controlling how many neighboring data points influence the model’s prediction, balancing prediction accuracy against computational efficiency under changing conditions. Then, to resolve the uncertainty in how much each feature model should contribute to the final prediction, they turned to an optimization technique called sequential least squares programming, or SLSQP. This method assigns optimal weights to the three models according to their prediction errors, so a model that is performing well on the current network state earns more influence, while a poorly performing one is downweighted. The result is a surrogate ensemble that adapts itself to the problem at hand rather than relying on fixed assumptions about which features matter most.
The second major innovation addresses a bottleneck specific to network reconfiguration: generating feasible topologies. In a generic evolutionary algorithm, candidate solutions are created by randomly modifying branches, opening some switches and closing others. But most random modifications produce invalid networks, ones with loops that violate radiality or disconnected islands that leave customers without power. Filtering out these invalid candidates wastes enormous computational effort. The researchers’ graph-guided adaptive recombination strategy instead starts from minimum spanning trees, the tree-like subnetworks that connect all nodes with the fewest possible active branches, and iteratively generates new feasible topologies from there. By performing comparative analysis on candidate structures, the strategy also retains configurations with structural advantages, so useful wiring patterns survive across generations rather than being discarded by blind random mutation.
To test their approach, the researchers ran comparative experiments on three standard benchmark systems from the Institute of Electrical and Electronics Engineers: the IEEE 123-bus, 141-bus and 295-bus distribution networks, which represent increasingly large and realistic grid scenarios. They pitted GGDDEA-MFWM against five competing algorithms, including SRK-DDEA, TT-DDEA, MS-DDEO, CL-DDEA and BDDEA-LDG, each representing a different state-of-the-art strategy for data-driven evolutionary optimization. The evaluation went beyond simple performance comparisons. The team applied Wilcoxon statistical tests to verify that the observed advantages were statistically significant rather than artifacts of random variation, and they conducted ablation studies, systematically removing each of the three core strategies to confirm that all of them contributed essentially to the algorithm’s performance.
The results showed that the new algorithm achieved superior topology optimization for power loss reduction across the benchmark systems, with statistically significant performance advantages over all five competitors. The ablation studies were particularly telling: removing any one of the three core components, the multi-feature surrogate modeling, the dynamically weighted model integration or the graph-guided recombination strategy, degraded performance, demonstrating that the pieces work together as an integrated whole rather than as interchangeable tricks. For utilities, the practical implication is that an algorithm like this could, in principle, continuously adjust network switching as conditions change, reducing losses that today are simply accepted as the cost of doing business.
The broader context makes the work timely. Distribution networks worldwide were designed for one-way power flows from centralized plants to passive consumers. Rooftop solar, electric vehicles, battery storage and smart buildings are turning them into dynamic, bidirectional systems, and operators need tools that can keep pace. Data-driven evolutionary optimization has emerged as a powerful framework for such problems because it can search enormous combinatorial spaces without requiring exact analytical models, using learned surrogates to stand in for expensive simulations. The Yangzhou team’s contribution is a careful engineering of that framework for the specific physics and constraints of power distribution, from radiality requirements to the shifting importance of voltage, current and topological features.
Challenges remain before such algorithms move from benchmark feeders to live grids. Real networks carry measurement noise, unbalanced loads and protection coordination requirements that the clean IEEE test systems do not fully capture, and the researchers note that data will be made available on request, inviting further scrutiny and replication. The work was supported by the National Natural Science Foundation of China and the Natural Science Foundation of Jiangsu Province. Still, the study offers a concrete demonstration that machine-learned surrogates, intelligently fused and guided by the graph structure of the grid itself, can tame one of power engineering’s hardest combinatorial problems. As grids grow more complex and the margin for waste shrinks, algorithms that can rewire the network in seconds rather than hours may become as essential as the wires themselves.
Subject of Research: Data-driven evolutionary optimization of distribution network reconfiguration using graph-guided surrogate modeling
Article Title: Graph-guided data-driven evolutionary algorithm with multi-feature weight-fused modeling for distribution network reconfiguration optimization
Article References: Zhao, R., Kang, J., Yang, L., Fu, L., Liu, C., Jiang, C., & Shi, Y. (2026). Graph-guided data-driven evolutionary algorithm with multi-feature weight-fused modeling for distribution network reconfiguration optimization. Cluster Computing, 29(13), Article 745. https://doi.org/10.1007/s10586-026-06552-5
Image Credits: AI Generated
DOI: 10.1007/s10586-026-06552-5
Keywords: distribution network reconfiguration, evolutionary algorithm, surrogate modeling, radial basis function, power loss reduction, smart grid, renewable energy integration, graph-guided optimization, IEEE test feeders, multi-feature fusion, SLSQP, Cluster Computing