{"paper":{"title":"Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","cross_cats":["cs.NE","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Alessandro Zocca, Jan Viebahn, Job Groeneveld, Miguel Mu\\~noz","submitted_at":"2026-05-05T13:38:30Z","abstract_excerpt":"We study day-ahead transmission topology control for high-voltage grid operation under $N-1$ security constraints. The operational task is to select, over a 24-hour horizon, a sequence of substation topologies obtained via busbar-coupler switching to relieve line overloads while limiting switching effort and topological complexity. We formulate this task as a sequential multi-objective optimization problem with four objectives used in TSO decision making: worst-case $N-1$ line loading, maximum topological depth, number of topology changes, and time spent outside the reference topology. We prop"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"that the four chosen operational objectives (N-1 worst-case loading, topological depth, switch count, time in non-reference topologies) sufficiently capture real TSO decision criteria and that the temporal block structure of feasible strategies remains exploitable under realistic operational bounds","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The block algorithm exactly enumerates the Pareto front for sequential multi-objective transmission topology planning in polynomial time for fixed bounds and outperforms a customized NSGA-III heuristic on real TenneT data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7fb8240693e4f7a680fdb8ff6d8f2e53cc47cb1a61d780a582584d678e8fa09a"},"source":{"id":"2605.03753","kind":"arxiv","version":2},"verdict":{"id":"8084af81-4df6-41aa-9c92-6147097a7be1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:27:28.573934Z","strongest_claim":"the block algorithm computes the full Pareto front for a highly congested day in under three minutes","one_line_summary":"The block algorithm exactly enumerates the Pareto front for sequential multi-objective transmission topology planning in polynomial time for fixed bounds and outperforms a customized NSGA-III heuristic on real TenneT data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"that the four chosen operational objectives (N-1 worst-case loading, topological depth, switch count, time in non-reference topologies) sufficiently capture real TSO decision criteria and that the temporal block structure of feasible strategies remains exploitable under realistic operational bounds","pith_extraction_headline":"The block algorithm computes the complete Pareto front for day-ahead transmission topology planning in under three minutes on real data."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03753/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:34:57.568081Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.217214Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:03:33.764724Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"cc6fe68dee48e2cd960184759fd70acaac7fb0a886e76f9ba1e2bda0a60160ff"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}