考虑最优潮流约束的机组组合并行解法

针对传统机组组合模型的不足,提出一种考虑最优潮流约束的机组组合模型并给出了其并行化解法.该法借助于扩展拉格朗日和变量复制技术,将原问题转换为其对偶问题,并利用附加问题原理将对偶问题分解为动态规划和最优潮流子问题.对于最优潮流子问题,采用预测校正内点法求解,同时在求解过程中,采用并行处理技术.IEEE118节点及IEEE300节点仿真结果表明,该方法性能稳定,收敛性好,并行处理后计算速度显著提高.     

基于OPF的互联电网AGC优化模型

提出了一种基于OPF的互联电网AGC优化模型。该模型在传统OPF模型的潮流安全约束基础上,考虑了发电机组和负荷的静态频率特性,增加了机组的爬坡速率约束、频率质量约束和互联断面的传输有功约束,同时以AGC机组的辅助调节费用最小为目标函数。所建模型扩展了OPF模型的应用范围,使其由发电计划的决策方法扩展为实时发电控制的决策方法,并避免了传统AGC策略的区域偏差和潮流安全约束的越限风险。采用预测-校正原对偶内点法求解所建模型,并通过对IEEE 39节点修正系统的仿真分析,验证了新模型的正确性和有效性。     

基于Benders分解的微电网联网运行优化

针对联网运行的微电网,对其优化潮流(OPF)问题进行扩展,同时考虑机组组合(UC),建立微电网优化运行模型。针对模型中含有大量混合0/1决策变量和连续运行变量的求解,采用Benders分解方法将变量分离,在无网络约束UC主问题和网络约束OPF子问题之间迭代求解。在改造后的IEEE 13节点系统上进行了算例分析,表明所提方法可以快速可靠地优化微电网系统的运行。     

求解含储能装置的微电网动态最优潮流的对偶半定规划方法

电网动态最优潮流是一个全天24个时间断面耦合的最优潮流问题,需要考虑常规机组爬坡率约束和分布式储能装置能量约束。具有二阶收敛特性的内点法可以对其进行快速求解,但无法保证解的全局最优性。采用对偶半定规划法求解该问题,对孤岛运行的微电网动态最优潮流原始模型及向对偶半定规划模型的转换做了详细的介绍,并给出了严格的全局最优性判据。同时将储能装置的强非线性模型等价地变换成线性模型,并给出了相应的证明。某实际微电网和IEEE 30节点系统的测试结果表明,对偶半定规划法可高效求解动态最优潮流问题,其解可保证全局最优性。     

基于二阶网络模型的电力系统最优潮流计算

提出了一种基于二阶网络模型的最优潮流(Optimal Power Flow,OPF)模型;基于二阶网络模型的OPF不仅可以克服直流OPF的缺点,即准确地描述出线路上的有功损耗,且可以转化成非线性的凸规划,从而保证快速收敛到全局最优解。基于二阶网络模型的OPF问题,采用鲁棒性好、收敛速度快的预测校正内点法求解。为了显示模型的合理性和相应算法的有效性,采用IEEE30节点、IEEE118节点和IEEE300节点3个测试系统进行数值仿真。     

基于零空间的现代内点最优潮流新算法

在约束条件苛刻时,现代内点法求解电力系统最优潮流OPF问题有时不收敛,为克服此不足,本文提出一种求解OPF问题的零空间内点算法。首先分析了现代内点法不收敛的原因;然后通过改进的原始对偶变量的修正方法和终止准则来保证迭代点的最优性和不等式约束的互补性;最后将所提方法用于求解5个IEEE标准算例。数值结果表明,所提算法与现代内点法求解OPF问题的结果一致,在约束条件苛刻时,本文算法具有更好的收敛性。     

大规模机组组合问题计及网络约束的线性化求解方法

为了提高求解机组组合问题计算效率,给出线性化方法,将目标函数分段线性化,将启机费用作为约束并将其线性化,同时将网络安全约束通过直流潮流模型进行线性化,从而建立较完备的混合整数线性规划的机组组合模型。采用世界上广为流行的CPLEX优化求解器求解,在对偶间隙设定为较合理的情况下,求解速度快。不同测试算例表明,该方法速度快,精度较高,能够求解较大规模的机组组合问题。     

大规模机组组合问题计及网络约束的线性化求解方法

为了提高求解机组组合问题计算效率,给出线性化方法,将目标函数分段线性化,将启机费用作为约束并将其线性化,同时将网络安全约束通过直流潮流模型进行线性化,从而建立较完备的混合整数线性规划的机组组合模型.采用世界上广为流行的CPLEX优化求解器求解,在对偶间隙设定为较合理的情况下,求解速度快.不同测试算例表明,该方法速度快,精度较高,能够求解较大规模的机组组合问题.     

计及网络安全约束及用户停电损失的动态经济调度方法

提出一种计及网络安全约束及用户停电损失的动态经济调度模型,并给出相应的求解方法。该模型将非事故运行状态下机组的输出功率、预想事故（包括发、输电元件故障）发生后机组再调度的输出功率以及必要的切负荷功率作为独立变量进行决策,调度目标为系统的发电成本期望与用户的停电损失期望之和最小。模型采用发电联合转移因子（GJSDF）确定各支路潮流,并通过对支路潮流的限制保证了调度与再调度方案均可满足系统的网络安全约束。所构成的模型为二次规划问题,文中采用原对偶内点法进行求解。为解决多时段多状态所带来的计算规模庞大的问题,求解过程中充分利用了各调度时段间、各事故运行状态与非事故运行状态间的弱耦合性,首先采用时段间解耦的必要条件对前瞻时段数进行缩减,然后针对原对偶内点法KKT条件形成的牛顿修正方程的特殊分块形式进行分解计算,有效地提高了模型的求解效率。通过对IEEE 30节点系统的测试,表明该方法是有效的。     

计及N-k网络安全约束的二阶段鲁棒机组组合

为提高调度决策的安全性以增强其应对偶发线路故障扰动的能力,文中提出一种计及N-k网络安全约束的二阶段鲁棒机组组合模型。首先,介绍了2种当前研究中采用的N-k不确定集合,并对集合特点进行了阐述;其次,基于2种N-k不确定集合,构建了一般形式的二阶段鲁棒机组组合模型。其中,第一阶段为线路故障前的机组启停决策;第二阶段为观测到线路故障最坏情况下的经济调度决策。所提模型可采用列与约束生成(CCG)算法将第一阶段、第二阶段问题分别对应转化为主问题与子问题进行迭代求解,并且运用对偶原理和线性化技术,可将主问题与子问题均转化为混合整数线性规划(MILP)模型。最后,通过对IEEE 14节点及IEEE 118节点系统的测试分析,验证了所提模型的有效性。     

考虑水电厂组合的水电厂短期经济调度

在常规水电厂短期经济调度网流法的基础 ，本文提出了考虑水电厂组合的常规水电厂短期经济调度算法。     

一种改进的最优潮流算法研究

提出一种改进的信赖域内点算法.新方法无须与潮流计算配合增加算法通用性,并由常规潮流获得初始点改善信赖域子问题可行性;此外,改进信赖域子问题模型提高计算精度,调整收敛判据加快计算速度;由现代内点法求解信赖域子问题,并构造简约修正方程减小计算量.用改进的方法求解电力系统中以发电费用最小为目标的最优潮流问题.通过对IEEE14-300测试系统的数值仿真实验,证明所提出的算法是正确和有效的.     

A complete decomposition and coordination algorithm for large‐scale hydrothermal optimal power flow problems

This paper presents a complete decomposition and coordination algorithm to solve large‐scale hydrothermal optimal power flow (HTOPF) problems. Based on the approximate Newton directions method, which decouples the first‐order Karush–Kuhn–Tucker conditions of the original problem, an HTOPF problem with cascaded hydro plants is decomposed into a thermal plant subproblem with independent optimal power flow solutions for each time period and a hydro plant subproblem combined with fixed and variable heads and cascaded plants issues. In order to verify the effectiveness of the proposed algorithm, numerical tests are performed on three large‐scale test systems with up to 3120 buses and 7 531 915 primal–dual variables over 168 time periods. Test results show that the proposed algorithm gives excellent performances in convergence and stability. It not only reduces memory usage significantly but also decreases CPU time by about 65–75%. With parallel computing, it is capable of achieving 10–20 times or even 1000 times speed without loss of optimality. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

Scheduling of hydrothermal power systems

The authors present a method for scheduling hydrothermal power systems based on the Lagrangian relaxation technique. By using Lagrange multipliers to relax system-wide demand and reserve requirements, the problem is decomposed and converted into a two-level optimization problem. Given the sets of Lagrange multipliers, a hydro unit subproblem is solved by a merit order allocation method, and a thermal unit subproblem is solved by using dynamic programming without discretizing generation levels. A subgradient algorithm is used to update the Lagrange multipliers. Numerical results based on Northeast Utilities data show that this algorithm is efficient, and near-optimal solutions are obtained. Compared with previous work where thermal units were scheduled by using the Lagrangian relaxation technique and hydro units by heuristics, the new coordinated hydro and thermal scheduling generates lower total costs and requires less computation time     

A decoupled solution of hydro-thermal optimal power flow problem bymeans of interior point method and network programming

This paper presents a new decoupled model together with a very efficient coordination algorithm to solve a hydrothermal optimal power flow (HTOPF) problem over a certain time horizon. Based on the Lagrange relaxation at the level of the KKT (Karush-Kuhn-Tucker) conditions of the primal problem, the HTOPF is decomposed into thermal plant subproblems formulated as OPF and hydroplant subproblems. To solve efficiently the thermal OPF subproblems, the warm-starting scheme has been incorporated into interior point quadratic programming (IPQP). As to the hydroplant subproblems, a united network flow model is presented in which a fixed head plant is treated as a special case of a variable head plant. The hydroplant subproblem can be formulated as a minimum-cost maximum-flow problem for which unit cost functions of hydroplants are defined exactly. A proposed variant of the partitioning shortest path algorithm has brought about a great speed up in the computation of the subproblems. The validity of the proposed method has been examined by solving the IEEE test systems and a Chinese power system consisting of 13 thermal plants and 12 hydro power plants; the last system is a large size problem such that it has 107712 primal and dual variables. Simulation results obtained are quite convincing     

基于线性规划的Benders分解法在无功规划中的应用

文章将在于线性规划的Ｂｅｎｄｅｒｓ分解法应用电力系统无功规划问题,根据该方法,以年费用最小为目标函数,交优经问题分解为 问题与运行子问题,并在两个问题间迭代求解,该方法主我功规划新的思路,以某６６节点系统的负荷节点的无功优化结果表明,该方法具有实用性。     

A decentralized solution to the DC-OPF of interconnected power systems

This paper presents a new method for the decentralized solution of the DC optimal power flow (OPF) problem in large interconnected power systems. The method decomposes the overall OPF problem of a multiarea system into independent OPF subproblems, one for each area. The solutions of the OPF subproblems of the different areas are coordinated through a pricing mechanism until they converge to the global OPF solution. The prices used for the coordination of the subproblem solutions are the prices of electricity exchanges between adjacent areas. Test results from the application of the method to the three-area RTS-96 and the Balkan power system are reported.     

考虑柔性交流输电系统设备控制的校正型安全约束最优潮流

为提升安全约束最优潮流调度的经济性与安全性,提出一种基于直流潮流的考虑柔性交流输电系统(FACTS)设备控制的校正型安全约束最优潮流模型。在线路故障发生后,通过FACTS设备校正措施,将线路潮流控制在其容许范围内。由于所提模型为大规模的非凸、非线性优化问题,难以直接求解,因此先采用大M法,将原非线性优化模型转换为混合整数线性规化模型,并采用Benders分解算法将转换后的模型分解为基态最优潮流主问题与N-1故障校验子问题。通过固定整数变量的方法,将非凸的混合整数优化子问题转换为线性规划子问题,从而能向主问题返回对应的Benders割。6节点系统与IEEE RTS-79节点系统算例验证了所提模型与算法的有效性。结果表明,考虑FACTS设备校正控制的安全约束最优潮流能有效提升调度运行的经济性。     

An investigation of the solution to the optimal power flow problemincorporating continuation methods

The computation of the optimal power flow (OPF) remains a difficult nonlinear programming problem. An investigation is made of a solution methodology based on the continuation method, a parametric technique. In this algorithm, the continuation method is applied at various stages. The proposed algorithm uses the sequential quadratic programming strategy, but it replaces the standard subproblem module by a new parametric module. The varying-limits strategy used seems quite fast for solving the quadratic programs, and is formulated to be useful as a dispatching tool. In a second application of continuation methods, a load tracking outer loop is grafted to the nonlinear solver. This quickly produces (discrete) optimal solution trajectories when fed the forecasted system loads as input     

静态安全约束下基于Benders分解算法的可用传输容量计算

在电力市场环境下，可用传输容量(ATC)是反映输电线路可用于交易的剩余容量的重要指标。文中以最优潮流为基础，采用Benders分解方法将考虑静态安全约束的ATC计算问题分解为一个基态主问题和一系列与各预想事故有关的子问题。主问题用来处理基态潮流和相应约束以及由子问题所返回的Benders割(cut)约束，而各子问题用来处理各预想事故和形成相应的静态安全约束。文章给出了相应的数学模型，并提出了两种改进的求解策略。4节点和IEEE30节点系统的计算结果表明了该方法和求解策略的有效性。