CN105552892A - Distribution network reconfiguration method - Google Patents
Distribution network reconfiguration method Download PDFInfo
- Publication number
- CN105552892A CN105552892A CN201511005653.XA CN201511005653A CN105552892A CN 105552892 A CN105552892 A CN 105552892A CN 201511005653 A CN201511005653 A CN 201511005653A CN 105552892 A CN105552892 A CN 105552892A
- Authority
- CN
- China
- Prior art keywords
- distribution network
- chromosome
- fitness
- power distribution
- node
- 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
Links
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for AC mains or AC distribution networks
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for AC mains or AC distribution networks
- H02J3/12—Circuit arrangements for AC mains or AC distribution networks for adjusting voltage in AC networks by changing a characteristic of the network load
- H02J3/14—Circuit arrangements for AC mains or AC distribution networks for adjusting voltage in AC networks by changing a characteristic of the network load by switching loads on to, or off from, network, e.g. progressively balanced loading
-
- H02J2103/30—
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for AC mains or AC distribution networks
- H02J3/003—Load forecast, e.g. methods or systems for forecasting future load demand
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B70/00—Technologies for an efficient end-user side electric power management and consumption
- Y02B70/30—Systems integrating technologies related to power network operation and communication or information technologies for improving the carbon footprint of the management of residential or tertiary loads, i.e. smart grids as climate change mitigation technology in the buildings sector, including also the last stages of power distribution and the control, monitoring or operating management systems at local level
- Y02B70/3225—Demand response systems, e.g. load shedding, peak shaving
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S20/00—Management or operation of end-user stationary applications or the last stages of power distribution; Controlling, monitoring or operating thereof
- Y04S20/20—End-user application control systems
- Y04S20/222—Demand response systems, e.g. load shedding, peak shaving
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
Description
技术领域technical field
本发明涉及配电网领域,具体涉及一种配电网重构方法。The invention relates to the field of distribution networks, in particular to a distribution network reconfiguration method.
背景技术Background technique
配电网线损尤其是10kV低压侧线路的损耗,是配电网损失较多的一个环节之一,是线损管理工作的重点之一。为保证电力网络供电的可靠性和安全性,中低压侧配网的接线方式和运行方式变得越来越复杂,逐渐趋向多元化,多条线路相互联络,实行环网的供电模式。目前,配电网络重构除了少数采用基于物理模型的简单启发式算法外,大多数是采用智能算法来解决该问题。配电网络具有辐射状开环运行的强制性要隶,现存方法在编码设计上普遍存在不能保证网络可行的弊病,在计算过程中不可避免地会产生大量的含环或孤岛的不可行网络,使得计算过程中需要频繁地校验网络并为得到有效网络而反复操作修复无效网络。同时现有编码方法构造的算子与实际配电网络结构的变化联系不紧密。上述种种不足导致现有智能算法存在迭代次数多、耗时长的问题,难以运用于解决大规模配电网络的重构。The line loss of the distribution network, especially the loss of the 10kV low-voltage side line, is one of the links with more losses in the distribution network, and it is one of the key points of the line loss management work. In order to ensure the reliability and safety of the power supply network, the wiring and operation methods of the distribution network on the medium and low voltage side have become more and more complex, and gradually tend to be diversified. Multiple lines are connected to each other, and the power supply mode of the ring network is implemented. At present, except for a few simple heuristic algorithms based on physical models, most of the power distribution network reconfiguration uses intelligent algorithms to solve this problem. The power distribution network has the mandatory requirement of radial open-loop operation. The existing methods generally have disadvantages in the coding design that cannot guarantee the feasibility of the network. In the calculation process, a large number of infeasible networks with rings or isolated islands will inevitably be generated. In the calculation process, it is necessary to frequently check the network and repeatedly operate and repair the invalid network in order to obtain a valid network. At the same time, the operators constructed by the existing encoding methods are not closely related to the changes of the actual distribution network structure. The above-mentioned shortcomings lead to the problems of many iterations and long time consumption in the existing intelligent algorithms, which are difficult to be applied to solve the reconstruction of large-scale power distribution networks.
发明内容Contents of the invention
本发明提供一种配电网重构方法,基于遗传方法对配网进行重构,平衡重载变压器的负载率,降低网损,提高供电可靠性。The invention provides a distribution network reconfiguration method, which reconfigures the distribution network based on a genetic method, balances the load rate of a heavy-duty transformer, reduces network loss, and improves power supply reliability.
为实现上述目的,本发明提一种配电网重构方法,其特点是,该方法包含:In order to achieve the above object, the present invention provides a distribution network reconfiguration method, which is characterized in that the method includes:
建立配电网负荷优化模型;Establish distribution network load optimization model;
基于遗传算法对配电网负荷优化模型进行优化,获得配电网重构方案。The distribution network load optimization model is optimized based on the genetic algorithm, and the distribution network reconfiguration scheme is obtained.
上述建立配电网负荷优化模型包含:The distribution network load optimization model established above includes:
建立配电网负荷拓扑结构;Establish distribution network load topology;
建立目标函数;Create an objective function;
确定约束条件。Identify constraints.
上述建立目标函数的方法包含:The above methods for establishing the objective function include:
以网损最小为目标函数;Take the minimum network loss as the objective function;
配电网损的计算公式PLoss如式(1)所示;The calculation formula PLoss of distribution network loss is shown in formula (1);
式(1)中:nb为配电网的支路数;ri为第i支路的电阻;为流过第i条支路的电流;ki为开关(节点)i的状态,ki=0表示分断,ki=1表示闭合;In formula (1): nb is the number of branches of the distribution network; ri is the resistance of the i-th branch; is the current flowing through the i-th branch; ki is the state of the switch (node) i, ki=0 means breaking, ki=1 means closing;
通过潮流计算得到配电网损PLoss。The distribution network loss PLoss is obtained through power flow calculation.
上述约束条件包含:支路容量约束和节点电压约束;The above constraints include: branch capacity constraints and node voltage constraints;
上述支路容量约束为流经支路的功率不能大于该支路的最大功率,如式(2)所示:The above-mentioned branch capacity constraint is that the power flowing through the branch cannot be greater than the maximum power of the branch, as shown in formula (2):
Pij≤Pijmax P ij ≤ P ijmax
Qij≤Qijmax(2)Q ij ≤ Q ijmax (2)
式(2)中,Pij、Pijmax分别为支路i-j的有功功率和支路i-j的有功最大值;Qij、Qijmax分别为支路i-j的无功功率和支路i-j的无功最大值;In formula (2), P ij and P ijmax are respectively the active power of branch ij and the maximum active power of branch ij; Q ij and Q ijmax are respectively the reactive power of branch ij and the maximum reactive power of branch ij value;
上述节点电压约束为节点的电压不能超过该节点允许通过的电压上下限,如式(3)所示:The above node voltage constraint is that the voltage of the node cannot exceed the upper and lower limits of the voltage allowed by the node, as shown in formula (3):
Uimin≤Ui≤Uimax(3)U imin ≤ U i ≤ U imax (3)
式(3)中,Ui、Uimin、Uimax分别为节点i的电压、节点i的电压最小值和节点i的电压最大值。In formula (3), U i , U imin , and U imax are the voltage at node i, the minimum voltage at node i, and the maximum voltage at node i, respectively.
上述基于遗传算法对配电网负荷优化模型进行优化的方法包含:The method for optimizing the distribution network load optimization model based on the genetic algorithm includes:
配电网的初始网络编码生成染色体;The initial network coding of the distribution network generates chromosomes;
解码染色体获取染色体的适应度;Decode the chromosome to obtain the fitness of the chromosome;
根据适应度选择用于繁殖子代的父本个体;According to the fitness, select the parent individual for breeding offspring;
父本个体先后进行交叉操作和变异操作;The parent individual performs crossover operation and mutation operation successively;
重复迭代输出适应度最高的染色体及对应重构方案。Repeat iterations to output the chromosome with the highest fitness and the corresponding reconstruction scheme.
上述配电网的初始网络编码生成染色体包含:The initial network coding generation chromosome of the above distribution network contains:
配电网络采用广度优先生成树算法产生一个初始网络;The distribution network adopts the breadth-first spanning tree algorithm to generate an initial network;
该初始网络进行编码生成一个染色体;The initial network encodes a chromosome;
该染色体通过变异算子生成N个染色体,N个染色体构成遗传算法的初始群体,N为偶数;The chromosome generates N chromosomes through the mutation operator, and N chromosomes constitute the initial population of the genetic algorithm, and N is an even number;
其中,每个染色体对应一个能实现运行的辐射状配电网。Among them, each chromosome corresponds to a radial distribution network that can realize operation.
上述解码染色体获取染色体的适应度包含:The above-mentioned decoded chromosome to obtain the fitness of the chromosome includes:
所有染色体根据编码的逆过程进行解码;All chromosomes are decoded according to the reverse process of encoding;
所有染色体经过潮流计算获取初始网络的网损;每个染色体所获得网损的倒数取为该染色体的适应度;All chromosomes obtain the network loss of the initial network through power flow calculation; the reciprocal of the network loss obtained by each chromosome is taken as the fitness of the chromosome;
其中,若初始网络的节点电压与线路功率越限,则染色体的适应度取为零。Among them, if the node voltage and line power of the initial network exceed the limit, the fitness of the chromosome is taken as zero.
上述根据适应度选择用于繁殖子代的父本个体包含:The above-mentioned paternal individuals selected for breeding offspring according to fitness include:
适应度高于预设阈值的染色体以精英保留的方式直接复制到子代,精英保留的个数为M,M为偶数;Chromosomes whose fitness is higher than the preset threshold are directly copied to offspring in the way of elite retention, and the number of elite retention is M, and M is an even number;
适应度低于预设阈值的染色体以半随机半最优的方法选择(N-M)/2个用于繁殖子代的父本个体。Chromosomes whose fitness is lower than the preset threshold select (N-M)/2 paternal individuals for reproduction in a semi-random and semi-optimal method.
上述父本个体先后进行交叉操作和变异操作包含:The above-mentioned parent individuals successively perform crossover operation and mutation operation including:
偶数个父本个体逐对按交叉算子进行交叉操作;The even-numbered parent individuals perform the crossover operation pair by pair according to the crossover operator;
交叉操作后,对交叉得到的个体按变异算子进行变异,完成繁殖得到子代染色体群;After the crossover operation, the individuals obtained by the crossover are mutated according to the mutation operator, and the reproduction is completed to obtain the offspring chromosome group;
其中交叉率设为0.5;变异率设为1。Among them, the crossover rate is set to 0.5; the mutation rate is set to 1.
上述重复迭代输出适应度最高的染色体及对应重构方案包含:The above repeated iterations output the chromosome with the highest fitness and the corresponding reconstruction scheme includes:
重复解码染色体获取染色体的适应度、根据适应度选择用于繁殖子代的父本个体,及父本个体先后进行交叉操作和变异操作,进行迭代;Repeatedly decode the chromosome to obtain the fitness of the chromosome, select the paternal individual for breeding offspring according to the fitness, and the paternal individual successively performs crossover and mutation operations to iterate;
判断适应度最高的染色体是否持续保持子代不变,若是则停止迭代输出适应度最高的染色体及其对应的重构方案;若否则继续进行迭代。Determine whether the chromosome with the highest fitness keeps its offspring unchanged, and if so, stop iterating and output the chromosome with the highest fitness and its corresponding reconstruction plan; otherwise, continue to iterate.
本发明一种配电网重构方法和现有技术相比,其优点在于,本发明基于遗传方法对配网进行重构,通过改变开关的状态进行负荷重构,降低配电网的线损,提升效益,提高供电可靠性和安全性。Compared with the prior art, the distribution network reconfiguration method of the present invention has the advantage that the distribution network is reconfigured based on the genetic method, and the load reconfiguration is performed by changing the state of the switch to reduce the line loss of the distribution network , Improve efficiency, improve power supply reliability and security.
附图说明Description of drawings
图1为本发明配电网重构方法的方法流程图;Fig. 1 is the method flowchart of distribution network reconfiguration method of the present invention;
图2为IEEE标准3馈线16节点配电系统的拓扑图;Figure 2 is a topological diagram of IEEE standard 3-feeder 16-node power distribution system;
图3为基于遗传算法对配电网负荷优化模型进行优化的流程图。Fig. 3 is a flow chart of optimizing the distribution network load optimization model based on genetic algorithm.
具体实施方式detailed description
以下结合附图,进一步说明本发明的具体实施例。Specific embodiments of the present invention will be further described below in conjunction with the accompanying drawings.
如图1所示,本发明公开了一种基于遗传方法的配电网重构方法,该方法具体包含以下步骤:As shown in Figure 1, the present invention discloses a distribution network reconfiguration method based on a genetic method, which specifically includes the following steps:
S1、建立配电网负荷优化模型。S1. Establish a distribution network load optimization model.
S1.1、建立配电网负荷拓扑结构。S1.1. Establish the distribution network load topology.
首先对配电网资料收集:确定分析的对象,节点数、线路数、开关数,以及线路和节点参数,包括线路电阻,节点有功负荷和无功负荷。Firstly, data collection of distribution network: determine the object of analysis, the number of nodes, the number of lines, the number of switches, and the parameters of lines and nodes, including line resistance, node active load and reactive load.
然后分析并画出系统的拓扑结构图,确定开关的位置、各个节点及开关状态,以及线路和节点参数。Then analyze and draw the topological structure diagram of the system, determine the position of the switch, each node and the state of the switch, as well as the line and node parameters.
如图2所示,为IEEE标准3馈线16节点配电系统的拓扑图。其中,序号(1)-(16)表示负荷,序号1-16表示开关,重构前的开关状态是:开关4、11和13断开,其余开关均闭合。As shown in Figure 2, it is a topological diagram of an IEEE standard 3-feeder 16-node power distribution system. Among them, serial numbers (1)-(16) represent loads, and serial numbers 1-16 represent switches. The switch state before reconstruction is: switches 4, 11 and 13 are off, and the rest of the switches are closed.
S1.2、建立目标函数,其包含:S1.2, establishing an objective function, which includes:
S1.2.1、以网损最小为目标函数。S1.2.1. Take the minimum network loss as the objective function.
S1.2.2、配电网损的计算公式PLoss如式(1)所示;S1.2.2. The calculation formula PLoss of distribution network loss is shown in formula (1);
式(1)中:nb为配电网的支路数;ri为第i支路的电阻;为流过第i条支路的电流;ki为开关(节点)i的状态,ki=0表示分断,ki=1表示闭合;In formula (1): nb is the number of branches of the distribution network; ri is the resistance of the i-th branch; is the current flowing through the i-th branch; ki is the state of the switch (node) i, ki=0 means breaking, ki=1 means closing;
S1.2.3、通过潮流计算得到配电网损PLoss。S1.2.3. Obtain distribution network loss PLoss through power flow calculation.
S1.3、确定约束条件。约束条件包含:支路容量约束和节点电压约束。S1.3. Determine the constraints. Constraints include: branch capacity constraints and node voltage constraints.
支路容量约束为流经支路的功率不能大于该支路的最大功率,如式(2)所示:The branch capacity constraint is that the power flowing through the branch cannot be greater than the maximum power of the branch, as shown in formula (2):
Pij≤Pijmax P ij ≤ P ijmax
Qij≤Qijmax(2)Q ij ≤ Q ijmax (2)
式(2)中,Pij、Pijmax分别为支路i-j的有功功率和支路i-j的有功最大值;Qij、Qijmax分别为支路i-j的无功功率和支路i-j的无功最大值;In formula (2), P ij and P ijmax are respectively the active power of branch ij and the maximum active power of branch ij; Q ij and Q ijmax are respectively the reactive power of branch ij and the maximum reactive power of branch ij value;
节点电压约束为节点的电压不能超过该节点允许通过的电压上下限,如式(3)所示:The node voltage constraint is that the voltage of the node cannot exceed the upper and lower limits of the voltage allowed by the node, as shown in formula (3):
Uimin≤Ui≤Uimax(3)U imin ≤ U i ≤ U imax (3)
式(3)中,Ui、Uimin、Uimax分别为节点i的电压、节点i的电压最小值和节点i的电压最大值。In formula (3), U i , U imin , and U imax are the voltage at node i, the minimum voltage at node i, and the maximum voltage at node i, respectively.
S2、如图3所示,基于遗传算法对配电网负荷优化模型进行优化,获得配电网重构方案。S2. As shown in FIG. 3 , the distribution network load optimization model is optimized based on the genetic algorithm, and a distribution network reconfiguration scheme is obtained.
S2.1、配电网的初始网络编码生成染色体。S2.1. The initial network coding of the distribution network generates chromosomes.
S2.1.1、将待重构配电网络所有开关闭合,配电网络采用广度优先生成树算法产生一个初始网络。S2.1.1. Close all the switches of the distribution network to be reconfigured, and use the breadth-first spanning tree algorithm to generate an initial network for the distribution network.
S2.1.2、该初始网络进行编码生成一个染色体。S2.1.2. The initial network is encoded to generate a chromosome.
S2.1.3、该染色体为蓝本通过变异算子生成N个染色体,N个染色体构成遗传算法的初始群体,N为偶数;其中,每个染色体对应一个能实现运行的辐射状配电网。S2.1.3. The chromosome is used as a blueprint to generate N chromosomes through mutation operators, and N chromosomes constitute the initial population of the genetic algorithm, and N is an even number; each chromosome corresponds to a radial distribution network that can realize operation.
S2.2、解码染色体获取染色体的适应度。S2.2. Decoding the chromosome to obtain the fitness of the chromosome.
S2.2.1、所有染色体根据编码的逆过程进行解码;S2.2.1. All chromosomes are decoded according to the reverse process of encoding;
S2.2.2、所有染色体经过潮流计算获取初始网络的网损;每个染色体所获得网损的倒数取为该染色体的适应度。这里同时校验节点电压及线路功率,若初始网络的节点电压与线路功率越限,则染色体的适应度取为零。S2.2.2. All chromosomes obtain the network loss of the initial network through power flow calculation; the reciprocal of the network loss obtained by each chromosome is taken as the fitness of the chromosome. Here, the node voltage and line power are checked at the same time. If the node voltage and line power of the initial network exceed the limit, the fitness of the chromosome is taken as zero.
S2.3、根据适应度选择用于繁殖子代的父本个体。S2.3. Select paternal individuals for breeding offspring according to fitness.
S2.3.1、首先对适应度高于预设阈值的染色体,不经交叉变异以精英保留的方式直接复制到子代,即广泛采用的精英保留策略,精英保留的个数为M,且M为偶数。S2.3.1. First, chromosomes whose fitness is higher than the preset threshold are directly copied to offspring in the form of elite retention without cross-mutation, which is the widely used elite retention strategy. The number of elite retention is M, and M is even.
S2.3.2、适应度低于预设阈值的染色体,采用半随机半最优的方法选择(N-M)/2个用于繁殖子代的父本个体。S2.3.2. For chromosomes whose fitness is lower than the preset threshold, a semi-random and semi-optimal method is used to select (N-M)/2 paternal individuals for breeding offspring.
S2.4、父本个体先后进行交叉操作和变异操作。S2.4. The father individual performs crossover operation and mutation operation successively.
S2.4.1、对S2.3.2中选择得到的(N-M)/2个父本个体逐对以一定的概率按交叉算子进行交叉操作。S2.4.1. Perform the crossover operation on the (N-M)/2 father individuals selected in S2.3.2 pair by pair with a certain probability according to the crossover operator.
S2.4.2、交叉操作后,按一定的概率对交叉得到的个体按变异算子进行变异,完成繁殖得到子代染色体群。其中交叉与变异的概率满足变异为主、交叉为辅的原则:交叉率设定为0.5;变异率设定为l。S2.4.2. After the crossover operation, mutate the individuals obtained by the crossover according to a certain probability according to the mutation operator, and complete the reproduction to obtain the offspring chromosome group. Among them, the probability of crossover and mutation satisfies the principle of mutation as the main and crossover as supplementary: the crossover rate is set to 0.5; the mutation rate is set to 1.
S2.5、重复迭代输出适应度最高的染色体及对应重构方案。S2.5. Iteratively output the chromosome with the highest fitness and the corresponding reconstruction scheme.
重复解码染色体获取染色体的适应度、根据适应度选择用于繁殖子代的父本个体,及父本个体先后进行交叉操作和变异操作,进行迭代。以群体中适应度最高的染色体连续保持若干代不变为收敛条件。Repeatedly decode the chromosome to obtain the fitness of the chromosome, select the paternal individual for breeding offspring according to the fitness, and the paternal individual performs crossover operation and mutation operation successively, and iterates. The convergence condition is to keep the chromosome with the highest fitness in the population unchanged for several generations.
在迭代过程中,判断适应度最高的染色体是否持续保持若干代的子代不变,若是,满足收敛条件,则停止迭代输出适应度最高的染色体及其对应的重构方案和网损,该结果即为最优;若否,则跳转到S2.3,继续进行迭代。In the iterative process, it is judged whether the chromosome with the highest fitness keeps the offspring unchanged for several generations. If so, the convergence condition is satisfied, and the iterative output of the chromosome with the highest fitness and its corresponding reconstruction scheme and network loss is stopped. The result It is optimal; if not, jump to S2.3 and continue to iterate.
S2.6、完成上述计算后,根据计算结果,根据表1选择出最优方案,其各个开关的状态如表2所示。S2.6. After the above calculation is completed, the optimal solution is selected according to Table 1 according to the calculation results, and the status of each switch is shown in Table 2.
表1、不同开关状态下的网损值Table 1. Network loss values under different switch states
表2、重构后最优网络的开关状态Table 2. The switch state of the optimal network after reconstruction
表2中,C表示开关合上,O表示开关断开。In Table 2, C means that the switch is closed, and O means that the switch is turned off.
尽管本发明的内容已经通过上述优选实施例作了详细介绍,但应当认识到上述的描述不应被认为是对本发明的限制。在本领域技术人员阅读了上述内容后,对于本发明的多种修改和替代都将是显而易见的。因此,本发明的保护范围应由所附的权利要求来限定。Although the content of the present invention has been described in detail through the above preferred embodiments, it should be understood that the above description should not be considered as limiting the present invention. Various modifications and alterations to the present invention will become apparent to those skilled in the art upon reading the foregoing disclosure. Therefore, the protection scope of the present invention should be defined by the appended claims.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511005653.XA CN105552892A (en) | 2015-12-28 | 2015-12-28 | Distribution network reconfiguration method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511005653.XA CN105552892A (en) | 2015-12-28 | 2015-12-28 | Distribution network reconfiguration method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105552892A true CN105552892A (en) | 2016-05-04 |
Family
ID=55831906
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511005653.XA Pending CN105552892A (en) | 2015-12-28 | 2015-12-28 | Distribution network reconfiguration method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105552892A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107979092A (en) * | 2017-12-18 | 2018-05-01 | 国网宁夏电力有限公司经济技术研究院 | It is a kind of to consider distributed generation resource and the power distribution network dynamic reconfiguration method of Sofe Switch access |
| CN107994577A (en) * | 2017-12-29 | 2018-05-04 | 天津大学 | Consider the power distribution network dynamic reconfiguration method of the switch constraint of continuous action in short-term |
| CN108062604A (en) * | 2018-01-05 | 2018-05-22 | 国网河南省电力公司 | A kind of distribution network planning method of meter and network reconfiguration |
| CN108390370A (en) * | 2018-01-18 | 2018-08-10 | 南京邮电大学 | A kind of dynamic reconfiguration method for considering state of weather and power distribution network operation risk being influenced |
| CN108491922A (en) * | 2018-03-21 | 2018-09-04 | 华南理工大学 | Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm |
| CN108537369A (en) * | 2018-03-21 | 2018-09-14 | 华南理工大学 | Improvement population algorithm for distribution network reconfiguration based on local search |
| WO2019030246A1 (en) * | 2017-08-11 | 2019-02-14 | Commissariat A L'energie Atomique Et Aux Energies Alternatives | Computer-implemented method for reconstructing the topology of a network of cables, using a genetic algorithm |
| CN109412145A (en) * | 2018-10-16 | 2019-03-01 | 国网上海市电力公司 | A kind of active distribution network dynamic characteristic appraisal procedure based on synchro measure data |
| CN110348048A (en) * | 2019-05-31 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | Based on the power distribution network optimal reconfiguration method for considering tropical island effect load prediction |
| CN110391660A (en) * | 2018-04-17 | 2019-10-29 | 中国电力科学研究院有限公司 | A kind of network reconstruction method and device promoting power distribution network power supply capacity |
| CN111832836A (en) * | 2020-07-23 | 2020-10-27 | 广东电网有限责任公司 | A distribution network reconfiguration method and system considering load power consumption characteristics |
| CN114629108A (en) * | 2020-12-11 | 2022-06-14 | 国网上海市电力公司 | Power distribution network topology reconstruction method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110098056A1 (en) * | 2009-10-28 | 2011-04-28 | Rhoads Geoffrey B | Intuitive computing methods and systems |
| CN103036234A (en) * | 2013-01-10 | 2013-04-10 | 南京软核科技有限公司 | Power distribution network anti-error optimization method |
| CN103440521A (en) * | 2013-08-21 | 2013-12-11 | 南昌大学 | Coding and genetic algorithm suitable for power distribution network and application in distribution network reconfiguration |
-
2015
- 2015-12-28 CN CN201511005653.XA patent/CN105552892A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110098056A1 (en) * | 2009-10-28 | 2011-04-28 | Rhoads Geoffrey B | Intuitive computing methods and systems |
| CN103036234A (en) * | 2013-01-10 | 2013-04-10 | 南京软核科技有限公司 | Power distribution network anti-error optimization method |
| CN103440521A (en) * | 2013-08-21 | 2013-12-11 | 南昌大学 | Coding and genetic algorithm suitable for power distribution network and application in distribution network reconfiguration |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019030246A1 (en) * | 2017-08-11 | 2019-02-14 | Commissariat A L'energie Atomique Et Aux Energies Alternatives | Computer-implemented method for reconstructing the topology of a network of cables, using a genetic algorithm |
| FR3070075A1 (en) * | 2017-08-11 | 2019-02-15 | Commissariat A L'energie Atomique Et Aux Energies Alternatives | COMPUTER-IMPLEMENTED METHOD OF RECONSTRUCTING THE TOPOLOGY OF A CABLES NETWORK USING GENETIC ALGORITHM |
| US12158488B2 (en) | 2017-08-11 | 2024-12-03 | Commissariat A L'energie Atomique Et Aux Energies Alternatives | Computer-implemented method for reconstructing the topology of a network of cables, using a genetic algorithm |
| CN107979092A (en) * | 2017-12-18 | 2018-05-01 | 国网宁夏电力有限公司经济技术研究院 | It is a kind of to consider distributed generation resource and the power distribution network dynamic reconfiguration method of Sofe Switch access |
| CN107994577B (en) * | 2017-12-29 | 2020-09-01 | 天津大学 | Dynamic Reconfiguration Method of Distribution Network Considering Short-term Continuous Action Constraints of Switches |
| CN107994577A (en) * | 2017-12-29 | 2018-05-04 | 天津大学 | Consider the power distribution network dynamic reconfiguration method of the switch constraint of continuous action in short-term |
| CN108062604A (en) * | 2018-01-05 | 2018-05-22 | 国网河南省电力公司 | A kind of distribution network planning method of meter and network reconfiguration |
| CN108062604B (en) * | 2018-01-05 | 2022-09-23 | 国网河南省电力公司 | Power distribution network planning method considering network reconfiguration |
| CN108390370A (en) * | 2018-01-18 | 2018-08-10 | 南京邮电大学 | A kind of dynamic reconfiguration method for considering state of weather and power distribution network operation risk being influenced |
| CN108491922A (en) * | 2018-03-21 | 2018-09-04 | 华南理工大学 | Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm |
| CN108537369A (en) * | 2018-03-21 | 2018-09-14 | 华南理工大学 | Improvement population algorithm for distribution network reconfiguration based on local search |
| CN110391660A (en) * | 2018-04-17 | 2019-10-29 | 中国电力科学研究院有限公司 | A kind of network reconstruction method and device promoting power distribution network power supply capacity |
| CN110391660B (en) * | 2018-04-17 | 2023-01-24 | 中国电力科学研究院有限公司 | Network reconstruction method and device for improving power supply capacity of power distribution network |
| CN109412145B (en) * | 2018-10-16 | 2022-03-29 | 国网上海市电力公司 | Active power distribution network dynamic characteristic evaluation method based on synchronous measurement data |
| CN109412145A (en) * | 2018-10-16 | 2019-03-01 | 国网上海市电力公司 | A kind of active distribution network dynamic characteristic appraisal procedure based on synchro measure data |
| CN110348048A (en) * | 2019-05-31 | 2019-10-18 | 国网河南省电力公司郑州供电公司 | Based on the power distribution network optimal reconfiguration method for considering tropical island effect load prediction |
| CN110348048B (en) * | 2019-05-31 | 2022-09-30 | 国网河南省电力公司郑州供电公司 | Power distribution network optimization reconstruction method based on consideration of heat island effect load prediction |
| CN111832836A (en) * | 2020-07-23 | 2020-10-27 | 广东电网有限责任公司 | A distribution network reconfiguration method and system considering load power consumption characteristics |
| CN111832836B (en) * | 2020-07-23 | 2021-05-28 | 广东电网有限责任公司 | A distribution network reconfiguration method and system considering load power consumption characteristics |
| CN114629108A (en) * | 2020-12-11 | 2022-06-14 | 国网上海市电力公司 | Power distribution network topology reconstruction method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105552892A (en) | Distribution network reconfiguration method | |
| CN103903055B (en) | Network reconstruction method based on all spanning trees of non-directed graph | |
| CN110348048B (en) | Power distribution network optimization reconstruction method based on consideration of heat island effect load prediction | |
| CN104362623B (en) | Multi-target network reestablishing method for active power distribution network | |
| CN106127304B (en) | One kind is applied to power distribution network Network Topology Design method | |
| CN104102956B (en) | Distribution network expansion planning method based on strategy adaption differential evolution | |
| CN103440521B (en) | A kind of coding be applicable to power distribution network and genetic algorithm and the application Distribution system | |
| CN103136585B (en) | Weighting Voronoi diagram substation planning method based on chaotic and genetic strategy | |
| CN104764980B (en) | A kind of distribution line failure Section Location based on BPSO and GA | |
| CN104134104A (en) | Distribution network reconstruction optimization method based on multi-objective optimization | |
| CN104866919B (en) | Based on the multi-objective planning method containing wind farm for improving NSGA-II | |
| CN113917925B (en) | Mobile robot path planning method based on improved genetic algorithm | |
| CN105321003A (en) | Multi-objective power flow optimization method of VSC-HVDC (voltage source converter-high voltage direct current) containing alternating-current/direct-current system | |
| CN102945296A (en) | Method for reconstructing and modeling uncertainty of distribution network in demand response viewing angle | |
| CN104299053A (en) | Method for selecting optimal path of power distribution and utilization communication network based on genetic algorithm | |
| CN110445167B (en) | A photovoltaic access distribution network optimization method and system | |
| CN106033887A (en) | A Distribution Network Reconfiguration Method Based on Improved PSO-DE Hybrid Algorithm | |
| CN106067066A (en) | Method for diagnosing fault of power transformer based on genetic algorithm optimization pack algorithm | |
| CN104867062A (en) | Low-loss power distribution network optimization and reconfiguration method based on genetic algorithm | |
| CN105574589B (en) | Transformer oil chromatographic method for diagnosing faults based on niche genetic algorithm | |
| CN109217284A (en) | A kind of reconstruction method of power distribution network based on immune binary particle swarm algorithm | |
| CN105184415B (en) | A kind of Distribution Networks Reconfiguration design method | |
| CN106503844A (en) | A kind of power circuit optimum path search method of employing genetic algorithm | |
| CN106405319A (en) | Rough set electric power system fault diagnosis method based on heuristic information | |
| CN107612016A (en) | The planing method of Distributed Generation in Distribution System based on voltage maximal correlation entropy |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160504 |
|
| RJ01 | Rejection of invention patent application after publication |