[go: up one dir, main page]

CN112016726A - A method and system for coordination and optimization of cross-regional connection lines - Google Patents

A method and system for coordination and optimization of cross-regional connection lines Download PDF

Info

Publication number
CN112016726A
CN112016726A CN201910452069.0A CN201910452069A CN112016726A CN 112016726 A CN112016726 A CN 112016726A CN 201910452069 A CN201910452069 A CN 201910452069A CN 112016726 A CN112016726 A CN 112016726A
Authority
CN
China
Prior art keywords
tie
regional
tie line
power grid
plan
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910452069.0A
Other languages
Chinese (zh)
Inventor
黄越辉
邵世彪
吴江
王跃峰
李湃
黄阮明
张梦瑶
郭明星
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
Xian Jiaotong University
State Grid Shanghai Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
Xian Jiaotong University
State Grid Shanghai Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, China Electric Power Research Institute Co Ltd CEPRI, Xian Jiaotong University, State Grid Shanghai Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201910452069.0A priority Critical patent/CN112016726A/en
Publication of CN112016726A publication Critical patent/CN112016726A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Energy or water supply

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Public Health (AREA)
  • Primary Health Care (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Educational Administration (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention relates to a coordination optimization method and a system of a cross-region junctor, wherein a plurality of junctor plans of each scheduling time interval of the cross-region junctor are randomly generated; determining a feasible tie line plan in a current unit combination mode of the regional power grid based on a predefined feasibility judgment condition; judging the feasibility of the tie line plan on the current unit combination mode of all regional power grids, and outputting the current tie line plan when the feasibility is realized, so that the tie line plan is formulated; otherwise, carrying out coordination optimization on the tie line plan and the regional power grid connected with the tie line plan by adopting a distributed punishment primitive-dual gradient optimization algorithm to obtain a new tie line plan, and then executing the previous step. Through the scheme, the cross-regional connecting line plan among the regional power grids is quickly matched, and meanwhile, the data privacy of the regional power grids is protected.

Description

一种跨区联络线的协调优化方法及系统A method and system for coordination and optimization of cross-regional connection lines

技术领域technical field

本发明属于电力系统优化调度领域，具体涉及一种跨区联络线的协调优化方法及系统。The invention belongs to the field of power system optimization and scheduling, and in particular relates to a method and system for coordination and optimization of cross-region connecting lines.

背景技术Background technique

目前，经济发展与能源资源分布不均衡的矛盾突出。为实现电力资源在更大范围内的优化配置，充分发挥互联电网在综合能源运输体系中的优势作用，开展跨区电力交易有利于促进区域间电力资源的余缺调剂，电力系统的供需互补，对大规模传统电源和可再生能源的输送与消纳有重要的意义。At present, the contradiction between economic development and uneven distribution of energy resources is prominent. In order to realize the optimal allocation of power resources in a wider range and give full play to the advantageous role of the interconnected power grid in the comprehensive energy transportation system, the development of cross-regional power trading is conducive to promoting the adjustment of surplus and shortage of power resources between regions, and the complementarity of supply and demand in the power system. The transmission and consumption of large-scale traditional power and renewable energy is of great significance.

随着大规模可再生能源并网发电以及需求侧响应机制的日益成熟，电力系统净负荷不确定性增加，需要同时考虑系统的正、负备用，保证系统安全可靠地运行。然而，考虑正、负备用的机组组合模型相较于传统机组组合问题更为复杂，求解难度变大。With the increasing maturity of large-scale renewable energy grid-connected power generation and demand-side response mechanisms, the uncertainty of the net load of the power system increases. It is necessary to consider the positive and negative backup of the system at the same time to ensure the safe and reliable operation of the system. However, the unit combination model considering positive and negative reserves is more complex than the traditional unit combination problem, and the solution becomes more difficult.

现有的跨区联络线计划的制定一般以集中式的方式收集所有区域的电网数据，统一地进行优化调度。随着互联电网规模的不断扩大，问题的求解时间会急剧增加，同时海量的数据可能会造成调度中心与各区域电网之间的通信阻塞；另外，集中式的方式也不利于保护各区域电网数据的隐私。The formulation of the existing cross-regional tie line plan generally collects power grid data in all regions in a centralized manner, and performs optimal scheduling in a unified manner. With the continuous expansion of the scale of the interconnected power grid, the time to solve the problem will increase sharply, and at the same time, the massive data may cause communication blockage between the dispatch center and the regional power grids; in addition, the centralized method is not conducive to protecting the data of the regional power grids. privacy.

发明内容SUMMARY OF THE INVENTION

为了弥补上述缺陷，本发明提供一种跨区联络线的协调优化方法及系统，在已知各区域电网的邻接关系基础上，采用分布式优化的方式，并通过一种共识协调机制，实现联络线计划的合理制定。In order to make up for the above-mentioned defects, the present invention provides a method and system for coordination and optimization of inter-regional connection lines. Based on the known adjacency relationship of each regional power grid, a distributed optimization method is adopted, and a consensus coordination mechanism is used to realize connection Rational development of the line plan.

本发明的目的是采用下述技术方案实现的：The purpose of this invention is to adopt following technical scheme to realize:

一种跨区联络线的协调优化方法，所述方法包括：A method for coordinating and optimizing a cross-regional connection line, the method comprising:

S1：随机生成多条跨区联络线的各个调度时段的联络线计划；S1: Randomly generate tie line plans for each scheduling period of multiple cross-region tie lines;

S2：基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划；S2: Based on the pre-defined feasibility determination conditions, determine the feasible tie-line plan under the current unit combination mode of the regional power grid;

S3：判定所述联络线计划对所有区域电网的当前机组组合方式的可行性，当可行时，输出当前联络线计划，联络线计划制定完成；否则，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，然后执行步骤S2。S3: Determine the feasibility of the tie line plan for the current unit combination mode of all regional power grids, when feasible, output the current tie line plan, and the tie line plan is formulated; otherwise, use the distributed penalty original-dual gradient optimization algorithm Coordinate and optimize the tie line plan and the regional power grid to which it is connected to obtain a new tie line plan, and then execute step S2.

优选的，所述基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划包括：Preferably, the determination of a feasible tie line plan under the current unit combination mode of the regional power grid based on the pre-defined feasibility determination conditions includes:

基于区域电网系统拓扑图构建区域电网和跨区联络线之间的关联矩阵；Construct the correlation matrix between the regional power grid and the inter-regional tie line based on the regional power grid system topology map;

基于区域电网和跨区联络线之间的关联矩阵，获取跨区联络线上的传输功率；Based on the correlation matrix between the regional power grid and the inter-regional tie-line, obtain the transmission power on the inter-regional tie-line;

将跨区联络线的传输功率之和分别代入到对应区域电网的考虑正、负备用的经济分配问题可行性判定条件中，若满足可行性判定条件，则表示所述联络线计划在区域电网当前机组组合方式下可行。Substitute the sum of the transmission power of the cross-regional tie line into the feasibility judgment conditions of the economic allocation problem considering positive and negative reserve of the corresponding regional power grid. It is feasible in the unit combination mode.

进一步地，所述可行性判定条件如下式：Further, the feasibility judgment condition is as follows:

Figure BDA0002075457560000021
Figure BDA0002075457560000021

Figure BDA0002075457560000022
Figure BDA0002075457560000022

Figure BDA0002075457560000023
Figure BDA0002075457560000023

Figure BDA0002075457560000024
Figure BDA0002075457560000024

其中，i为机组编号，n为区域电网编号，t为时段编号，l为联络线编号；I'n为区域电网n当前开机机组的集合；

Figure BDA0002075457560000025
P i为机组i的出力上、下限；
Figure BDA0002075457560000026
为机组i可提供的最大正、负备用量；
Figure BDA0002075457560000027
为区域电网n在t时段的正、负备用需求；Dn,t为区域电网n在t时段的负荷需求；
Figure BDA0002075457560000028
为区域电网n与联络线l的关联关系；1表示区域电网n送电，-1表示区域电网n受电，0表示区域电网n与联络线l无直接关联；fl,t为联络线l在t时段的传输功率。Wherein, i is the unit number, n is the regional power grid number, t is the time period number, and l is the tie line number;
Figure BDA0002075457560000025
P i is the output upper and lower limits of unit i;
Figure BDA0002075457560000026
The maximum positive and negative reserves that can be provided for unit i;
Figure BDA0002075457560000027
is the positive and negative reserve demand of regional power grid n in period t; D n,t is the load demand of regional power grid n in period t;
Figure BDA0002075457560000028
is the relationship between the regional power grid n and the tie line l; 1 indicates that the regional power grid n transmits power, -1 indicates that the regional power grid n receives power, 0 indicates that the regional power grid n is not directly related to the connecting line l; f l, t are the connecting line l Transmission power at time period t.

优选的，所述判定联络线计划对所有区域电网的当前机组组合方式的可行性包括：Preferably, the determination of the feasibility of the tie line plan for the current unit combination mode of all regional power grids includes:

在区域电网中引入lagrange乘子，对跨区交易电量约束进行松弛，将区域电网的联络线计划制定问题化为无约束优化问题；The lagrange multiplier is introduced into the regional power grid to relax the constraints of cross-regional transaction electricity, and the problem of tie-line planning of the regional power grid is transformed into an unconstrained optimization problem;

将引入lagrange乘子，对跨区交易电量约束进行松弛后输出的当前联络线计划与上一个联络线计划进行比较，判断所述联络线计划与上一个联络线计划之间是否发生变化，若无变化则说明当前联络线计划对所有区域电网可行。The lagrange multiplier will be introduced to compare the current tie-line plan output after the cross-regional transaction power constraints are relaxed with the previous tie-line plan, and determine whether there is a change between the tie-line plan and the previous tie-line plan, if no The changes indicate that the current tie-line scheme is feasible for all regional grids.

进一步地，通过下式在区域电网中引入lagrange乘子，对跨区交易电量约束进行松弛，将区域电网的联络线计划制定问题转化为无约束优化问题：Further, the lagrange multiplier is introduced into the regional power grid by the following formula to relax the cross-regional transaction power constraints, and the tie line planning problem of the regional power grid is transformed into an unconstrained optimization problem:

Figure BDA0002075457560000031
Figure BDA0002075457560000031

Figure BDA0002075457560000032
Figure BDA0002075457560000032

其中，El为联络线l的总交易电量，[·]+表示非负运算，fl,t为联络线l在t时段的传输功率，

Figure BDA0002075457560000033
为传输功率的边界；
Figure BDA0002075457560000034
μn,t、ωn,t均为引入乘子，ft为区域电网n所连接的所有联络线在t时段的总传输功率；
Figure BDA0002075457560000035
为区域电网n在t时段的正、负备用需求。Among them, E l is the total transaction power of the tie line l, [ ] + represents a non-negative operation, f l, t is the transmission power of the tie line l in the t period,
Figure BDA0002075457560000033
is the boundary of transmission power;
Figure BDA0002075457560000034
μ n,t and ω n,t are the introduction multipliers, and f t is the total transmission power of all the tie lines connected to the regional power grid n in the period t;
Figure BDA0002075457560000035
is the positive and negative reserve demand of the regional grid n in the t period.

进一步地，通过下式判断联络线计划与上一个联络线计划之间是否发生变化：Further, determine whether there is a change between the contact line plan and the previous contact line plan by the following formula:

Figure BDA0002075457560000036
Figure BDA0002075457560000036

其中，k表示迭代次数，

Figure BDA0002075457560000037
为当前联络线计划，
Figure BDA0002075457560000038
为上一次联络线计划，ε为预设阈值。where k is the number of iterations,
Figure BDA0002075457560000037
For the current contact line plan,
Figure BDA0002075457560000038
For the last contact line plan, ε is a preset threshold.

优选的，所述采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，包括：Preferably, the distributed penalty primordial-dual gradient optimization algorithm is used to coordinate and optimize the tie line plan and the regional power grid connected to it, so as to obtain a new tie line plan, including:

针对各区域电网，获取联络线计划的联络线传输功率变量以及lagrange乘子的次梯度；For each regional power grid, obtain the tie line transmission power variable of the tie line plan and the subgradient of the lagrange multiplier;

对联络线传输功率变量延其负梯度方向更新，并在可行域内进行投影运算，对乘子变量延其正梯度方向更新；The transmission power variable of the tie line is updated along its negative gradient direction, and the projection operation is performed in the feasible region, and the multiplier variable is updated along its positive gradient direction;

计算更新后的联络线传输功率变量以及lagrange乘子的次梯度，并将更新后的联络线传输功率变量以及lagrange乘子的次梯度与其连接的区域电网进行共识协调，得到新的联络线计划。Calculate the updated tie-line transmission power variable and the sub-gradient of the lagrange multiplier, and coordinate the updated tie-line transmission power variable and the sub-gradient of the lagrange multiplier with its connected regional power grid to obtain a new tie-line plan.

进一步地，通过下式确定联络线传输功率变量的次梯度：Further, the subgradient of the transmission power variable of the tie line is determined by the following formula:

Figure BDA0002075457560000039
Figure BDA0002075457560000039

其中，

Figure BDA00020754575600000310
为联络线传输功率变量的次梯度，
Figure BDA00020754575600000311
为上一次联络线计划；
Figure BDA00020754575600000312
P i为机组i的出力上、下限；El为联络线l的总交易电量，Dn,t为区域电网n在t时段的负荷需求；
Figure BDA0002075457560000041
为区域电网n与联络线l的关联关系；
Figure BDA0002075457560000042
为区域电网n在t时段的正、负备用需求。in,
Figure BDA00020754575600000310
is the subgradient of the tie-line transmission power variable,
Figure BDA00020754575600000311
planned for the last contact line;
Figure BDA00020754575600000312
P i is the upper and lower limits of the output of unit i; E l is the total transaction power of the tie line l, D n, t is the load demand of the regional power grid n in the t period;
Figure BDA0002075457560000041
is the relationship between the regional power grid n and the tie line l;
Figure BDA0002075457560000042
is the positive and negative reserve demand of the regional grid n in the t period.

进一步地，通过下式确定lagrange乘子的次梯度：Further, the subgradient of the lagrange multiplier is determined by the following formula:

Figure BDA0002075457560000043
Figure BDA0002075457560000043

Figure BDA0002075457560000044
Figure BDA0002075457560000044

Figure BDA0002075457560000045
Figure BDA0002075457560000045

其中，

Figure BDA0002075457560000046
分别为lagrange乘子
Figure BDA0002075457560000047
μn,t、ωn,t的次梯度。in,
Figure BDA0002075457560000046
respectively lagrange multipliers
Figure BDA0002075457560000047
Subgradients of μ n,t , ω n,t .

进一步地，通过下式确定联络线传输功率变量的可行域：Further, the feasible region of the transmission power variable of the tie line is determined by the following formula:

Figure BDA0002075457560000048
Figure BDA0002075457560000048

其中，

Figure BDA0002075457560000049
为传输功率的边界。in,
Figure BDA0002075457560000049
is the boundary of transmission power.

进一步地，通过下式确定更新后的联络线传输功率变量和lagrange乘子：Further, the updated tie line transmission power variable and lagrange multiplier are determined by the following formula:

Figure BDA00020754575600000410
Figure BDA00020754575600000410

Figure BDA00020754575600000411
Figure BDA00020754575600000411

Figure BDA00020754575600000412
Figure BDA00020754575600000412

Figure BDA00020754575600000413
Figure BDA00020754575600000413

式中，

Figure BDA00020754575600000414
为更新后的联络线传输功率变量，
Figure BDA00020754575600000415
μn,t(k+1)、ωn,t(k+1)均为更新后的lagrange乘子。In the formula,
Figure BDA00020754575600000414
transmit power variable for the updated tie line,
Figure BDA00020754575600000415
μ n,t (k+1) and ω n,t (k+1) are the updated lagrange multipliers.

进一步地，通过下式确定新的联络线计划：Further, the new contact line plan is determined by the following formula:

Figure BDA00020754575600000416
Figure BDA00020754575600000416

Figure BDA00020754575600000417
Figure BDA00020754575600000417

优选的，所述随机生成多条跨区联络线的各个调度时段联络线计划包括：Preferably, the randomly generating a plurality of cross-region tie lines in each scheduling period tie line plan includes:

根据调度时段总长度和调度时段间隔，随机生成多条跨区联络线的各个调度时段的传输功率计划，制定联络线计划。According to the total length of the scheduling period and the interval of the scheduling period, the transmission power plan of each scheduling period of the multiple cross-region tie lines is randomly generated, and the tie line plan is formulated.

一种跨区联络线的协调优化系统，所述系统包括：A coordination and optimization system for cross-regional connection lines, the system includes:

生成模块，用于随机生成多条跨区联络线的各个调度时段联络线计划；The generation module is used to randomly generate the contact line plans for each scheduling period of multiple cross-regional contact lines;

判定模块，用于基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划；The determination module is used to determine the feasible tie-line plan under the current unit combination mode of the regional power grid based on the pre-defined feasibility determination conditions;

协调优化模块，用于判定联络线计划对所有区域电网的当前机组组合方式的可行性，当可行时，输出当前联络线计划，联络线计划制定完成；否则，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，然后执行判定模块。The coordination optimization module is used to determine the feasibility of the tie line plan for the current unit combination of all regional power grids. When feasible, the current tie line plan is output, and the tie line plan is formulated; otherwise, the distributed penalty original-dual gradient is used. The optimization algorithm coordinates and optimizes the tie line plan and the regional power grid it is connected to, obtains a new tie line plan, and then executes the determination module.

与最接近的现有技术相比，本发明具备以下有益效果：Compared with the closest prior art, the present invention has the following beneficial effects:

本发明方案提供一种跨区联络线的协调优化方法及系统，首先随机生成多条跨区联络线的各个调度时段联络线计划；其次基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划；该可行性判定条件是通过利用考虑正、负备用的经济分配问题的可行性判定条件，通过计算四个简单不等式能够快速准确地判断当前解的可行性，可提高问题的求解效率。The scheme of the present invention provides a method and system for coordination and optimization of inter-regional tie lines. First, tie-line plans for each dispatch period of multiple inter-region tie lines are randomly generated; secondly, based on pre-defined feasibility judgment conditions, the current units in the regional power grid are determined. Feasible tie-line plan in combination mode; the feasibility judgment condition is that the feasibility of the current solution can be quickly and accurately judged by calculating four simple inequalities by using the feasibility judgment condition considering the economic allocation problem of positive and negative reserves, It can improve the efficiency of solving the problem.

最后判定联络线计划对所有区域电网的当前机组组合方式的可行性，当可行时，输出当前联络线计划，联络线计划制定完成；否则，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，然后执行上一步骤。根据各区域电网的邻接关系，所有区域电网采用分布式优化的方式只需与其邻居电网交换少量的数据，通过一种共识机制实现联络线计划准确合理的制定，这种方式不仅避免处理海量的数据，提高问题的求解效率，实现各区域电网间跨区联络线计划的快速匹配，同时还保护了各区域电网的数据隐私。Finally, determine the feasibility of the tie line plan for the current unit combination of all regional power grids. When feasible, output the current tie line plan, and the tie line plan is formulated; otherwise, the distributed penalty primitive-dual gradient optimization algorithm is used for the The tie line plan is coordinated and optimized with the regional grids it is connected to, and a new tie line plan is obtained, and then the previous step is performed. According to the adjacency relationship of each regional power grid, all regional power grids only need to exchange a small amount of data with their neighboring power grids by means of distributed optimization, and realize the accurate and reasonable formulation of tie line plans through a consensus mechanism, which not only avoids processing massive data , improve the efficiency of solving the problem, realize the rapid matching of cross-regional tie-line plans between regional power grids, and protect the data privacy of regional power grids.

附图说明Description of drawings

图1是本发明具体实施方式中的总方法流程图；Fig. 1 is the overall method flow chart in the specific embodiment of the present invention;

图2是本发明实施例中联络线协调优化算法流程图。FIG. 2 is a flowchart of a tie line coordination optimization algorithm in an embodiment of the present invention.

具体实施方式Detailed ways

下面结合附图对本发明的具体实施方式作详细说明。The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

本发明提供的一种跨区联络线的协调优化方法，如图1所示，包括：A method for coordinating and optimizing a cross-region tie line provided by the present invention, as shown in Figure 1, includes:

S1：随机生成多条跨区联络线的各个调度时段的联络线计划；S1: Randomly generate tie line plans for each scheduling period of multiple cross-region tie lines;

S2：基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划；S2: Based on the pre-defined feasibility determination conditions, determine the feasible tie-line plan under the current unit combination mode of the regional power grid;

S3：判定所述联络线计划对所有区域电网的当前机组组合方式的可行性，当可行时，输出当前联络线计划，联络线计划制定完成；否则，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，然后执行步骤S2。S3: Determine the feasibility of the tie line plan for the current unit combination mode of all regional power grids, when feasible, output the current tie line plan, and the tie line plan is formulated; otherwise, use the distributed penalty original-dual gradient optimization algorithm Coordinate and optimize the tie line plan and the regional power grid to which it is connected to obtain a new tie line plan, and then execute step S2.

步骤S1中，1所述随机生成多条跨区联络线的各个调度时段联络线计划包括：根据调度时段总长度和调度时段间隔，随机生成多条跨区联络线的各个调度时段的传输功率计划，制定联络线计划。In step S1, the randomly generating the tie line plans for each scheduling period of the multiple cross-region tie lines in 1 includes: randomly generating the transmission power plan for each scheduling period of the multiple cross-region tie lines according to the total length of the scheduling period and the scheduling period interval. , develop a contact line plan.

步骤S2中，基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划包括：In step S2, based on the pre-defined feasibility determination conditions, determining the feasible tie line plan under the current unit combination mode of the regional power grid includes:

基于区域电网系统拓扑图构建区域电网和跨区联络线之间的关联矩阵；Construct the correlation matrix between the regional power grid and the inter-regional tie line based on the regional power grid system topology map;

基于区域电网和跨区联络线之间的关联矩阵，获取跨区联络线上的传输功率；Based on the correlation matrix between the regional power grid and the inter-regional tie-line, obtain the transmission power on the inter-regional tie-line;

将跨区联络线的传输功率之和分别代入到对应区域电网的考虑正、负备用的经济分配问题可行性判定条件中，若满足可行性判定条件，则表示所述联络线计划在区域电网当前机组组合方式下可行。Substitute the sum of the transmission power of the cross-regional tie line into the feasibility judgment conditions of the economic allocation problem considering positive and negative reserve of the corresponding regional power grid. It is feasible in the unit combination mode.

其中，可行性判定条件如下式：Among them, the feasibility judgment conditions are as follows:

Figure BDA0002075457560000061
Figure BDA0002075457560000061

Figure BDA0002075457560000062
Figure BDA0002075457560000062

Figure BDA0002075457560000063
Figure BDA0002075457560000063

Figure BDA0002075457560000064
Figure BDA0002075457560000064

式中，i为机组编号，n为区域电网编号，t为时段编号，l为联络线编号；I'n为区域电网n当前开机机组的集合；

Figure BDA0002075457560000065
P i为机组i的出力上、下限；
Figure BDA0002075457560000066
为机组i可提供的最大正、负备用量；
Figure BDA0002075457560000067
为区域电网n在t时段的正、负备用需求；Dn,t为区域电网n在t时段的负荷需求；
Figure BDA0002075457560000068
为区域电网n与联络线l的关联关系；1表示区域电网n送电，-1表示区域电网n受电，0表示区域电网n与联络线l无直接关联；fl,t为联络线l在t时段的传输功率。In the formula, i is the unit number, n is the regional grid number, t is the time period number, and l is the tie line number;
Figure BDA0002075457560000065
P i is the output upper and lower limits of unit i;
Figure BDA0002075457560000066
The maximum positive and negative reserves that can be provided for unit i;
Figure BDA0002075457560000067
is the positive and negative reserve demand of regional power grid n in period t; D n,t is the load demand of regional power grid n in period t;
Figure BDA0002075457560000068
is the relationship between the regional power grid n and the tie line l; 1 means that the regional power grid n transmits power, -1 means that the regional power grid n receives power, 0 means that the regional power grid n is not directly related to the tie line l; f l, t are the tie line l Transmission power at time period t.

步骤S3，判定联络线计划对所有区域电网的当前机组组合方式的可行性包括：Step S3, determining the feasibility of the tie line plan for the current unit combination mode of all regional power grids includes:

在区域电网中引入lagrange乘子，对跨区交易电量约束进行松弛，将区域电网的联络线计划制定问题化为无约束优化问题；The lagrange multiplier is introduced into the regional power grid to relax the constraints of cross-regional transaction electricity, and the problem of tie-line planning of the regional power grid is transformed into an unconstrained optimization problem;

将引入lagrange乘子，对跨区交易电量约束进行松弛后输出的当前联络线计划与上一个联络线计划进行比较，判断所述联络线计划与上一个联络线计划之间是否发生变化，若无变化则说明当前联络线计划对所有区域电网可行。The lagrange multiplier will be introduced to compare the current tie-line plan output after the cross-regional transaction power constraints are relaxed with the previous tie-line plan, and determine whether there is a change between the tie-line plan and the previous tie-line plan, if no The changes indicate that the current tie-line scheme is feasible for all regional grids.

通过下式在区域电网中引入lagrange乘子，对跨区交易电量约束进行松弛，将区域电网的联络线计划制定问题转化为无约束优化问题：The lagrange multiplier is introduced into the regional power grid by the following formula to relax the cross-regional transaction power constraints, and the tie line planning problem of the regional power grid is transformed into an unconstrained optimization problem:

Figure BDA0002075457560000071
Figure BDA0002075457560000071

Figure BDA0002075457560000072
Figure BDA0002075457560000072

其中，El为联络线l的总交易电量，[·]+表示非负运算，fl,t为联络线l在t时段的传输功率，

Figure BDA0002075457560000073
为传输功率的边界；
Figure BDA0002075457560000074
μn,t、ωn,t均为引入乘子，ft为区域电网n所连接的所有联络线在t时段的总传输功率；
Figure BDA0002075457560000075
为区域电网n在t时段的正、负备用需求。Among them, E l is the total transaction power of the tie line l, [ ] + represents a non-negative operation, f l, t is the transmission power of the tie line l in the t period,
Figure BDA0002075457560000073
is the boundary of transmission power;
Figure BDA0002075457560000074
μ n,t and ω n,t are the introduction multipliers, and f t is the total transmission power of all the tie lines connected to the regional power grid n in the period t;
Figure BDA0002075457560000075
is the positive and negative reserve demand of the regional grid n in the t period.

通过下式判断联络线计划与上一个联络线计划之间是否发生变化：Determine whether there is a change between the contact line plan and the previous contact line plan by the following formula:

Figure BDA0002075457560000076
Figure BDA0002075457560000076

其中，k表示迭代次数，

Figure BDA0002075457560000077
为当前联络线计划，
Figure BDA0002075457560000078
为上一次联络线计划，ε为预设阈值。where k is the number of iterations,
Figure BDA0002075457560000077
For the current contact line plan,
Figure BDA0002075457560000078
For the last contact line plan, ε is a preset threshold.

步骤S3中，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，包括：In step S3, the distributed penalty primordial-dual gradient optimization algorithm is used to coordinate and optimize the tie line plan and the regional power grid connected to it to obtain a new tie line plan, including:

针对各区域电网，获取联络线计划的联络线传输功率变量以及lagrange乘子的次梯度；For each regional power grid, obtain the tie line transmission power variable of the tie line plan and the subgradient of the lagrange multiplier;

对联络线传输功率变量延其负梯度方向更新，并在可行域内进行投影运算，对乘子变量延其正梯度方向更新；The transmission power variable of the tie line is updated along its negative gradient direction, and the projection operation is performed in the feasible region, and the multiplier variable is updated along its positive gradient direction;

计算更新后的联络线传输功率变量以及lagrange乘子的次梯度，并将更新后的联络线传输功率变量以及lagrange乘子的次梯度与其连接的区域电网进行共识协调，得到新的联络线计划。Calculate the updated tie-line transmission power variable and the sub-gradient of the lagrange multiplier, and coordinate the updated tie-line transmission power variable and the sub-gradient of the lagrange multiplier with its connected regional power grid to obtain a new tie-line plan.

通过下式确定联络线传输功率变量的次梯度：The subgradient of the tie-line transmission power variable is determined by:

Figure BDA0002075457560000081
Figure BDA0002075457560000081

其中，

Figure BDA0002075457560000082
为联络线传输功率变量的次梯度，
Figure BDA0002075457560000083
为上一次联络线计划；
Figure BDA0002075457560000084
P i为机组i的出力上、下限；El为联络线l的总交易电量，Dn,t为区域电网n在t时段的负荷需求；
Figure BDA0002075457560000085
为区域电网n与联络线l的关联关系；
Figure BDA0002075457560000086
为区域电网n在t时段的正、负备用需求。in,
Figure BDA0002075457560000082
is the subgradient of the tie-line transmission power variable,
Figure BDA0002075457560000083
planned for the last contact line;
Figure BDA0002075457560000084
P i is the upper and lower limits of the output of unit i; E l is the total transaction power of the tie line l, D n, t is the load demand of the regional power grid n in the t period;
Figure BDA0002075457560000085
is the relationship between the regional power grid n and the tie line l;
Figure BDA0002075457560000086
is the positive and negative reserve demand of the regional grid n in the t period.

通过下式确定lagrange乘子的次梯度：Determine the subgradient of the lagrange multiplier by:

Figure BDA0002075457560000087
Figure BDA0002075457560000087

Figure BDA0002075457560000088
Figure BDA0002075457560000088

Figure BDA0002075457560000089
Figure BDA0002075457560000089

其中，

Figure BDA00020754575600000810
分别为lagrange乘子
Figure BDA00020754575600000811
μn,t、ωn,t的次梯度。in,
Figure BDA00020754575600000810
respectively lagrange multipliers
Figure BDA00020754575600000811
Subgradients of μ n,t , ω n,t .

通过下式确定联络线传输功率变量的可行域：The feasible region of the transmission power variable of the tie line is determined by the following formula:

Figure BDA00020754575600000812
Figure BDA00020754575600000812

其中，

Figure BDA00020754575600000813
为传输功率的边界。in,
Figure BDA00020754575600000813
is the boundary of transmission power.

通过下式确定更新后的联络线传输功率变量和lagrange乘子：The updated tie-line transmission power variable and lagrange multiplier are determined by:

Figure BDA00020754575600000814
Figure BDA00020754575600000814

Figure BDA00020754575600000815
Figure BDA00020754575600000815

Figure BDA00020754575600000816
Figure BDA00020754575600000816

Figure BDA00020754575600000817
Figure BDA00020754575600000817

式中，

Figure BDA00020754575600000818
为更新后的联络线传输功率变量，
Figure BDA00020754575600000819
μn,t(k+1)、ωn,t(k+1)均为更新后的lagrange乘子。In the formula,
Figure BDA00020754575600000818
transmit power variable for the updated tie line,
Figure BDA00020754575600000819
μ n,t (k+1) and ω n,t (k+1) are the updated lagrange multipliers.

通过下式确定新的联络线计划：Determine the new contact line plan by:

Figure BDA0002075457560000091
Figure BDA0002075457560000091

Figure BDA0002075457560000092
Figure BDA0002075457560000092

基于同一技术构思，本发明提供还一种跨区联络线的协调优化系统，所述系统包括：Based on the same technical concept, the present invention also provides a coordination and optimization system for cross-regional connection lines, the system includes:

生成模块，用于随机生成多条跨区联络线的各个调度时段联络线计划；The generation module is used to randomly generate the contact line plans for each scheduling period of multiple cross-regional contact lines;

判定模块，用于基于预先定义的可行性判定条件，确定在区域电网当前机组组合方式下的可行的联络线计划；The determination module is used to determine the feasible tie-line plan under the current unit combination mode of the regional power grid based on the pre-defined feasibility determination conditions;

协调优化模块，用于判定联络线计划对所有区域电网的当前机组组合方式的可行性，当可行时，输出当前联络线计划，联络线计划制定完成；否则，采用分布式惩罚原始-对偶次梯度优化算法对所述联络线计划与其连接的区域电网进行协调优化，得到新的联络线计划，然后执行判定模块。The coordination optimization module is used to determine the feasibility of the tie line plan for the current unit combination of all regional power grids. When feasible, the current tie line plan is output, and the tie line plan is formulated; otherwise, the distributed penalty original-dual gradient is used. The optimization algorithm coordinates and optimizes the tie line plan and the regional power grid it is connected to, obtains a new tie line plan, and then executes the determination module.

实施例1：Example 1:

如图2所示，1)根据调度时段总长度(24h)和调度时段间隔(1h)，随机生成L条跨区联络线的各个调度时段联络线计划；As shown in Figure 2, 1) according to the total length of the scheduling period (24h) and the scheduling period interval (1h), randomly generate each scheduling period tie line plan of L cross-region tie lines;

2)根据已知的系统网络拓扑图，写出区域电网和跨区联络线之间的关联矩阵，利用该关联矩阵将相应跨区联络线上的功率之和分别代入到对应区域电网的考虑正、负备用的经济分配问题可行性判定条件中，判定当前联络线计划对区域电网n的当前机组组合方式是否可行性，若迭代次数k＝1，则继续步骤3)，否则，直接跳转步骤5)；2) According to the known system network topology, write the correlation matrix between the regional power grid and the cross-regional tie line, and use the correlation matrix to substitute the sum of the power on the corresponding cross-regional tie line into the corresponding regional power grid. In the feasibility judgment conditions of the economic allocation problem of negative reserve, it is determined whether the current tie line plan is feasible for the current unit combination mode of the regional power grid n, if the number of iterations k = 1, then proceed to step 3), otherwise, skip directly to step 3) 5);

Figure BDA0002075457560000093
Figure BDA0002075457560000093

Figure BDA0002075457560000094
Figure BDA0002075457560000094

Figure BDA0002075457560000095
Figure BDA0002075457560000095

Figure BDA0002075457560000096
Figure BDA0002075457560000096

其中，i为机组编号，n为区域电网编号，t为时段编号，l为联络线编号；I'n为区域电网n当前开机机组的集合；

Figure BDA0002075457560000097
P i为机组i的出力上、下限；
Figure BDA0002075457560000098
为机组i可提供的最大正、负备用量；
Figure BDA0002075457560000099
为区域电网n在t时段的正、负备用需求；Dn,t为区域电网n在t时段的负荷需求；
Figure BDA00020754575600000910
为区域电网n与联络线l的关联关系(1表示区域电网n送电(流出)，-1表示区域电网n受电(流入)，0表示区域电网n与联络线l无直接关联)；fl,t为联络线l在t时段的传输功率。Wherein, i is the unit number, n is the regional power grid number, t is the time period number, and l is the tie line number;
Figure BDA0002075457560000097
P i is the output upper and lower limits of unit i;
Figure BDA0002075457560000098
The maximum positive and negative reserves that can be provided for unit i;
Figure BDA0002075457560000099
is the positive and negative reserve demand of regional power grid n in period t; D n,t is the load demand of regional power grid n in period t;
Figure BDA00020754575600000910
is the relationship between the regional power grid n and the tie line l (1 means that the regional power grid n transmits electricity (outflow), -1 means that the regional power grid n receives electricity (inflow), and 0 means that the regional power grid n is not directly related to the tie line l); f l, t are the transmission power of the tie line l in the period t.

3)根据区域电网之间的邻接矩阵，计算出它们之间满足行、列双随机的邻接权重矩阵，其中，行、列双随机特性可表示为

Figure BDA0002075457560000101
矩阵维数为区域电网总个数N；3) According to the adjacency matrix between the regional power grids, calculate the adjacency weight matrix between them that satisfies the double randomness of rows and columns, where the double random characteristics of rows and columns can be expressed as
Figure BDA0002075457560000101
The matrix dimension is the total number N of regional power grids;

4)通过引入lagrange乘子λl对跨区交易电量约束进行松弛，写入目标函数为

Figure BDA0002075457560000102
另外，根据考虑正、负备用的经济分配问题可行性判定条件得到与区域电网n所连接的所有联络线在t时段的总传输功率应满足
Figure BDA0002075457560000103
通过引入乘子μn,t、ωn,t将该约束松弛后写入目标函数。假定由联络线的物理特性所决定的其传输功率的边界为
Figure BDA0002075457560000104
则区域电网n的联络线计划制定问题转化成的无约束优化问题为：4) By introducing the lagrange multiplier λ l , the cross-regional transaction power constraint is relaxed, and the objective function is written as
Figure BDA0002075457560000102
In addition, according to the feasibility judgment conditions of the economic allocation problem considering the positive and negative reserves, the total transmission power of all the tie lines connected to the regional power grid n in the t period should meet the
Figure BDA0002075457560000103
This constraint is relaxed and written into the objective function by introducing multipliers μ n,t and ω n,t . Assume that the boundary of the transmission power determined by the physical characteristics of the tie line is
Figure BDA0002075457560000104
Then the unconstrained optimization problem transformed into the tie line planning problem of the regional power grid n is:

Figure BDA0002075457560000105
Figure BDA0002075457560000105

Figure BDA0002075457560000106
Figure BDA0002075457560000106

其中，El为联络线l的总交易电量，[·]+表示非负运算。Among them, E l is the total transaction electricity of the tie line l, and [·] + represents a non-negative operation.

5)判断步骤2)中的四个不等式是否均成立，若所有区域电网的判定均成立，则说明当前联络线计划在所有区域电网当前的机组组合方式下可行；继续判断当前联络线计划相比上一次制定的联络线计划是否没再变化，若没再变化，即

Figure BDA0002075457560000107
ε可取0.01，则说明当前联络线计划已为最优联络线计划，即当前联络线计划不仅满足了跨区交易电量约束，同时也保证了对所有区域电网当前的机组组合方式可行。否则，若当前联络线计划不满足判定条件或没有收敛，则继续步骤6)。5) Judging whether the four inequalities in step 2) are all established, if the judgments of all regional power grids are established, it means that the current tie line plan is feasible under the current unit combination mode of all regional power grids; continue to judge the current tie line plan compared with Whether the contact line plan made last time has not changed, if not, that is
Figure BDA0002075457560000107
ε can be taken as 0.01, which means that the current tie line plan is the optimal tie line plan, that is, the current tie line plan not only satisfies the cross-regional transaction power constraints, but also ensures that the current unit combination method for all regional power grids is feasible. Otherwise, if the current contact line plan does not meet the judgment condition or does not converge, proceed to step 6).

6)所有区域电网采用分布式惩罚原始-对偶次梯度优化算法求解步骤4)中的无约束优化问题。对于区域电网n，首先求原始变量

Figure BDA0002075457560000108
的次梯度为：6) All regional power grids use distributed penalized primal-dual subgradient optimization algorithm to solve the unconstrained optimization problem in step 4). For the regional grid n, first find the original variable
Figure BDA0002075457560000108
The subgradient of is:

Figure BDA0002075457560000109
Figure BDA0002075457560000109

对偶变量

Figure BDA00020754575600001010
μn,t以及ωn,t的次梯度为：dual variable
Figure BDA00020754575600001010
The subgradients of μ n,t and ωn ,t are:

Figure BDA00020754575600001011
Figure BDA00020754575600001011

Figure BDA0002075457560000111
Figure BDA0002075457560000111

Figure BDA0002075457560000112
Figure BDA0002075457560000112

对原始变量

Figure BDA0002075457560000113
和对偶变量
Figure BDA0002075457560000114
μn,t以及ωn,t分别沿着负梯度方向和正梯度方向进行更新，同时对
Figure BDA0002075457560000115
在其可行域
Figure BDA0002075457560000116
上做投影运算，保证梯度更新后的值在它的可行域内，具体如下：to the original variable
Figure BDA0002075457560000113
and the dual variable
Figure BDA0002075457560000114
μ n, t and ω n, t are updated along the negative and positive gradient directions, respectively, and at the same time
Figure BDA0002075457560000115
in its feasible domain
Figure BDA0002075457560000116
Do the projection operation on the above to ensure that the updated value of the gradient is within its feasible region, as follows:

Figure BDA0002075457560000117
Figure BDA0002075457560000117

Figure BDA0002075457560000118
Figure BDA0002075457560000118

Figure BDA0002075457560000119
Figure BDA0002075457560000119

Figure BDA00020754575600001110
Figure BDA00020754575600001110

区域电网n将更新后的原始变量

Figure BDA00020754575600001111
和对偶变量
Figure BDA00020754575600001112
跟与其连接的区域电网进行共识协调，具体为：Regional grid n will be updated with the original variable
Figure BDA00020754575600001111
and the dual variable
Figure BDA00020754575600001112
Consensus coordination with the regional grid connected to it, specifically:

Figure BDA00020754575600001113
Figure BDA00020754575600001113

Figure BDA00020754575600001114
Figure BDA00020754575600001114

由此，得到新的联络线计划，返回步骤2)继续进行判定。As a result, a new connection line plan is obtained, and the process returns to step 2) to continue the determination.

本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。As will be appreciated by those skilled in the art, the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

最后应当说明的是：以上实施例仅用以说明本发明的技术方案而非对其限制，尽管参照上述实施例对本发明进行了详细的说明，所属领域的普通技术人员应当理解：依然可以对本发明的具体实施方式进行修改或者等同替换，而未脱离本发明精神和范围的任何修改或者等同替换，其均应涵盖在本发明的权利要求保护范围之内。Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit them. Although the present invention has been described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: the present invention can still be Modifications or equivalent replacements are made to the specific embodiments of the present invention, and any modifications or equivalent replacements that do not depart from the spirit and scope of the present invention shall be included within the protection scope of the claims of the present invention.

Claims (14)

1. A method for coordinated optimization of a cross-regional tie, the method comprising:
s1: randomly generating a tie line plan of each scheduling period of a plurality of cross-region tie lines;
s2: determining a feasible tie line plan in a current unit combination mode of the regional power grid based on a predefined feasibility judgment condition;
s3: judging the feasibility of the tie line plan on the current unit combination mode of all regional power grids, and outputting the current tie line plan when the feasibility is realized, so that the tie line plan is formulated; otherwise, performing coordination optimization on the tie line plan and the regional power grid connected with the tie line plan by adopting a distributed punishment primitive-dual gradient optimization algorithm to obtain a new tie line plan, and then executing the step S2.
2. The method according to claim 1, wherein the determining a feasible tie line plan in the current block combination of the regional power grid based on the predefined feasibility determination condition comprises:
constructing an incidence matrix between the regional power grid and a cross-regional connecting line based on the topological graph of the regional power grid system;
acquiring transmission power on the cross-region tie lines based on the incidence matrix between the regional power grid and the cross-region tie lines;
and respectively substituting the sum of the transmission power of the cross-regional connecting line into the feasibility judgment condition of the economic distribution problem considering the positive backup and the negative backup of the corresponding regional power grid, and if the feasibility judgment condition is met, indicating that the connecting line plan is feasible in the current unit combination mode of the regional power grid.
3. The method according to claim 2, wherein the feasibility determination condition is as follows:
Figure FDA0002075457550000011
Figure FDA0002075457550000012
Figure FDA0002075457550000013
Figure FDA0002075457550000014
wherein i is a unit number, n is a regional power grid number, t is a time interval number, and l is a tie line number; i'nThe method comprises the steps of (1) setting a current startup unit set of a regional power grid n;
Figure FDA0002075457550000015
P ithe upper limit and the lower limit of the output of the unit i are set;
Figure FDA0002075457550000016
the maximum positive and negative spare quantity can be provided for the unit i;
Figure FDA0002075457550000017
the positive standby requirement and the negative standby requirement of the regional power grid n in the time period t are met; dn,tLoad demand of a regional power grid n in a period t;
Figure FDA0002075457550000018
the correlation relationship between the regional power grid n and the tie line l is shown; 1 represents that the regional power grid n is power-supplied, and 0 represents that the regional power grid n is not directly related to the tie line l; f. ofl,tThe transmission power of the tie line l during the time period t.
4. The method of claim 1, wherein determining feasibility of the tie-line plan for current crew grouping for all regional grids comprises:
introducing a lagrange multiplier into a regional power grid, relaxing cross-region trading power constraint, and solving a tie line plan of the regional power grid into an unconstrained optimization problem;
and introducing a lagrange multiplier, comparing the current tie line plan output after relaxing the cross-region trading electric quantity constraint with the previous tie line plan, judging whether the change occurs between the tie line plan and the previous tie line plan, and if the change does not occur, indicating that the current tie line plan is feasible for all regional power grids.
5. The method of claim 4, wherein the cross-regional trading power constraint is relaxed by introducing lagrange multiplier into the regional power grid to transform the tie planning problem of the regional power grid into an unconstrained optimization problem by:
Figure FDA0002075457550000021
Figure FDA0002075457550000022
wherein E islTotal transaction power for the call wire l [ ·]+Representing a non-negative operation, fl,tFor the transmission power of the tie line l during the time period t,
Figure FDA0002075457550000023
is the boundary of the transmission power;
Figure FDA0002075457550000024
μn,t、ωn,tare all introduction multipliers, ftThe total transmission power of all the tie lines connected with the regional power grid n in the time period t;
Figure FDA0002075457550000025
and (4) the positive and negative standby requirements of the regional power grid n in the time period t.
6. The method of claim 4, wherein the determination of whether a change has occurred between a link plan and a previous link plan is made by:
Figure FDA0002075457550000026
wherein k represents the number of iterations,
Figure FDA0002075457550000027
for the planning of the current link,
Figure FDA0002075457550000028
the threshold is preset for the last call plan.
7. The method according to claim 1, wherein the performing coordinated optimization on the regional power grid to which the tie-line plan is connected by using a distributed penalty primitive-dual gradient optimization algorithm to obtain a new tie-line plan comprises:
acquiring a tie line transmission power variable of a tie line plan and a secondary gradient of a lagrange multiplier aiming at each regional power grid;
updating the transmission power variable of the tie line along the direction of the negative gradient, performing projection operation in a feasible region, and updating the multiplier variable along the direction of the positive gradient;
and calculating the updated transmission power variable of the tie line and the secondary gradient of the lagrange multiplier, and carrying out consensus coordination on the updated transmission power variable of the tie line and the secondary gradient of the lagrange multiplier and a regional power grid connected with the tie line transmission power variable of the tie line and the secondary gradient of the lagrange multiplier to obtain a new tie line plan.
8. The method of claim 7, wherein the sub-gradient of the tie-line transmit power variable is determined by:
Figure FDA0002075457550000031
wherein,
Figure FDA0002075457550000032
a sub-gradient of the power variable is transmitted for the tie-line,
Figure FDA0002075457550000033
planning for the last tie;
Figure FDA0002075457550000034
P ithe upper limit and the lower limit of the output of the unit i are set; elTotal amount of transaction power for call wire l, Dn,tLoad demand of a regional power grid n in a period t;
Figure FDA0002075457550000035
the correlation relationship between the regional power grid n and the tie line l is shown;
Figure FDA0002075457550000036
and (4) the positive and negative standby requirements of the regional power grid n in the time period t.
9. The method of claim 8, wherein the sub-gradient of the lagrange multiplier is determined by:
Figure FDA0002075457550000037
Figure FDA0002075457550000038
Figure FDA0002075457550000039
wherein,
Figure FDA00020754575500000310
are lagrange multipliers, respectively
Figure FDA00020754575500000311
μn,t、ωn,tA sub-gradient of (a).
10. The method of claim 9, wherein the feasible region of the tie-line transmission power variable is determined by:
Figure FDA0002075457550000041
wherein,
Figure FDA0002075457550000042
is the boundary of the transmission power.
11. The method of claim 10 wherein the updated orderwire transmission power variable and lagrange multiplier are determined by:
Figure FDA0002075457550000043
Figure FDA0002075457550000044
Figure FDA0002075457550000045
Figure FDA0002075457550000046
in the formula,
Figure FDA0002075457550000047
for the updated tie line transmission power variable,
Figure FDA0002075457550000048
μn,t(k+1)、ωn,t(k +1) are all updated lagrange multipliers.
12. The method of claim 7, wherein the new tie plan is determined by:
Figure FDA0002075457550000049
Figure FDA00020754575500000410
13. the method of claim 1, wherein the randomly generating each schedule period tie plan for a plurality of cross-region ties comprises:
and randomly generating a transmission power plan of each scheduling period of the plurality of cross-region connecting lines according to the total length of the scheduling periods and the interval of the scheduling periods, and making a connecting line plan.
14. A coordinated optimization system for a cross-regional tie, the system comprising:
the generating module is used for randomly generating each scheduling time interval junctor plan of the plurality of cross-region junctors;
the judgment module is used for determining a feasible tie line plan in a current unit combination mode of the regional power grid based on a predefined feasibility judgment condition;
the coordination optimization module is used for judging the feasibility of the tie line plan on the current unit combination mode of all regional power grids, outputting the current tie line plan when the feasibility is realized, and finishing the making of the tie line plan; otherwise, carrying out coordination optimization on the tie line plan and the regional power grid connected with the tie line plan by adopting a distributed punishment primitive-dual gradient optimization algorithm to obtain a new tie line plan, and then executing a judgment module.
CN201910452069.0A 2019-05-28 2019-05-28 A method and system for coordination and optimization of cross-regional connection lines Pending CN112016726A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910452069.0A CN112016726A (en) 2019-05-28 2019-05-28 A method and system for coordination and optimization of cross-regional connection lines

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910452069.0A CN112016726A (en) 2019-05-28 2019-05-28 A method and system for coordination and optimization of cross-regional connection lines

Publications (1)

Publication Number Publication Date
CN112016726A true CN112016726A (en) 2020-12-01

Family

ID=73501683

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910452069.0A Pending CN112016726A (en) 2019-05-28 2019-05-28 A method and system for coordination and optimization of cross-regional connection lines

Country Status (1)

Country Link
CN (1) CN112016726A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114862165A (en) * 2022-04-27 2022-08-05 中国南方电网有限责任公司 Cross-domain scheduling method, device and system for power resources

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1478074A2 (en) * 2003-05-13 2004-11-17 Siemens Power Transmission & Distribution, Inc. Dynamic economic dispatch
US20120150504A1 (en) * 2010-12-13 2012-06-14 Siemens Corporation Primal-dual interior point methods for solving discrete optimal power flow problems implementing a chain rule technique for improved efficiency
WO2013120347A1 (en) * 2012-02-17 2013-08-22 中国电力科学研究院 Control method for unifying self-balancing and self-smoothing of micro-grid
CN105226708A (en) * 2015-10-15 2016-01-06 中国电力科学研究院 The equivalent coordination optimizing method of a kind of large scale electric network operation plan
CN106712035A (en) * 2017-03-29 2017-05-24 南方电网科学研究院有限责任公司 Economic dispatching method for power system
CN106849188A (en) * 2017-01-23 2017-06-13 中国电力科学研究院 The combined heat and power optimization method and system of a kind of promotion wind electricity digestion
CN107276127A (en) * 2017-08-18 2017-10-20 西安交通大学 Consider the wind electricity digestion optimization method of the multi-area Interconnected Power System of interconnection electricity transaction plan
US20180356774A1 (en) * 2017-02-22 2018-12-13 Tsinghua University Dispatch method and apparatus for combined heat and power system
CN109583664A (en) * 2018-12-21 2019-04-05 国网山西省电力公司电力科学研究院 A kind of interregional grid Unit Combination decentralized coordinating optimisation strategy containing generation of electricity by new energy

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1478074A2 (en) * 2003-05-13 2004-11-17 Siemens Power Transmission & Distribution, Inc. Dynamic economic dispatch
US20120150504A1 (en) * 2010-12-13 2012-06-14 Siemens Corporation Primal-dual interior point methods for solving discrete optimal power flow problems implementing a chain rule technique for improved efficiency
WO2013120347A1 (en) * 2012-02-17 2013-08-22 中国电力科学研究院 Control method for unifying self-balancing and self-smoothing of micro-grid
CN105226708A (en) * 2015-10-15 2016-01-06 中国电力科学研究院 The equivalent coordination optimizing method of a kind of large scale electric network operation plan
CN106849188A (en) * 2017-01-23 2017-06-13 中国电力科学研究院 The combined heat and power optimization method and system of a kind of promotion wind electricity digestion
US20180356774A1 (en) * 2017-02-22 2018-12-13 Tsinghua University Dispatch method and apparatus for combined heat and power system
CN106712035A (en) * 2017-03-29 2017-05-24 南方电网科学研究院有限责任公司 Economic dispatching method for power system
CN107276127A (en) * 2017-08-18 2017-10-20 西安交通大学 Consider the wind electricity digestion optimization method of the multi-area Interconnected Power System of interconnection electricity transaction plan
CN109583664A (en) * 2018-12-21 2019-04-05 国网山西省电力公司电力科学研究院 A kind of interregional grid Unit Combination decentralized coordinating optimisation strategy containing generation of electricity by new energy

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
MIN XIE ET AL: "Autonomous optimized economic dispatch of active distribution system with multi-microgrids", 《ENERGY》, vol. 153, 15 June 2018 (2018-06-15) *
QIANYAO XU ET AL: "A game theoretical pricing mechanism for multi-area spinning reserve trading considering Wind power Uncertainty", 《IEEE TRANSACTIONS ON POWER SYSTEMS》, vol. 31, no. 2, 31 March 2016 (2016-03-31), XP011599757, DOI: 10.1109/TPWRS.2015.2422826 *
SHIBIAO SHAO ET AL: "A Novel Lagrangian Relaxation Method for Distributed Multi-Area Economic Dispatch", 《2022 IEEE POWER&ENERGY SOCIETY GENERAL MEETING 》, 27 October 2022 (2022-10-27) *
黄瀚燕等: "考虑多重不确定性和备用互济的含风电互联电力系统分散协调调度方法", 《电网技术》, vol. 43, no. 2, 21 February 2019 (2019-02-21) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114862165A (en) * 2022-04-27 2022-08-05 中国南方电网有限责任公司 Cross-domain scheduling method, device and system for power resources
CN114862165B (en) * 2022-04-27 2025-02-18 中国南方电网有限责任公司 A method, device and system for cross-domain scheduling of electric power resources

Similar Documents

Publication Publication Date Title
CN108599373B (en) Cascade analysis method for transmission and distribution coordination scheduling target of high-proportion renewable energy power system
WO2017071230A1 (en) Method for short-term optimal scheduling of multi-agent hydropower station group
WO2022036778A1 (en) Optimal control method and system for load recovery of transmission and distribution coordination
CN112104005B (en) A grid dispatching method and system considering uncertainties in new energy forecasting
CN109861302B (en) Master-slave game-based energy internet day-ahead optimization control method
CN108808734A (en) A kind of wind-electricity integration system distributed optimization scheduling modeling method containing virtual plant
CN107808200B (en) Short-time maintenance plan optimization method and device for power distribution network
CN112241803A (en) An inter-provincial and intra-provincial power balance coordination optimization method and system
CN116706917A (en) Intelligent park collaborative regulation and control method and system based on rapid alternating direction multiplier method
CN104156885B (en) Fast wind power capacity reliability calculating method based on reliability function
CN109995094B (en) A planning method and system for AC and DC hybrid microgrids
CN115347565A (en) Post-disaster distribution network and microgrid collaborative recovery method and device
CN112016726A (en) A method and system for coordination and optimization of cross-regional connection lines
CN110994594A (en) A method and device for cross-regional backup configuration of power system
CN117910641B (en) A dimensionality reduction solution method for joint optimization scheduling graph of multiple storage nodes considering real-time water inflow
Bruno et al. Managing networked hybrid-energy systems: A predictive dispatch approach
CN112134275A (en) Method and system for calculating reliability of power system including wind power plant
CN118261397A (en) A multi-objective economic dispatch method and system for virtual power plants considering exergy efficiency
CN115425697B (en) Distributed cross-region and cross-province scheduling method and system based on alternate direction multiplier method
CN117498298A (en) A microgrid scheduling method based on double-layer planning theory
CN111817298B (en) Multi-scheduling interval distributed energy scheduling method and system containing random wind energy
CN115115276A (en) Virtual power plant scheduling method and system considering uncertainty and privacy protection
CN104410108B (en) For the generating transfer distribution factor quick calculation method that dominant eigenvalues controls
CN107480917A (en) A kind of probability load flow calculation method based on quasi-Monte Carlo simulation
CN108321792A (en) The more scene Cooperative Optimization Algorithms of Electrical Power System Dynamic economic load dispatching of meter and wind-powered electricity generation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination