Taking the human out of decomposition-based optimization via artificial intelligence: Part II. Learning to initialize
Not on the map. Why?
Abstract (arXiv)
The repeated solution of large-scale optimization problems arises frequently in process systems engineering tasks. Decomposition-based solution methods have been widely used to reduce the corresponding computational time, yet their implementation has multiple steps that are difficult to configure. We propose a machine learning approach to learn the optimal initialization of such algorithms which minimizes the computational time. Active and supervised learning is used to learn a surrogate model that predicts the computational performance for a given initialization. We apply this approach to the initialization of Generalized Benders Decomposition for the solution of mixed integer model predictive control problems. The surrogate models are used to find the optimal number of initial cuts that should be added in the master problem. The results show that the proposed approach can lead to a significant reduction in solution time, and active learning can reduce the data required for learning.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 80 references that are in the map. First posted on arXiv 10 Oct 2023.
Builds on
23 of 80 references.
References · 23
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2023A Cookbook of Self-Supervised Learningcited by 248
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
- 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 108
- 2020Hybrid Models for Learning to Branchcited by 95
- 2014ParamILS: An Automatic Algorithm Configuration Frameworkcited by 88
- 2018Learning to Branchcited by 78
- 2022Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learningcited by 58
- 2021Learning to Select Cuts for Efficient Mixed-Integer Programmingcited by 48
- 2019Online Mixed-Integer Optimization in Millisecondscited by 37
- 2018Learning for Constrained Optimization: Identifying Optimal Active Constraint Setscited by 36
- 2022A Survey of Methods for Automated Algorithm Configurationcited by 29
11 more
- 2018The Voice of Optimizationcited by 28
- 2022Lookback for Learning to Branchcited by 26
- 2017Pitfalls and Best Practices in Algorithm Configurationcited by 25
- 2022A Deep Reinforcement Learning Framework For Column Generationcited by 21
- 2013DASH: Dynamic Approach for Switching Heuristicscited by 13
- 2019Benders Cut Classification via Support Vector Machines for Solving Two-stage Stochastic Programscited by 7
- 2020Accelerating Generalized Benders Decomposition for Wireless Resource Allocationcited by 5
- 2021A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flowcited by 5
- 2022Fast Continuous and Integer L-shaped Heuristics Through Supervised Learningcited by 5
- 2023Computationally efficient solution of mixed integer model predictive control problems via machine learning aided Benders Decompositioncited by 4
- 2018Graph-Based Modeling and Simulation of Complex Systemscited by 3
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.