paper-with-me

Papers

Grid-SiPhyR: An end-to-end learning to optimize framework for combinatorial problems in power systems

2022-06-11 · Rabab Haider, Anuradha M. Annaswamy

Mixed integer problems are ubiquitous in decision making, from discrete device settings and design parameters, unit production, and on/off or yes/no decision in switches, routing, and social networks. Despite their prevalence, classical optimization approaches for combinatorial optimization remain prohibitively slow for fast and accurate decision making in dynamic and safety-critical environments with hard constraints. To address this gap, we propose SiPhyR (pronounced: cipher), a physics-informed machine learning framework for end-to-end learning to optimize for combinatorial problems. SiPhyR employs a novel physics-informed rounding approach to tackle the challenge of combinatorial optimization within a differentiable framework that has certified satisfiability of safety-critical constraints. We demonstrate the effectiveness of SiPhyR on an emerging paradigm for clean energy systems: dynamic reconfiguration, where the topology of the electric grid and power flow are optimized so as to maintain a safe and reliable power grid in the presence of intermittent renewable generation. Offline training of the unsupervised framework on representative load and generation data makes dynamic decision making via the online application of Grid-SiPhyR computationally feasible.

📄 PDF Abstract BibTeX arXiv:2206.06789

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial OptimizationDecision MakingPhysics-informed machine learning

Similar Papers 제목 키워드 기반

Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry

2026-06-24 · Luoning Zhang, Xu Zhuang, Tianhao Wang, Nathan Kaplan arxiv

We study certain extremal problems in combinatorial geometry that ask about configurations of points in an $n \times n$ grid that satisfy strict, global geometric constraints. Classical exact solvers suffer from combinat…

Reinforcement Learning

A Random-Key Optimizer for Combinatorial Optimization

2024-11-06 · Antonio A. Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz, J. Kyle Brubaker 외

This paper presents the Random-Key Optimizer (RKO), a versatile and efficient stochastic local search method tailored for combinatorial optimization problems. Using the random-key concept, RKO encodes solutions as vector…

Combinatorial Optimizationgraph partitioning

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

2016-12-16 · CVPR 2017 7 · Paul Swoboda, Jan Kuske, Bogdan Savchynskyy

We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm…

Graph Matching

Neural Combinatorial Optimization: a New Player in the Field

2022-05-03 · Andoni I. Garmendia, Josu Ceberio, Alexander Mendiburu

Neural Combinatorial Optimization attempts to learn good heuristics for solving a set of problems using Neural Network models and Reinforcement Learning. Recently, its good performance has encouraged many practitioners t…

Combinatorial Optimization

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems

2019-11-22 · Jaynta Mandi, Emir Demirović, Peter J. Stuckey, Tias Guns

Combinatorial optimization assumes that all parameters of the optimization problem, e.g. the weights in the objective function is fixed. Often, these weights are mere estimates and increasingly machine learning technique…

Combinatorial OptimizationScheduling