arrow
返回

Quantum Annealing With Integer Slack Variables for Grid Partitioning

delete2023-03-01
delete4
PRE
AI
D
Dawei Wang
K
Kedi Zheng
F
Fei Teng
陈
陈启鑫 (Qixin Chen) *
DOI:10.1109/TPWRS.2022.3229862delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Quantum annealing (QA) can be used to efficiently solve quadratic unconstrained binary optimization (QUBO) problems. Grid partitioning (GP), which is a classic NP-hard integer programming problem, can potentially be solved much faster using QA. However, inequality constraints in the GP optimization model are difficult to handle. In this study, a novel solution framework based on QA is proposed for GP problems. The integer slack (IS) and binary expansion methods are applied to transform GP problems into QUBO problems. Instead of introducing continuous variables in traditional slack methods, the proposed IS method can avoid complex iteration processes when using QA. The case study demonstrates that the IS method obtains accurate feasible solutions with less calculation time.
Keyword:
Quantum annealing
Computers
Annealing
Mathematical models
Linear programming
Optimization
Indexes
Grid partitioning
integer slack
quantum annealing

期刊

IEEE Transactions on Power Systems 封面图
IEEE Transactions on Power Systems
IF:
7.2
论文数:
1.1W
被引数:
5.0W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
I
Imperial College London
学者数:
8.3W
论文数: 7.3W
被引数: 11.1W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Strategic bidding under uncertainty: A binary expansion approach
err2005-02-01
err189
PREAI
errPereira, MV; Granville, S; Fampa, MHC; Dix, R; Barroso, LA
err分享
err收藏
Hierarchical Spectral Clustering of Power Grids
err2014-09-01
err196
errOAAI
errSanchez-Garcia, Ruben J.; Fennelly, Max; Norris, Sean; Wright, Nick; Niblo, Graham; Brodzki, Jacek; Bialek, Janusz W.
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容