基于代理的能源规划中Benders分解子问题优先级排序
Surrogate-based prioritization of sub-problems for Benders decomposition in energy planning
AI总结:
研究能源规划中Benders分解子问题选择方法,核心是基于代理估计子问题目标、评估切割平面估计器误差,优先处理误差大的子问题,贡献是在不同算法中应用该策略并验证其有效性。
摘要:
Benders分解通过分离主问题和子问题解决优化问题。标准分解每次迭代解决所有子问题,而选择部分子问题求解可保证收敛并减少求解时间,但如何选择成问题。本文引入基于代理的子问题优先级排序方法,在不同算法中应用并验证其有效性,还比较了不同代理的效果。
英文摘要:
Benders decomposition solves optimization problems by separating the first-stage master problem from one or more second-stage sub-problems. While the standard Benders decomposition solves all sub-problems in each iteration, solving only selected sub-problems still guarantees convergence and can reduce solution time, but raises the question of how to select. In this work, we introduce surrogate-based prioritization of sub-problems. The method leverages surrogates to estimate the sub-problems' objectives, assess the current error of the cutting-plane estimator, and then prioritize the sub-problem with the largest error. We implement surrogate-based prioritization within sequential and asynchronous Benders decomposition. Both these algorithms also leverage the surrogate to trigger convergence checks and implement regularization. Benchmarks for an energy planning problem with a few large sub-problems show that the applied prioritization strategy works. The reduction in solution time correlates with the surrogate's accuracy. In our case, geometric interpolation-based surrogates are more accurate than machine learning methods. As a result, prioritization consistently and significantly outperforms the standard algorithm in sequential Benders decomposition. The speed-up increases with the number of scenarios, reaching 33\% with four scenarios and 55% with ten scenarios. In the case of asynchronous parallelization, the impact on performance is less clear, and the average speed-up from prioritization is 19%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。