arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.00733eess.SYcs.SY
收藏

资源调度问题的量子-经典混合优化

Hybrid Quantum-Classical Optimization of the Resource Scheduling Problem

University of Denver(丹佛大学);Penn State Harrisburg(宾州州立大学哈里斯堡分校);Quanta Technology(量子技术公司)

Tyler Christeson, Md Habib Ullah, Ali Arabnya, Amin Khodaei, Rui Fan

AI总结:

本文提出一种基于Benders分解的量子-经典混合算法,将机组组合的二元决策与连续经济调度解耦,在量子退火机上求解主问题,实验表明该算法显著降低计算时间且绝对最优性差距低于1.63%。

摘要:

资源调度在许多行业中至关重要,尤其是在电力系统中。机组组合(Unit Commitment, UC)问题用于确定发电机在众多约束条件下的启停状态和输出水平。传统的精确方法,如数学规划方法或动态规划,仍是UC求解技术的支柱,但它们通常依赖线性近似或穷举搜索,随着系统规模的增长会导致极高的计算负担。元启发式方法,如遗传算法、粒子群优化和其他进化方法,已被探索用于缓解这种复杂性;然而,它们通常缺乏最优性保证,对初始条件表现出敏感性,并且对于大规模系统可能变得极其耗时。在本文中,我们引入了一种用于UC以及其他资源调度问题的量子-经典混合算法,该算法利用Benders分解将二元机组组合决策与连续经济调度解耦。二元主问题被表述为二次无约束二元优化模型,并在量子退火机上求解。连续子问题旨在最小化发电成本,并通过拉格朗日割反馈给主问题直到收敛。我们在规模从10到1,000台发电机组系统上评估了我们的混合框架。与经典的混合整数非线性规划基线相比,该混合算法实现了持续较低的计算时间增长率,并将绝对最优性差距保持在1.63%以下。这些结果表明,在混合量子-经典Benders分解循环中集成量子退火可以显著加速大规模资源调度而不牺牲解的质量,为应对现代电网不断升级的复杂性指明了一条可行路径。

英文摘要:

Resource scheduling is critical in many industries, especially in power systems. The Unit Commitment problem determines the on/off status and output levels of generators under many constraints. Traditional exact methods, such as mathematical programming methods or dynamic programming, remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time-consuming for large-scale systems. In this paper, we introduce a quantum-classical hybrid algorithm for UC and, by extension, other resource scheduling problems, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary master problem is formulated as a quadratic unconstrained binary optimization model and solved on a quantum annealer. The continuous subproblem, which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed-integer nonlinear programming baseline, the hybrid algorithm achieves a consistently lower computation-time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large-scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.

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

↑