arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.11328math.OC
收藏

对大规模ACOPF解决方案和最优性界限进行基准测试

Benchmarking Large-Scale ACOPF Solutions and Optimality Bounds

Smitha Gopinath, Hassan L. Hijazi

摘要:

我们提出了一个全面的基准测试的结果,旨在评估和比较国家的最先进的开源工具,用于解决交流最优潮流(ACOPF)的问题。我们的数值实验包括公共图书馆PGLIB中的所有实例,网络大小高达30,000个节点。基准测试工具涵盖多种编程语言(Python、Julia、Matlab/Octave和C $++$)、非线性最优化求解器(Ipopt、MIPS和INLP)以及不同的数学建模工具(JuMP和Gravity)。我们还提出了国家的最先进的最优性界限,使用稀疏开发半定规划方法和相应的计算时间。

英文摘要:

We present the results of a comprehensive benchmarking effort aimed at evaluating and comparing state-of-the-art open-source tools for solving the Alternating-Current Optimal Power Flow (ACOPF) problem. Our numerical experiments include all instances found in the public library PGLIB with network sizes up to 30,000 nodes. The benchmarked tools span a number of programming languages (Python, Julia, Matlab/Octave, and C$++$), nonlinear optimization solvers (Ipopt, MIPS, and INLP) as well as different mathematical modeling tools (JuMP and Gravity). We also present state-of-the-art optimality bounds obtained using sparsity-exploiting semidefinite programming approaches and corresponding computational times.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑