WO2015196745A1 - 主动配电网的重构方法和装置 - Google Patents

主动配电网的重构方法和装置 Download PDF

Info

Publication number
WO2015196745A1
WO2015196745A1 PCT/CN2014/093197 CN2014093197W WO2015196745A1 WO 2015196745 A1 WO2015196745 A1 WO 2015196745A1 CN 2014093197 W CN2014093197 W CN 2014093197W WO 2015196745 A1 WO2015196745 A1 WO 2015196745A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
switch
cost
nodes
time period
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.)
Ceased
Application number
PCT/CN2014/093197
Other languages
English (en)
French (fr)
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.)
China Power High Technology (beijing) Sci&tech Ltd
North China Electric Power University
State Grid Beijing Electric Power Co Ltd
Economic and Technological Research Institute of State Grid Beijing Electric Power Co Ltd
State Grid Corp of China SGCC
Original Assignee
China Power High Technology (beijing) Sci&tech Ltd
North China Electric Power University
State Grid Beijing Electric Power Co Ltd
Economic and Technological Research Institute of State Grid Beijing Electric Power Co Ltd
State Grid Corp of China SGCC
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 China Power High Technology (beijing) Sci&tech Ltd, North China Electric Power University, State Grid Beijing Electric Power Co Ltd, Economic and Technological Research Institute of State Grid Beijing Electric Power Co Ltd, State Grid Corp of China SGCC filed Critical China Power High Technology (beijing) Sci&tech Ltd
Publication of WO2015196745A1 publication Critical patent/WO2015196745A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—ELECTRIC POWER NETWORKS; 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

Definitions

  • the present invention relates to the field of distribution networks, and in particular to a method and apparatus for reconstructing an active distribution network.
  • the operating state of the power system changes with the load change.
  • the distribution network reconstruction is determined by the current power system operating state.
  • Each power flow time section has an optimal distribution network topology.
  • the load on some nodes changes greatly, the power is unevenly distributed in the network, the voltage changes are relatively large, and when the network loss increases, the network topology needs to be changed to balance the load, reduce the network loss, and pass the voltage quality. From the best perspective of network loss, the distribution network should be reconfigured at all times.
  • the reconstruction requires switching of the switch to achieve, frequent switching operations, increase the probability of failure, and reduce the life of the switchgear. Therefore, in the reconstruction of the active distribution network, it is necessary to find a balance between the network loss and the switching operation cost.
  • the day is usually divided into multiple time periods, each time period is responsible for a work agent, static reconstruction is performed for each time period to obtain a solution set, and The mutual learning between the agents complements and perfects the solution set, then evaluates the solution set, selects the seed solution and the priority replacement solution, and calculates the minimum loss that will be added for each switching operation. Finally, the work agent is iterated and coordinated several times, so that some working agents replace the seed solution until the constraint condition of the number of switching operations is satisfied.
  • the active distribution network is reconstructed by the above method, it is necessary to reconstruct each time period to obtain a solution set, and then learn and evaluate with the solution set of the adjacent time period until the constraint condition of the number of switching operations is satisfied. Due to the need for multiple periods of work agents to iteratively coordinate, it takes a long time to perform active distribution network reconfiguration.
  • the main purpose of the embodiments of the present invention is to provide a method and an apparatus for reconstructing an active distribution network, so as to solve the problem that the reconstruction of the active distribution network takes a long time in the prior art.
  • a method for reconstructing an active distribution network includes: acquiring a plurality of time periods in a predetermined time period; acquiring a plurality of nodes in the active distribution network in each of the plurality of time periods Net loss; comparison The size of the network loss of the plurality of nodes sequentially acquires three nodes with the smallest network loss; the nodes of the two adjacent time segments are paired one by one to form three topological chains, wherein the three nodes follow the switching action The number of times is as a pair from the node having the least number of switching actions among the three nodes of the adjacent time period; and the sum of the network loss cost and the switching cost among the three topological chains formed within the predetermined time
  • the smallest topology chain is used as a reconstruction scheme of the active distribution network, wherein the switching cost is a fee generated by a switching action.
  • the method further includes: passing the topology chain of the active distribution network The sum of the network loss cost and the switch fee is obtained in the following manner:
  • f 1 is the net loss cost
  • f 2 is the switch cost
  • f is the sum of the net loss cost and the switch cost
  • m is the total number of switches
  • r is the switch number
  • a tr is the time period Whether the t switch is selected
  • NK r is the number of actions of the rth switch in each time period
  • d r is the action cost of the switch r
  • c t is the electricity price of the time period t
  • b is the number of the nodes number
  • j K j is the switching state variables, k j of zero indicates a switch is turned on, k j is 1 denotes a switch is closed
  • P tlj, Q tlj said active node j And reactive power
  • U tj is the node voltage of the node j.
  • the active power and the reactive power for calculating the network loss cost are obtained by:
  • P ti and Q ti respectively inject active power and reactive power for node i of said time period t;
  • U ti and U tj are voltages of said node i and voltage of said node j for said time period t, respectively ;
  • G ij is the conductance of the node i, B ij is the susceptance of the node j;
  • ⁇ tij is the angular difference of the voltage between the node i and the node j in the time period t.
  • the voltage of the node i follows the following constraint condition: U timin ⁇ U ti ⁇ U timax
  • U timax is an upper limit of a voltage effective value of the node i
  • U timin is a lower limit of a voltage effective value of the node i.
  • the number of actions of the rth switch in each time period follows the following constraint condition: NK ⁇ ⁇ NK ⁇ max , where NK ⁇ is the number of actions of all switches within the predetermined time; NK ⁇ max is the maximum number of times the operation of all switches in the predetermined time; and NK m ⁇ NK mmax, wherein, m is the total number of switches; NK m is within the predetermined time, the number of operations of the switch No. r; NK rmax as The maximum number of actions of the rth switch is within the predetermined time.
  • an apparatus for reconfiguring an active distribution network includes: a first acquiring unit configured to acquire a plurality of time periods in a predetermined time; and a second acquiring unit configured to acquire multiple in the active power distribution network a network loss of the node in each of the plurality of time periods; the comparing unit is configured to compare the size of the network loss of the plurality of nodes, and sequentially obtain three nodes with the smallest network loss; the pairing unit is set to be The nodes in the two adjacent time segments are paired one by one to form three topological chains, wherein the three nodes are in accordance with the number of switching actions, and the nodes with the least number of switching actions in the three nodes of the adjacent time segments.
  • a determining unit configured to select a topology chain in which the sum of the network loss cost and the switching cost is the smallest among the three topological chains formed in the predetermined time, as a reconstruction scheme of the active distribution network, wherein The switch cost is the cost of the switching action.
  • the apparatus further includes a formula unit configured to select, as the active power distribution, a topology chain in which the sum of the network loss cost and the switch cost is the smallest among the three topological chains formed within the predetermined time Before the network reconstruction solution, the sum of the network loss cost and the switching fee is obtained by:
  • f 1 is the net loss cost
  • f 2 is the switch cost
  • f is the sum of the net loss cost and the switch cost
  • m is the total number of switches
  • r is the switch number
  • a tr is the time period Whether the t switch is selected
  • NK r is the number of actions of the rth switch in each time period
  • d r is the action cost of the switch r
  • c t is the electricity price of the time period t
  • b is the number of the nodes number
  • j K j is the switching state variables, k j of zero indicates a switch is turned on, k j is 1 denotes a switch is closed
  • P tlj, Q tlj said active node j And reactive power
  • U tj is the node voltage of the node j.
  • the formula unit is further configured to obtain the active power and the reactive power for calculating the network loss cost by:
  • P ti and Q ti respectively inject active power and reactive power for node i of said time period t;
  • U ti and U tj are voltages of said node i and voltage of said node j for said time period t, respectively ;
  • G ij is the conductance of the node i, B ij is the susceptance of the node j;
  • ⁇ tij is the angular difference of the voltage between the node i and the node j in the time period t.
  • formula unit is further configured to constrain the voltage of the node i by the following constraints:
  • U timax is an upper limit of a voltage effective value of the node i
  • U timin is a lower limit of a voltage effective value of the node i.
  • the formula unit is further configured to constrain the number of actions of the rth switch in each time period by the following constraint condition: NK ⁇ ⁇ NK ⁇ max , where NK ⁇ is all switches within the predetermined time the number of operations; NK ⁇ max to the number of operations of all the switches within the predetermined maximum time; and NK m ⁇ NK mmax, wherein, m is the total number of switches; NK m is within the predetermined time, switch No. r The number of actions; NK rmax is the maximum number of actions of the rth switch during the predetermined time.
  • multiple time periods of a predetermined time period are acquired; network loss of each time segment of multiple nodes in the active distribution network is obtained; and the network loss of multiple nodes is compared.
  • the three nodes with the smallest network loss are obtained in sequence; the nodes of the adjacent two time segments are paired one by one to form three topological chains, wherein the three nodes follow the number of switching actions from less to more and the adjacent time segments are three.
  • the node with the least number of switching actions in each node acts as a pair; and the topology chain with the smallest sum of network loss cost and switching cost among the three topological chains formed within a predetermined time is used as a method for reconfiguring the active distribution network.
  • FIG. 1 is a flow chart of a method for reconstructing an active distribution network according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of three nodes of each of five time periods in accordance with an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of pairing nodes of two adjacent time periods in the five time periods of FIG. 2;
  • FIG. 4 is a schematic diagram of a reconfiguration apparatus of an active distribution network in accordance with an embodiment of the present invention.
  • Embodiments of the present invention provide a method for reconstructing an active distribution network.
  • FIG. 1 is a flow chart of a method of reconstructing an active distribution network in accordance with an embodiment of the present invention. As shown in the figure, the method for reconstructing the active distribution network includes the following steps:
  • Step S102 Acquire a plurality of time periods within a predetermined time.
  • Step S104 Acquire network loss of each of the plurality of time segments of the plurality of nodes in the active distribution network.
  • Step S106 Compare the size of the network loss of the plurality of nodes, and sequentially obtain the three nodes with the smallest network loss.
  • Step S108 pairing the nodes of the two adjacent time periods one by one to form three topological chains, wherein the three nodes have the least number of switching actions according to the number of switching actions from less to more and the adjacent three time nodes.
  • the nodes act as a pair.
  • Step S110 selecting a topology chain with the smallest sum of the network loss cost and the switching cost among the three topological chains formed in the predetermined time as the reconstruction scheme of the active distribution network, wherein the switching cost is the cost generated by the switching action.
  • the three nodes with the smallest network loss among the multiple nodes in the active distribution network in period 1 are a1, a2, and a3, and the three nodes with the smallest network loss in the active distribution network in time period 2 are b1.
  • B2 and b3 the three nodes with the smallest network loss in the active distribution network in time period 3 are c1, c2 and c3, and the three nodes with the smallest network loss in the active distribution network in period 3 are d1, d2 and d3.
  • the three nodes with the smallest network loss in the active distribution network during the period 5 are e1, e2 and e3.
  • the network structure changes from one topology to another, and is implemented by switching on and off.
  • Dynamic reconstruction takes the number of switching operations as a constraint condition, and the number of operations is small, and the loss of the switch is also small. Therefore, the topology conversion between two adjacent time periods is performed by selecting two topologies with few switching operations. Therefore, first for the phase A better solution set pairing between two adjacent time periods.
  • the principle of pairing is that in the two adjacent time periods, the number of switching actions is the least for the nodes.
  • the total number of operations of the switch in the period 1 is a1, a2, and a3 in descending order
  • the total number of operations of the switch in the period 2 is b1, b2, and b3 in descending order
  • a1 and b1 are paired
  • A2 and b2 are a pair
  • a3 and b3 are paired
  • the total number of operations of the switch in the time period 3 adjacent to the time period 2 is c2, c1, c3 in descending order
  • b1 and c2 are paired
  • the time period 3 is paired with the nodes in the time period 4, and the time period 4 is paired with the nodes in the time period 5, and finally three topological chains as shown in FIG. 3 are formed.
  • FIG. 2 shows only three topological chains of five time periods, and three topological chains of 24 time periods, that is, three topological chains within a predetermined time period, are acquired in the same manner.
  • pairing by acquiring a plurality of time periods within a predetermined time period, and finding three nodes with the smallest network loss in each time period, and then pairing the three nodes in the adjacent two time periods one by one, pairing
  • the principle is that the number of switching actions is as a pair from the nodes with the least number of switching actions in the three nodes in the adjacent time period.
  • three topological chains are obtained, and the network loss costs and switching costs in the three topological chains are followed.
  • the smallest topology chain acts as a reconfiguration scheme for the active distribution network.
  • the node used in the active distribution network is determined to be the node with the smallest network loss in each time period, and in the process of pairing, the node with the least number of switching actions in the adjacent two time periods is selected.
  • the topology chain with the smallest sum of switching cost and network loss cost is selected as the reconstruction scheme of the active distribution network.
  • the process of dynamic solution is completed in the process of forming the topology chain, and no need to perform multiple times.
  • the learning and supplement of the segment solves the problem that the reconstruction of the active distribution network in the prior art takes a long time, and achieves the effect of reducing the time-consuming of the active distribution network reconstruction.
  • the method further includes: acquiring the network loss cost by using the following manner The sum of the switch costs:
  • f 1 is the network loss cost and f 2 is the switching cost.
  • f is the sum of the network loss cost and the switch cost.
  • m is the total number of switches.
  • r is the switch number.
  • a tr is whether the switch is selected during the time period t.
  • NK r is the number of actions of the rth switch in each time period.
  • d r is the operating cost of the switch r.
  • c t is the electricity price of time period t.
  • b is the number of nodes.
  • k j is the state variable of switch j. When k j is 0, it means the switch is open, and when k j is 1, it means the switch is closed.
  • r j is the resistance of node j.
  • P tlj Q tlj is the active power and reactive power of node j.
  • U tj is the node voltage of node j.
  • the network loss is calculated by the active power and reactive power of the node, and the voltage and resistance of the node, and then the cost of the network loss is determined according to the price of electricity in the time period t.
  • the switching cost is calculated according to the number of times of the operation of the switch and the operating cost of the switch, so that the sum of the network loss cost and the switching cost is the smallest.
  • the active power and reactive power for calculating the network loss cost are obtained by:
  • P ti and Q ti inject active power and reactive power into node i of the t period, respectively.
  • U ti and U tj are the voltage of node i at time t and the voltage of node j, respectively.
  • G ij is the conductance of node i
  • B ij is the susceptance of node j.
  • ⁇ tij is the angular difference of the voltage between the node i and the node j in the t period.
  • the voltage of node i follows the following constraints:
  • U timax is the upper limit of the voltage rms value of node i
  • U timin is the lower limit of the voltage rms value of node i. That is, the voltage of the node i is greater than or equal to the lower limit of the voltage effective value of the node i, and is less than or equal to the upper limit of the voltage effective value of the node i.
  • the constraint of the voltage of the node i can be used to avoid errors in the calculation result.
  • the number of actions of the rth switch in each time period follows the following constraints:
  • NK ⁇ ⁇ NK ⁇ max is the maximum number of actions of all switches within a predetermined time, that is, the number of actions of all switches within a predetermined time is less than or equal to the maximum number of actions of all switches within a predetermined time.
  • NK m ⁇ NK mmax, wherein, m is the total number of switches.
  • NK m is the number of operations of the rth switch within a predetermined time.
  • NK rmax is the maximum number of times of the operation of the rth switch within a predetermined time, that is, the predetermined number of times, the number of times of the operation of the rth switch is less than or equal to the maximum number of times of the operation of the rth switch within a predetermined time.
  • the topology chain that is finally selected as the reconstruction scheme of the active distribution network is the scheme with the lowest switching cost and network loss cost.
  • the sum of the switching cost and the network loss cost of each topology chain can be directly calculated, and the topological chain with the smallest total cost can be selected by the sum of the switching cost and the network loss cost of multiple topological chains.
  • the reconstruction scheme avoids the iterative coordination after the static reconstruction of multiple time periods, improves the efficiency of active distribution network reconstruction, and solves the problem that the reconstruction of the active distribution network in the prior art takes a long time. The problem has reached the effect of reducing the time-consuming reconstruction of the active distribution network.
  • the method for reconfiguring the active distribution network in the embodiment of the present invention can be performed by the reconfiguration device of the active distribution network provided by the embodiment of the present invention.
  • the reconfiguration device of the active distribution network in the embodiment of the present invention can also be used.
  • a method for reconstructing an active distribution network provided by an embodiment of the present invention is performed.
  • Embodiments of the present invention provide a reconstruction apparatus for an active distribution network.
  • the apparatus includes a first acquisition unit 10, a second acquisition unit 20, a comparison unit 30, a pairing unit 40, and a determination unit 50.
  • the first acquisition unit 10 is arranged to acquire a plurality of time periods within a predetermined time.
  • the second obtaining unit 20 is configured to acquire network loss of each of the plurality of time periods of the plurality of nodes in the active distribution network.
  • the comparing unit 30 is configured to compare the sizes of the network losses of the plurality of nodes, and sequentially acquire the three nodes with the smallest network loss.
  • the pairing unit 40 is configured to pair the nodes of the two adjacent time periods one by one to form three topological chains, wherein the three nodes switch in the three nodes according to the number of switching actions in descending order and adjacent time segments.
  • the node with the fewest number of times acts as a pair.
  • the determining unit 50 is configured to select a topology chain with the smallest sum of the network loss cost and the switching cost among the three topological chains formed in the predetermined time as the reconstruction scheme of the active distribution network, wherein the switching cost is the cost generated by the switching action.
  • the three nodes with the smallest network loss among the multiple nodes in the active distribution network in period 1 are a1, a2, and a3, and the three nodes with the smallest network loss in the active distribution network in time period 2 are b1.
  • B2 and b3 the three nodes with the smallest network loss in the active distribution network in period 3 are c1, c2 and c3, and the three nodes with the smallest network loss in the active distribution network in period 3 are d1, d2 and d3.
  • the three nodes with the smallest network loss in the active distribution network are e1, e2 and e3.
  • the network structure changes from one topology to another, and is implemented by switching on and off.
  • Dynamic reconstruction takes the number of switching operations as a constraint condition, and the number of operations is small, and the loss of the switch is also small. Therefore, the topology conversion between two adjacent time periods is performed by selecting two topologies with few switching operations. Therefore, the better solution sets for the two adjacent time periods are paired first.
  • the principle of pairing is that in the two adjacent time periods, the number of switching actions is the least for the nodes.
  • the total number of actions of the switch in time period 1 is a1, a2, and a3 in descending order
  • the total number of actions of the switch in time period 2 is b 1 , b 2 , and b 3 in descending order
  • the total number of operations of the switch is c2, c1, c3 in descending order, then a pair of b1 and c2 , b2 and c1 pair, b3 and c3 pair.
  • the time period 3 is paired with the nodes in the time period 4, and the time period 4 is paired with the nodes in the time period 5, and finally three topological chains as shown in FIG. 3 are formed.
  • FIG. 2 shows only three topological chains of five time periods, and three topological chains of 24 time periods, that is, three topological chains within a predetermined time period, are acquired in the same manner.
  • pairing by acquiring a plurality of time periods within a predetermined time period, and finding three nodes with the smallest network loss in each time period, and then pairing the three nodes in the adjacent two time periods one by one, pairing
  • the principle is that the number of switching actions is as a pair from the nodes with the least number of switching actions in the three nodes in the adjacent time period.
  • three topological chains are obtained, and the network loss costs and switching costs in the three topological chains are followed.
  • the smallest topology chain acts as a reconfiguration scheme for the active distribution network.
  • the node used in the active distribution network is determined to be the node with the smallest network loss in each time period, and in the process of pairing, the node with the least number of switching actions in the adjacent two time periods is selected.
  • the topology chain with the smallest sum of switching cost and network loss cost is selected as the reconstruction scheme of the active distribution network.
  • the process of dynamic solution is completed in the process of forming the topology chain, and no need to perform multiple times.
  • the learning and supplement of the segment solves the problem that the reconstruction of the active distribution network in the prior art takes a long time, and achieves the effect of reducing the time-consuming of the active distribution network reconstruction.
  • the apparatus further includes a formula unit configured to select a topology chain in which the sum of the network loss cost and the switch cost is the smallest among the three topological chains formed within the predetermined time, as the reconstruction scheme of the active distribution network, The method obtains the sum of the network loss cost and the switch cost:
  • f 1 is the network loss cost and f 2 is the switching cost.
  • f is the sum of the network loss cost and the switch cost.
  • m is the total number of switches.
  • r is the switch number.
  • a tr is whether the switch is selected during the time period t.
  • NK r is the number of actions of the rth switch in each time period.
  • d r is the operating cost of the switch r.
  • c t is the electricity price of time period t.
  • b is the number of nodes.
  • k j is the state variable of switch j. When k j is 0, it means the switch is open, and when k j is 1, it means the switch is closed.
  • r j is the resistance of node j.
  • P tlj Q tlj is the active power and reactive power of node j.
  • U tj is the node voltage of node j.
  • the network loss is calculated by the active power and reactive power of the node, and the voltage and resistance of the node, and then the cost of the network loss is determined according to the price of electricity in the time period t.
  • the switching cost is calculated according to the number of times of the operation of the switch and the operating cost of the switch, so that the sum of the network loss cost and the switching cost is the smallest.
  • the formula unit is further configured to obtain the active power and the reactive power for calculating the network loss cost by:
  • P ti and Q ti inject active power and reactive power for node i of time period t, respectively.
  • U ti and U tj are the voltage of the node t of the time period t and the voltage of the node j, respectively.
  • G ij is the conductance of node i
  • B ij is the susceptance of node j.
  • ⁇ tij is the angular difference of the voltage between node i and node j in time period t.
  • the formula unit is further arranged to constrain the voltage of node i by the following constraints:
  • U timax is the upper limit of the voltage rms value of node i
  • U timin is the lower limit of the voltage rms value of node i.
  • the voltage of the node i is greater than or equal to the lower limit of the voltage effective value of the node i, and is less than or equal to the upper limit of the voltage effective value of the node i.
  • the constraint of the voltage of the node i can be used to avoid errors in the calculation result.
  • the formula in cell further constraint to the number of operations per time period No. r switch by the following constraints: the number of operations NK ⁇ ⁇ NK ⁇ max, wherein, NK ⁇ for all the switches in a predetermined time.
  • NK ⁇ max is the maximum number of actions of all switches within a predetermined time.
  • NK m is the total number of switches.
  • NK m is the number of operations of the rth switch within a predetermined time.
  • NK rmax is the maximum number of actions of the rth switch within a predetermined time.
  • the topology chain that is finally selected as the reconstruction scheme of the active distribution network is the scheme with the lowest switching cost and network loss cost. And about Under the condition of the beam condition, the sum of the switching cost and the network loss cost of each topology chain can be directly calculated. By the sum of the switching cost and the network loss cost of multiple topological chains, the topology chain with the smallest total cost can be selected as the reconstruction.
  • the scheme avoids the iterative coordination after the static reconstruction of multiple time periods, improves the efficiency of active distribution network reconstruction, and solves the problem that the reconstruction of the active distribution network takes a long time in the prior art. , to achieve the effect of reducing the time-consuming reconstruction of the active distribution network.
  • multiple time periods of a predetermined time period are acquired; network loss of each time segment of multiple nodes in the active distribution network is obtained; and the network loss of multiple nodes is compared.
  • the three nodes with the smallest network loss are obtained in sequence; the nodes of the adjacent two time segments are paired one by one to form three topological chains, wherein the three nodes follow the number of switching actions from less to more and the adjacent time segments are three.
  • the node with the least number of switching actions in each node acts as a pair; and the topology chain with the smallest sum of network loss cost and switching cost among the three topological chains formed within a predetermined time is used as a method for reconfiguring the active distribution network.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Health & Medical Sciences (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Theoretical Computer Science (AREA)
  • Power Engineering (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

本发明实施例公开了一种主动配电网的重构方法和装置。其中，该主动配电网的重构方法包括：获取预定时间内的多个时间段；获取主动配电网中多个节点在多个时间段中每个时间段的网损；比较多个节点的网损的大小，依次获取网损最小的三个节点；对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案，其中，开关费用为开关动作产生的费用。通过本发明实施例，解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网的重构耗时的效果。

Description

主动配电网的重构方法和装置 技术领域
本发明涉及配电网领域，具体而言，涉及一种主动配电网的重构方法和装置。
背景技术
电力系统的运行状态随着负荷的变化而变化，配网重构是由当前电力系统运行状态决定的，每个潮流时间断面都有一个最佳配网拓扑结构。当一些节点上的负荷变化很大，功率在网络中分配不均、电压变化比较大，网损增加时，需要改变网络拓扑结构，使负荷均衡、网损降低、电压质量合格。从网损最佳角度，配网应该时时刻刻都在重构。但是重构需要开关的通断来实现，频繁的开关操作，增加故障概率、减少开关设备的寿命，因此在进行主动配电网的重构时需要在网损与开关操作费用之间寻找平衡。
现有技术在进行主动配电网重构时，通常将一天分为多个时段，每一时段由一个工作代理负责，对每个时段进行静态重构以求得一个解集，并通过相邻代理间的相互学习，对解集进行补充和完善，然后对解集进行评估，从中选出种子解和优先替补解，计算出每次开关操作将增加的最小损耗。最后经工作代理多次迭代协调，令部分工作代理更换种子解，直到满足开关操作次数的约束条件为止。通过上述方法对主动配电网进行重构时，由于需要对每个时段进行重构得到一个解集，再与相邻时段的解集进行学习和评估，直到满足开关操作次数的约束条件。由于需要多个时段的工作代理进迭代协调，导致进行主动配电网重构时耗时较长。
针对现有技术中主动配电网的重构耗时较长的问题，目前尚未提出有效的解决方案。
发明内容
本发明实施例的主要目的在于提供一种主动配电网的重构方法和装置，以解决现有技术中主动配电网的重构耗时较长的问题。
为了实现上述目的，根据本发明实施例的一个方面，提供了一种主动配电网的重构方法。根据本发明实施例的主动配电网的重构方法包括：获取预定时间内的多个时间段；获取所述主动配电网中多个节点在所述多个时间段中每个时间段的网损；比较 所述多个节点的网损的大小，依次获取网损最小的三个节点；对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，所述三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案，其中，所述开关费用为开关动作产生的费用。
进一步地，在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案之前，所述方法还包括：通过以下方式获取所述网损费用与所述开关费用之和：
Figure PCTCN2014093197-appb-000001
其中，f1为所述网损费用，f2为所述开关费用；f为所述网损费用与所述开关费用之和；m为开关总数；r为开关编号；atr为在时间段t内开关是否被选中；NKr为每个时间段内第r号开关的动作次数；dr为开关r的动作成本；ct为所述时间段t的电价；b为所述节点的个数；kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合；rj为节点j的电阻；Ptlj,Qtlj为所述节点j的有功功率和无功功率；Utj为所述节点j的节点电压。
进一步地，通过以下方式获取计算所述网损费用的有功功率和无功功率：
Figure PCTCN2014093197-appb-000002
其中，Pti和Qti分别为所述时间段t的节点i注入有功功率和无功功率；Uti和Utj分别为所述时间段t所述节点i的电压和所述节点j的电压；Gij为所述节点i的电导，Bij为所述节点j的电纳；δtij为所述时间段t内所述节点i和所述节点j之间电压的角差。
进一步地，所述节点i的电压遵循以下约束条件：Utimin≤Uti≤Utimax
其中，所述Utimax为所述节点i的电压有效值的上限，Utimin为所述节点i的电压有效值的下限。
进一步地，所述每个时间段内第r号开关的动作次数遵循以下约束条件：NK∑≤NK∑max，其中，NK∑为在所述预定时间内所有开关的动作次数；NK∑max为在所述预定时间内所有开关的动作次数最大值；以及NKm≤NKmmax，其中，m为开关总数；NKm为在所述预定时间内，第r号开关的动作次数；NKrmax为在所述预定时间内，第r号开关的动作次数最大值。
为了实现上述目的，根据本发明实施例的另一方面，提供了一种主动配电网的重构装置。根据本发明实施例的主动配电网的重构装置包括：第一获取单元，设置为获取预定时间内的多个时间段；第二获取单元，设置为获取所述主动配电网中多个节点在所述多个时间段中每个时间段的网损；比较单元，设置为比较所述多个节点的网损的大小，依次获取网损最小的三个节点；配对单元，设置为对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，所述三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及确定单元，设置为在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案，其中，所述开关费用为开关动作产生的费用。
进一步地，所述装置还包括公式单元，所述公式单元设置为在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案之前，通过以下方式获取所述网损费用与所述开关费用之和：
Figure PCTCN2014093197-appb-000003
其中，f1为所述网损费用，f2为所述开关费用；f为所述网损费用与所述开关费用之和；m为开关总数；r为开关编号；atr为在时间段t内开关是否被选中；NKr为每个时间段内第r号开关的动作次数；dr为开关r的动作成本；ct为所述时间段t的电价；b为所述节点的个数；kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合；rj为节点j的电阻；Ptlj,Qtlj为所述节点j的有功功率和无功功率；Utj为所述节点j的节点电压。
进一步地，所述公式单元还设置为通过以下方式获取计算所述网损费用的有功功率和无功功率：
Figure PCTCN2014093197-appb-000004
其中，Pti和Qti分别为所述时间段t的节点i注入有功功率和无功功率；Uti和Utj分别为所述时间段t所述节点i的电压和所述节点j的电压；Gij为所述节点i的电导，Bij为所述节点j的电纳；δtij为所述时间段t内所述节点i和所述节点j之间电压的角差。
进一步地，所述公式单元还设置为通过以下约束条件约束所述节点i的电压：
Utimin≤Uti≤Utimax
其中，所述Utimax为所述节点i的电压有效值的上限，Utimin为所述节点i的电压有效值的下限。
进一步地，所述公式单元还设置为通过以下约束条件约束所述每个时间段内第r号开关的动作次数：NK∑≤NK∑max，其中，NK∑为在所述预定时间内所有开关的动作次数；NK∑max为在所述预定时间内所有开关的动作次数最大值；以及NKm≤NKmmax，其中，m为开关总数；NKm为在所述预定时间内，第r号开关的动作次数；NKrmax为在所述预定时间内，第r号开关的动作次数最大值。
通过本发明实施例，采用获取预定时间内的多个时间段；获取主动配电网中多个节点在多个时间段中每个时间段的网损；比较多个节点的网损的大小，依次获取网损最小的三个节点；对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案的方法，解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网的重构耗时的效果。
附图说明
构成本申请的一部分的附图用来提供对本发明的进一步理解，本发明的示意性实施例及其说明用于解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据本发明实施例的主动配电网的重构方法的流程图；
图2是根据本发明实施例的5个时间段中每个时间段的三个节点的示意图；
图3是对图2的5个时间段中相邻两个时间段的节点一一配对的示意图；以及
图4是根据本发明实施例的主动配电网的重构装置的示意图。
具体实施方式
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本发明。
为了使本技术领域的人员更好地理解本发明方案，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分的实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都应当属于本发明保护的范围。
需要说明的是，本发明的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换，以便这里描述的本发明的实施例能够以除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
本发明实施例提供了一种主动配电网的重构方法。
图1是根据本发明实施例的主动配电网的重构方法的流程图。如图所示，该主动配电网的重构方法包括如下步骤：
步骤S102，获取预定时间内的多个时间段。
步骤S104，获取主动配电网中多个节点在多个时间段中每个时间段的网损。
步骤S106，比较多个节点的网损的大小，依次获取网损最小的三个节点。
步骤S108，对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对。
步骤S110，在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案，其中，开关费用为开关动作产生的费用。
例如，获取24小时内的24个时间段，即每个小时作为一个时间段。以下结合图2以5个时间段为例对上述方案进行说明。
如图所示，在时段1主动配电网中多个节点中网损最小的三个节点是a1、a2、a3，在时间段2主动配电网中网损最小的三个节点为b1、b2和b3，在时间段3主动配电网中网损最小的三个节点为c1、c2和c3，在时段3主动配电网中网损最小的三个节点为d1、d2和d3，在时段5主动配电网中网损最小的三个节点为e1、e2和e3。
网络结构从一个拓扑结构转变为另一个时段的拓扑结构，通过开关的通断实现。动态重构将开关动作次数作为约束条件，动作次数少，开关的损耗也小。因此相邻两个时间段之间的拓扑转换，选择开关动作次数少的两个拓扑结构进行。因此，先为相 邻两个时间段的较优解集配对。配对原则是在相邻两个时段内，开关动作次数最少节点的为一对儿。
例如：时间段1中开关的总的动作次数由少至多依次为a1、a2、a3，时间段2中开关的总动作次数由少至多依次为b1、b2和b3，则a1与b1一对，a2与b2一对，a3与b3一对，在与时间段2相邻的时间段3中开关的总动作次数由少至多依次为c2、c1、c3，那么，b1与c2一对，b2与c1一对，b3与c3一对。在时间段2中的节点与时间段1中的节点配对，且时间段2中的节点与时间段3中的节点配对之后，由于每个时间段内都有三个节点，因此形成了三条拓扑链。
同理，如图2所示，时间段3与时间段4中的节点一一配对，时间段4与时间段5中的节点一一配对，最终形成如图3所示的三条拓扑链。
如图2所示，形成的三条拓扑链分别为：
a1-b1-c2-d2-e3；a2-b2-c1-d3-e2；a3-b3-c3-d1-e1。
图2仅示出了五个时间段的三条拓扑链，按照同样的方式获取24个时间段的三条拓扑链，即在预定时间段内的三条拓扑链。
在形成预定时间段内的三条拓扑链之后，计算每条拓扑链的开关费用和网损费用之和，将三条拓扑链中开关费用和网损费用之和最小的一条拓扑链作为主动配电网的重构方案。
通过上述实施例，通过获取预定时间内的多个时间段，并找到每个时间段内网损最小的三个节点，再对相邻两个时间段内的三个节点进行一一配对，配对的原则是开关动作次数由少至多依次与相邻时间段的三个节点中开关动作次数最少的节点作为一对，在配对后得到三条拓扑链，将三条拓扑链中网损费用和开关费用之后最小的拓扑链作为主动配电网的重构方案。由于在确定主动配电网的重构方案时，采用的节点是每个时间段内网损最小的节点，而且在配对的过程中，选择相邻两个时间段内的开关动作次数最少的节点作为一对，最终选择开关费用和网损费用之和最小的拓扑链作为主动配电网的重构方案，在形成拓扑链的过程中即完成了动态求解的过程，不需要再进行多个时间段的学习和补充，从而解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网重构耗时的效果。
可选地，在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案之前，该方法还包括通过以下方式获取网损费用与开关费用之和：
Figure PCTCN2014093197-appb-000005
其中，f1为网损费用，f2为开关费用。f为网损费用与开关费用之和。m为开关总数。r为开关编号。atr为在时间段t内开关是否被选中。NKr为每个时间段内第r号开关的动作次数。dr为开关r的动作成本。ct为时间段t的电价。b为节点的个数。kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合。rj为节点j的电阻。Ptlj,Qtlj为节点j的有功功率和无功功率。Utj为节点j的节点电压。
通过节点的有功功率和无功功率，以及该节点的电压和电阻计算得到网损，再根据时间段t内的电价确定费用网损费用。根据开关的动作次数及开关的动作成本计算得到开关费用，使得网损费用和开关费用二者之和为最小。
可选地，通过以下方式获取计算网损费用的有功功率和无功功率：
Figure PCTCN2014093197-appb-000006
其中，Pti和Qti分别为t时段的节点i注入有功功率和无功功率。Uti和Utj分别为t时段节点i的电压和节点j的电压。Gij为节点i的电导，Bij为节点j的电纳。δtij为t时段内节点i和节点j之间电压的角差。
可选地，节点i的电压遵循以下约束条件：
Utimin≤Uti≤Utimax
其中，Utimax为节点i的电压有效值的上限，Utimin为节点i的电压有效值的下限。即节点i的电压大于等于节点i的电压有效值的下限，小于等于节点i的电压有效值的上限。利用该节点i的电压的约束条件能够避免计算结果出错。
可选地，每个时间段内第r号开关的动作次数遵循以下约束条件：
NK∑≤NK∑max，其中，NK∑为在预定时间内所有开关的动作次数。NK∑max为在预定时间内所有开关的动作次数最大值，即预定时间内所有开关的动作次数小于等于预定时间内所有开关的动作次数最大值。
NKm≤NKmmax，其中，m为开关总数。NKm为在预定时间内，第r号开关的动作次数。NKrmax为在预定时间内，第r号开关的动作次数最大值，即预定时间内，第r号开关的动作次数小于等于在预定时间内，第r号开关的动作次数最大值。
通过对开关的动作次数的限制，能够保证求解开关费用时，开关的动作次数不超出其动作次数最大值。
通过在上述约束条件的约束下，计算拓扑链的开关费用和网损费用，使得最终选择作为主动配电网的重构方案的拓扑链为开关费用和网损费用最小的方案。并且，约束条件的作用下，可以直接计算出每个拓扑链的开关费用和网损费用之和，通过多个拓扑链的开关费用和网损费用之和即可选择总费用最小的拓扑链作为重构方案，避免了多个时段的静态重构得到解集后的迭代协调，提高了进行主动配电网重构的效率，解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网的重构耗时的效果。
本发明实施例的主动配电网的重构方法可以通过本发明实施例所提供的主动配电网的重构装置来执行，本发明实施例的主动配电网的重构装置也可以用于执行本发明实施例所提供的主动配电网的重构方法。
本发明实施例提供了一种主动配电网的重构装置。
图4是根据本发明实施例的主动配电网的重构装置的示意图。如图所示，该装置包括：第一获取单元10、第二获取单元20、比较单元30、配对单元40和确定单元50。
第一获取单元10设置为获取预定时间内的多个时间段。
第二获取单元20设置为获取主动配电网中多个节点在多个时间段中每个时间段的网损。
比较单元30设置为比较多个节点的网损的大小，依次获取网损最小的三个节点。
配对单元40设置为对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对。
确定单元50设置为在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案，其中，开关费用为开关动作产生的费用。
例如，获取24小时内的24个时间段，即每个小时作为一个时间段。以下结合图2以5个时间段为例对上述方案进行说明。
如图所示，在时段1主动配电网中多个节点中网损最小的三个节点是a1、a2、a3，在时间段2主动配电网中网损最小的三个节点为b1、b2和b3，在时段3主动配电网中网损最小的三个节点为c1、c2和c3，在时段3主动配电网中网损最小的三个节点为d1、d2和d3，在时段5主动配电网中网损最小的三个节点为e1、e2和e3。
网络结构从一个拓扑结构转变为另一个时段的拓扑结构，通过开关的通断实现。动态重构将开关动作次数作为约束条件，动作次数少，开关的损耗也小。因此相邻两个时间段之间的拓扑转换，选择开关动作次数少的两个拓扑结构进行。因此，先为相邻两个时间段的较优解集配对。配对原则是在相邻两个时段内，开关动作次数最少节点的为一对儿。
例如：时间段1中开关的总的动作次数由少至多依次为a1、a2、a3，时间段2中开关的总动作次数由少至多依次为b1、b2和b3，则a1与b1一对，a2与b2一对，a3与b3一对，在与时间段2相邻的时间段3中开关的总动作次数由少至多依次为c2、c1、c3，那么，b1与c2一对，b2与c1一对，b3与c3一对。在时间段2中的节点与时间段1中的节点配对，且时间段2中的节点与时间段3中的节点配对之后，由于每个时间段内都有三个节点，因此形成了三条拓扑链。
同理，如图2所示，时间段3与时间段4中的节点一一配对，时间段4与时间段5中的节点一一配对，最终形成如图3所示的三条拓扑链。
如图2所示，形成的三条拓扑链分别为：
a1-b1-c2-d2-e3；a2-b2-c1-d3-e2；a3-b3-c3-d1-e1。
图2仅示出了五个时间段的三条拓扑链，按照同样的方式获取24个时间段的三条拓扑链，即在预定时间段内的三条拓扑链。
在形成预定时间段内的三条拓扑链之后，计算每条拓扑链的开关费用和网损费用之和，将三条拓扑链中开关费用和网损费用之和最小的一条拓扑链作为主动配电网的重构方案。
通过上述实施例，通过获取预定时间内的多个时间段，并找到每个时间段内网损最小的三个节点，再对相邻两个时间段内的三个节点进行一一配对，配对的原则是开关动作次数由少至多依次与相邻时间段的三个节点中开关动作次数最少的节点作为一对，在配对后得到三条拓扑链，将三条拓扑链中网损费用和开关费用之后最小的拓扑链作为主动配电网的重构方案。由于在确定主动配电网的重构方案时，采用的节点是每个时间段内网损最小的节点，而且在配对的过程中，选择相邻两个时间段内的开关动作次数最少的节点作为一对，最终选择开关费用和网损费用之和最小的拓扑链作为主动配电网的重构方案，在形成拓扑链的过程中即完成了动态求解的过程，不需要再进行多个时间段的学习和补充，从而解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网重构耗时的效果。
可选地，装置还包括公式单元，公式单元设置为在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案之前，通过以下方式获取网损费用与开关费用之和：
Figure PCTCN2014093197-appb-000007
其中，f1为网损费用，f2为开关费用。f为网损费用与开关费用之和。m为开关总数。r为开关编号。atr为在时间段t内开关是否被选中。NKr为每个时间段内第r号开关的动作次数。dr为开关r的动作成本。ct为时间段t的电价。b为节点的个数。kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合。rj为节点j的电阻。Ptlj,Qtlj为节点j的有功功率和无功功率。Utj为节点j的节点电压。
通过节点的有功功率和无功功率，以及该节点的电压和电阻计算得到网损，再根据时间段t内的电价确定费用网损费用。根据开关的动作次数及开关的动作成本计算得到开关费用，使得网损费用和开关费用二者之和为最小。
可选地，公式单元还设置为通过以下方式获取计算网损费用的有功功率和无功功率：
Figure PCTCN2014093197-appb-000008
其中，Pti和Qti分别为时间段t的节点i注入有功功率和无功功率。Uti和Utj分别为时间段t节点i的电压和节点j的电压。Gij为节点i的电导，Bij为节点j的电纳。δtij为时间段t内节点i和节点j之间电压的角差。
可选地，公式单元还设置为通过以下约束条件约束节点i的电压：
Utimin≤Uti≤Utimax
其中，Utimax为节点i的电压有效值的上限，Utimin为节点i的电压有效值的下限。
即节点i的电压大于等于节点i的电压有效值的下限，小于等于节点i的电压有效值的上限。利用该节点i的电压的约束条件能够避免计算结果出错。
可选地，公式单元还设置为通过以下约束条件约束每个时间段内第r号开关的动作次数：NK∑≤NK∑max，其中，NK∑为在预定时间内所有开关的动作次数。NK∑max为在预定时间内所有开关的动作次数最大值。以及NKm≤NKmmax，其中，m为开关总数。NKm为在预定时间内，第r号开关的动作次数。NKrmax为在预定时间内，第r号开关的动作次数最大值。
通过对开关的动作次数的限制，能够保证求解开关费用时，开关的动作次数不超出其动作次数最大值。
通过在上述约束条件的约束下，计算拓扑链的开关费用和网损费用，使得最终选择作为主动配电网的重构方案的拓扑链为开关费用和网损费用最小的方案。并且，约 束条件的作用下，可以直接计算出每个拓扑链的开关费用和网损费用之和，通过多个拓扑链的开关费用和网损费用之和即可选择总费用最小的拓扑链作为重构方案，避免了多个时段的静态重构得到解集后的迭代协调，提高了进行主动配电网重构的效率，解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网的重构耗时的效果。
以上所述仅为本发明的可选实施例而已，并不用于限制本发明，对于本领域的技术人员来说，本发明可以有各种更改和变化。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
工业实用性
通过本发明实施例，采用获取预定时间内的多个时间段；获取主动配电网中多个节点在多个时间段中每个时间段的网损；比较多个节点的网损的大小，依次获取网损最小的三个节点；对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及在预定时间内形成的三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为主动配电网的重构方案的方法，解决了现有技术中主动配电网的重构耗时较长的问题，达到了减少主动配电网的重构耗时的效果。

Claims (10)

  1. 一种主动配电网的重构方法，包括：
    获取预定时间内的多个时间段；
    获取所述主动配电网中多个节点在所述多个时间段中每个时间段的网损；
    比较所述多个节点的网损的大小，依次获取网损最小的三个节点；
    对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，所述三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及
    在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案，其中，所述开关费用为开关动作产生的费用。
  2. 根据权利要求1所述的方法，其中，在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案之前，所述方法还包括：
    通过以下方式获取所述网损费用与所述开关费用之和：
    Figure PCTCN2014093197-appb-100001
    其中，f1为所述网损费用，f2为所述开关费用；f为所述网损费用与所述开关费用之和；m为开关总数；r为开关编号；atr为在时间段t内开关是否被选中；NKr为每个时间段内第r号开关的动作次数；dr为开关r的动作成本；ct为所述时间段t的电价；b为所述节点的个数；kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合；rj为节点j的电阻；Ptlj,Qtlj为所述节点j的有功功率和无功功率；Utj为所述节点j的节点电压。
  3. 根据权利要求2所述的方法，其中，通过以下方式获取计算所述网损费用的有功功率和无功功率：
    Figure PCTCN2014093197-appb-100002
    其中，Pti和Qti分别为所述时间段t的节点i注入有功功率和无功功率；Uti和Utj分别为所述时间段t所述节点i的电压和所述节点j的电压；Gij为所述节点i的电导，Bij为所述节点j的电纳；δtij为所述时间段t内所述节点i和所述节点j之间电压的角差。
  4. 根据权利要求3所述的方法，其中，所述节点i的电压遵循以下约束条件：
    Utimin≤Uti≤Utimax
    其中，所述Utimax为所述节点i的电压有效值的上限，Utimin为所述节点i的电压有效值的下限。
  5. 根据权利要求2所述的方法，其中，所述每个时间段内第r号开关的动作次数遵循以下约束条件：
    NK∑≤NK∑max，其中，NK∑为在所述预定时间内所有开关的动作次数；NK∑max为在所述预定时间内所有开关的动作次数最大值；以及
    NKm≤NKmmax，其中，m为开关总数；NKm为在所述预定时间内，第r号开关的动作次数；NKrmax为在所述预定时间内，第r号开关的动作次数最大值。
  6. 一种主动配电网的重构装置，包括：
    第一获取单元，设置为获取预定时间内的多个时间段；
    第二获取单元，设置为获取所述主动配电网中多个节点在所述多个时间段中每个时间段的网损；
    比较单元，设置为比较所述多个节点的网损的大小，依次获取网损最小的三个节点；
    配对单元，设置为对相邻两个时间段的节点进行一一配对，形成三条拓扑链，其中，所述三个节点按照开关动作次数由少至多依次与相邻的时间段的三个节点中开关动作次数最少的节点作为一对；以及
    确定单元，设置为在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案，其中，所述开关费用为开关动作产生的费用。
  7. 根据权利要求6所述的装置，其中，所述装置还包括公式单元，
    所述公式单元设置为在所述预定时间内形成的所述三条拓扑链中选择网损费用与开关费用之和最小的拓扑链作为所述主动配电网的重构方案之前，通过以下方式获取所述网损费用与所述开关费用之和：
    Figure PCTCN2014093197-appb-100003
    其中，f1为所述网损费用，f2为所述开关费用；f为所述网损费用与所述开关费用之和；m为开关总数；r为开关编号；atr为在时间段t内开关是否被选中；NKr为每个时间段内第r号开关的动作次数；dr为开关r的动作成本；ct为所述时间段t的电价；b为所述节点的个数；kj为开关j的状态变量，kj为0时代表开关打开，kj为1时代表开关闭合；rj为节点j的电阻；Ptlj,Qtlj为所述节点j的有功功率和无功功率；Utj为所述节点j的节点电压。
  8. 根据权利要求7所述的装置，其中，所述公式单元还设置为通过以下方式获取计算所述网损费用的有功功率和无功功率：
    Figure PCTCN2014093197-appb-100004
    其中，Pti和Qti分别为所述时间段t的节点i注入有功功率和无功功率；Uti和Utj分别为所述时间段t所述节点i的电压和所述节点j的电压；Gij为所述节 点i的电导，Bij为所述节点j的电纳；δtij为所述时间段t内所述节点i和所述节点j之间电压的角差。
  9. 根据权利要求8所述的装置，其中，所述公式单元还设置为通过以下约束条件约束所述节点i的电压：
    Utimin≤Uti≤Utimax
    其中，所述Utimax为所述节点i的电压有效值的上限，Utimin为所述节点i的电压有效值的下限。
  10. 根据权利要求7所述的装置，其中，所述公式单元还设置为通过以下约束条件约束所述每个时间段内第r号开关的动作次数：
    NK∑≤NK∑max，其中，NK∑为在所述预定时间内所有开关的动作次数；NK∑max为在所述预定时间内所有开关的动作次数最大值；以及
    NKm≤NKmmax，其中，m为开关总数；NKm为在所述预定时间内，第r号开关的动作次数；NKrmax为在所述预定时间内，第r号开关的动作次数最大值。
PCT/CN2014/093197 2014-06-25 2014-12-05 主动配电网的重构方法和装置 Ceased WO2015196745A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410295162.2 2014-06-25
CN201410295162.2A CN105279703A (zh) 2014-06-25 2014-06-25 主动配电网的重构方法和装置

Publications (1)

Publication Number Publication Date
WO2015196745A1 true WO2015196745A1 (zh) 2015-12-30

Family

ID=54936657

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/093197 Ceased WO2015196745A1 (zh) 2014-06-25 2014-12-05 主动配电网的重构方法和装置

Country Status (2)

Country Link
CN (1) CN105279703A (zh)
WO (1) WO2015196745A1 (zh)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107451670A (zh) * 2016-05-30 2017-12-08 中国电力科学研究院 一种用于主动配电网的日前分层协调调度方法
CN109524955A (zh) * 2018-10-15 2019-03-26 昆明理工大学 一种考虑源荷电压特性的主动配电网优化方法
CN110516876A (zh) * 2019-08-28 2019-11-29 国网上海市电力公司 一种最佳分断开关优化方法及系统
CN111682524A (zh) * 2020-05-28 2020-09-18 天津大学 一种配电网多阶段快速重构方法
CN114256839A (zh) * 2021-12-21 2022-03-29 青岛鼎信通讯股份有限公司 一种基于台区电气拓扑的精准线损分析方法
CN120377268A (zh) * 2025-06-25 2025-07-25 华能澜沧江水电股份有限公司 基于启发式规则的配电网动态重构方法及装置

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108242806B (zh) * 2016-12-26 2020-02-18 中国能源建设集团广东省电力设计研究院有限公司 馈线自动化开关布点方法和系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060111860A1 (en) * 2002-11-06 2006-05-25 Aplicaciones En Informatica Avanzada, S.A. System and method for monitoring and managing electrical power transmission and distribution networks
CN102412574A (zh) * 2011-11-28 2012-04-11 上海市电力公司 一种配电网重构算法
CN103515954A (zh) * 2013-09-10 2014-01-15 河海大学 一种基于时变负荷分布特性的配电网动态重构方法
CN103701117A (zh) * 2013-12-19 2014-04-02 浙江大学 基于混合人工智能的主动配电网动态拓扑重构方法
CN103779861A (zh) * 2013-12-30 2014-05-07 天津大学 配电网主动重构策略及其预防控制方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060111860A1 (en) * 2002-11-06 2006-05-25 Aplicaciones En Informatica Avanzada, S.A. System and method for monitoring and managing electrical power transmission and distribution networks
CN102412574A (zh) * 2011-11-28 2012-04-11 上海市电力公司 一种配电网重构算法
CN103515954A (zh) * 2013-09-10 2014-01-15 河海大学 一种基于时变负荷分布特性的配电网动态重构方法
CN103701117A (zh) * 2013-12-19 2014-04-02 浙江大学 基于混合人工智能的主动配电网动态拓扑重构方法
CN103779861A (zh) * 2013-12-30 2014-05-07 天津大学 配电网主动重构策略及其预防控制方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
WANG, ZHIYU ET AL.: "Distribution Network Reconfiguration Based on Time Subsection", RELAY, vol. 34, no. 8, 16 April 2006 (2006-04-16), pages 35 - 39, XP055246697 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107451670A (zh) * 2016-05-30 2017-12-08 中国电力科学研究院 一种用于主动配电网的日前分层协调调度方法
CN107451670B (zh) * 2016-05-30 2022-02-22 中国电力科学研究院 一种用于主动配电网的日前分层协调调度方法
CN109524955A (zh) * 2018-10-15 2019-03-26 昆明理工大学 一种考虑源荷电压特性的主动配电网优化方法
CN109524955B (zh) * 2018-10-15 2021-11-30 昆明理工大学 一种考虑源荷电压特性的主动配电网优化方法
CN110516876A (zh) * 2019-08-28 2019-11-29 国网上海市电力公司 一种最佳分断开关优化方法及系统
CN110516876B (zh) * 2019-08-28 2022-12-27 国网上海市电力公司 一种最佳分断开关优化方法及系统
CN111682524A (zh) * 2020-05-28 2020-09-18 天津大学 一种配电网多阶段快速重构方法
CN114256839A (zh) * 2021-12-21 2022-03-29 青岛鼎信通讯股份有限公司 一种基于台区电气拓扑的精准线损分析方法
CN120377268A (zh) * 2025-06-25 2025-07-25 华能澜沧江水电股份有限公司 基于启发式规则的配电网动态重构方法及装置

Also Published As

Publication number Publication date
CN105279703A (zh) 2016-01-27

Similar Documents

Publication Publication Date Title
WO2015196745A1 (zh) 主动配电网的重构方法和装置
Wang et al. Chordal conversion based convex iteration algorithm for three-phase optimal power flow problems
Rana et al. Backward/forward sweep load flow algorithm for radial distribution system
TWI460436B (zh) 相量計算單元位置選取方法
Croonenbroeck et al. A selection of time series models for short-to medium-term wind power forecasting
Ashraf et al. Performance analysis of static network reduction methods commonly used in power systems
Liao et al. Hybrid search for the optimal PMU placement problem on a power grid
Anderson et al. PMU placement for dynamic equivalencing of power systems under flow observability constraints
CN103178517B (zh) 一种电力系统多级拓扑分析方法
Ooshita et al. On the self-stabilization of mobile oblivious robots in uniform rings
Vedik et al. Optimal placement of PMUs using differential evolution
Mohammedi et al. Optimum network reconfiguration using grey wolf optimizer
US20150295513A1 (en) Hybrid Power Converter for Renewable Energy Power Plant
Halappanavar et al. A network-of-networks model for electrical infrastructure networks
Mokhtari et al. Distributed ADMM Approach for the Power Distribution Network Reconfiguration
CN105023069A (zh) 一种配电网络重构方法
Lin et al. Community detection in power grids based on Louvain heuristic algorithm
Matsui et al. Modeling the interaction of power line and SCADA networks
Bhuiyan et al. Parallel algorithms for switching edges in heterogeneous graphs
Tang et al. Smart meter data analytics for distribution network
Zhu et al. Random walk and first passage time on a weighted hierarchical network
CN106485597A (zh) 一种主动配电网的重置方法及其装置
Liu et al. Moving beyond traditional electronic design automation: Data-driven design of analog circuits
Casolino et al. Load areas in reconfiguration of distribution systems
Santhi et al. An efficient CHA‐WMA control strategy for a non‐isolated quasi‐Z‐source novel multilevel inverter‐based grid connected PV system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14896084

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14896084

Country of ref document: EP

Kind code of ref document: A1