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

支持离散控制装置的配电系统快速资源调度

Fast Resource Scheduling for Distribution Systems Enabled with Discrete Control Devices

Alireza Nouri, Alireza Soroudi, Andrew Keane

AI总结:

针对含连续与离散控制装置的配电系统,提出结合分支切割法、信赖域算法与简化优化预判断的快速调度框架,考虑负荷电压依赖特性,在保证最优解的同时显著降低计算耗时。

摘要:

本文提出了一种适用于同时配备连续控制装置(如逆变器接口型分布式电源DG)和离散控制装置(dcds,如有载调压变压器oltcs)的配电系统的快速短期调度与稳态电压控制框架。研究考虑了负荷的电压依赖特性,通过调控电压水平进一步降低运行成本。采用分支切割法处理与dcds运行相关的整数约束,在分支过程的每个节点上,使用全局收敛的信赖域算法(tra)求解整数松弛问题,tra子问题则通过内点法求解。为减轻分支切割算法的分支负担,在每个节点应用tra之前,先求解一个简化优化问题,利用该问题的收敛状态和目标函数值,可更快做出终止对应分支的决策。求解简化问题使得大多数节点无需应用tra。数值研究表明,该方法能够收敛到最优解,同时大幅节省计算时间。

英文摘要:

This paper proposes a framework for fast short-term scheduling and steady-state voltage control in distribution systems enabled with both continuous control devices, e.g., inverter interfaced DGs and discrete control devices (dcds), e.g., on-load tap changers (oltcs). The voltage-dependent nature of loads is taken into account to further reduce the operating cost by managing the voltage levels. The branch and cut method is applied to handle the integrality constraints associated with the operation of dcds. A globally convergent trust-region algorithm (tra) is applied to solve the integer relaxed problems at each node during the branching process. The tra sub-problems are solved using the interior point method. To reduce the branching burden of the branch and cut algorithm, before applying tra at each node, a simplified optimization problem is first solved. Using the convergence status and value of the objective function of this problem, a faster decision is made on stopping the regarding branch. Solving the simplified problem obviates the application of tra at most nodes. It is shown that the method converges to the optimal solution with a considerable saving in computation time according to the numerical studies.

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

↑