arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.01200eess.SYcs.LGcs.SY
收藏

基于少样本物理引导时空图卷积网络的学习求解机组组合

Learning-to-solve unit commitment based on few-shot physics-guided spatial-temporal graph convolution network

Mei Yang, Gao Qiu andJunyong Liu, Kai Liu

AI总结:

本文提出少样本物理引导时空图卷积网络FPG-STGCN,通过少量优化器解和增广拉格朗日方法快速求解机组组合问题,在可行性与效率上均优于现有方法。

摘要:

本文提出了一种少样本物理引导时空图卷积网络(FPG-STGCN),用于快速求解机组组合(UC)问题。首先,对STGCN进行定制化设计以参数化UC问题。然后,提出了少样本物理引导学习方案。该方案利用商业优化器生成的少量典型UC解来跳出局部最优,并借助增广拉格朗日方法保证约束满足。为了在学习过程中同时实现整数变量的可行性与连续松弛,提出了针对Tanh-Sign组合的直通估计器,以完全可微的方式处理混合整数解空间。在IEEE基准测试上的案例研究证明,该方法在UC可行性上优于主流学习方法,并在效率上超越传统求解器。

英文摘要:

This letter proposes a few-shot physics-guided spatial temporal graph convolutional network (FPG-STGCN) to fast solve unit commitment (UC). Firstly, STGCN is tailored to parameterize UC. Then, few-shot physics-guided learning scheme is proposed. It exploits few typical UC solutions yielded via commercial optimizer to escape from local minimum, and leverages the augmented Lagrangian method for constraint satisfaction. To further enable both feasibility and continuous relaxation for integers in learning process, straight-through estimator for Tanh-Sign composition is proposed to fully differentiate the mixed integer solution space. Case study on the IEEE benchmark justifies that, our method bests mainstream learning ways on UC feasibility, and surpasses traditional solver on efficiency.

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

↑