2026· IEEE Control Systems Letters· Vol 10, pp. 2131-2136· 0 citations· 16 references
Computer Science
Abstract
This letter proposes a learning method for real-time solution of receding-horizon mixed-integer nonlinear programs (RH MINLPs) in dynamic energy supply systems. Conventional MINLP solvers incur high computational costs. Although machine learning (ML) approximations can reduce the cost, existing approaches struggle to satisfy temporally coupled hard constraints solely through the forward pass, as required in industrial applications. To address this issue, we propose a two-stage architecture. First, RH MINLP is reformulated via backward recursion to decouple temporal dependencies into local allocation tasks. Second, a specialized neural network (NN) architecture embeds structural correction mechanisms into differentiable layers, thereby satisfying hard constraints during the forward pass without the need for external solvers. The proposed NN comprises a scalable binary-constraint layer and a continuous-allocation layer. A case study on a district cooling system demonstrates that the proposed method enables large-scale end-to-end training and generates feasible operational plans in real time.
The results demonstrate that CTD3 achieves good overall performance in reducing equivalent hydrogen consumption, controlling the comprehensive constraint violation rate, and coordinating multi-source power allocation under the tested typical operating conditions, thereby providing a feasible constraint-aware reinforcem...
Jinling Ma, Jiye Zhang· International journal of pat...· 0 citations
Many operational problems are constrained sequential decision processes with large, combinatorial action spaces and interdependent feasibility constraints. Mixed-integer linear programs (MILPs) handle such constraints flexibly but scale poorly in stochastic environments. Deep reinforcement learning (DRL) promises scala...
P. Helm, John C. Doerr, Joren Gijsbrechts et al.· 0 citations
This paper finds that solutions produced at the early search stage of MILP solvers are often structurally close to the solutions found after full-budget search, and proposes a new solver-informed paradigm that shifts the learning target from variable assignment to early-to-final consistency.
Guanli Li, Chengrui Gao, Chenguang Wang et al.· 0 citations
DualCert introduces constraint-coupled learning, in which current degree equations and dynamically separated subtour-elimination constraints (SECs) define each learned transition, and achieves a mean tour-cost gap of 0.0573%, smaller than the reported NeuroLKH mean gap.
Yancheng Song, Yong-Zhi Qi, Wei Qi et al.· 0 citations
Constrained Graph Diffusion, a graph-based generative diffusion model that learns the discrete component of mixed-integer optimization problems while integrating a training-free feasibility projection operator directly into the reverse diffusion process to steer intermediate samples toward the feasible set throughout g...
Vincenzo Di Vito, Mehdi Taghizadeh, Deepjyoti Deka et al.· 0 citations
This work proposes Hybrid Neural Solver for Combinatorial Optimization (HyCO), a hybrid inference algorithm that constructs a solution prefix with an RL solver and adaptively switches to a conditional DM to complete the remaining decisions, and designs a lightweight adaptive trigger that combines policy entropy and RL-...
Yu-Heng Li, Dian-Qiang Yang, Hai-Peng Chen et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.