Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning
TenneT's congestion planning solved with exact Pareto front enumeration...
A team of researchers from Vrije Universiteit Amsterdam and TenneT TSO has introduced a pair of algorithms to tackle day-ahead transmission topology planning as a sequential multi-objective optimization problem. Their block algorithm achieves exact enumeration of the complete Pareto front by exploiting the temporal block structure of feasible switching strategies. With fixed bounds on topological depth and number of switch actions, the evaluation count grows polynomially with the planning horizon—enabling it to compute the full front for a highly congested day on the Dutch high-voltage grid in under three minutes.
Complementing the exact method, the authors also developed a multi-objective evolutionary algorithm based on NSGA-III, enhanced with structure-guided initialization and problem-specific variation operators. While this heuristic converges toward the Pareto front, it does not fully recover the exact set. The four operational objectives—worst-case line loading under N-1 security, topological depth, number of switching actions, and time spent in non-reference topologies—reflect real TSO decision criteria. The block algorithm thus serves both as a practical decision-support tool for grid operators and as a ground-truth benchmark for future heuristic and learning-based methods in transmission topology planning.
- Block algorithm enumerates exact Pareto front for 24-hour congestion planning with polynomial complexity in horizon length
- Four real-world TSO objectives: N-1 line loading, topological depth, switching actions, non-reference topology time
- Validation on real Dutch grid data from TenneT—full front computed in under 3 minutes
Why It Matters
Grid operators get a fast, exact tool for congestion management, enabling better AI benchmarks for energy infrastructure.