AI4OPT / AI4OPT/PGLearn.jl

Precompute clique decomposition

未关闭
#227 0 条评论 0 个 reaction 已指派 1 人 已被 @ivanightingale 认领 在 GitHub 查看
主要语言
Julia
星标
7
派生
5
PR 合并指标
30 天内没有已合并 PR

描述

For larger systems, there are two overheads in building an `OPFModel{SparseSDPOPF}`:
1. Computing the clique decomposition when building the `OPFData` (repeated at the beginning of each sampling job).
2. Linking the variables representing the same bus pair (repeated for each seed).

For 2869_pegase, `build_opf` took about 10 minutes on my laptop, where Step 1 above took relatively more time. They could become a large overhead if the allocated time is relatively short.

Solutions:
1. We can precompute and save the cliques for some of the PGLib systems. Computing the cliques offline allows us to use more sophisticated algorithms.
2. Variables linking mappings can also be pre-computed.

(What if one were to work with one of these systems, but with a different branch status? The clique decomposition of the original network would still be valid; it would only potentially include some redundant edges.)

贡献指南

这个仓库没有索引到贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。