CN104376374B - A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium - Google Patents

A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium Download PDF

Info

Publication number
CN104376374B
CN104376374B CN201410637856.XA CN201410637856A CN104376374B CN 104376374 B CN104376374 B CN 104376374B CN 201410637856 A CN201410637856 A CN 201410637856A CN 104376374 B CN104376374 B CN 104376374B
Authority
CN
China
Prior art keywords
generator
capacity
group
geocoding
combination
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.)
Active
Application number
CN201410637856.XA
Other languages
Chinese (zh)
Other versions
CN104376374A (en
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.)
NR Electric Co Ltd
NR Engineering Co Ltd
Original Assignee
NR Electric Co Ltd
NR Engineering 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 NR Electric Co Ltd, NR Engineering Co Ltd filed Critical NR Electric Co Ltd
Priority to CN201410637856.XA priority Critical patent/CN104376374B/en
Publication of CN104376374A publication Critical patent/CN104376374A/en
Application granted granted Critical
Publication of CN104376374B publication Critical patent/CN104376374B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Electricity, gas or water supply

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Public Health (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Water Supply & Treatment (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The present invention discloses a kind of capacity Optimum Matching quick calculation method based on group capacity coding method, power system break down progress emergent control when, calculate and selected after the generator capacity to be cut off in the generator for being available for excision, to reach Optimal Control effect, it is required that the generator capacity of excision is minimum with that need to cut capacity matching error, when generator is more, amount of calculation is very big, to be quickly found out Optimum Matching, generator is first divided into two groups or more, distribute the weighted deviation address of a Weight for every generator first in every group, every kind of permutation and combination to generator in every group carries out geocoding, and calculate the corresponding capacity coding of each geocoding, then by scanning the mutual intersection point between every group of coding, Optimum Matching capacity can quickly be calculated, if every group of geocoding to be mapped to a reference axis in coordinate system, intersection point of the object map then searched for into coordinate plane, object search is as shown in Figure of abstract.

Description

A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium
Technical field
The invention belongs to power automation control field, more particularly to a kind of capacity based on group capacity coding method is most Excellent matching quick calculation method, equipment and computer-readable storage medium.
Background technology
Expand day by day with power system, interconnection power system and transferring electricity from the west to the east, Large Copacity, remote, super-pressure and spy High voltage power transmission, AC/DC parallel transmission of electricity, the concentration access of a large amount of new energy and the features such as will runing of electricity market, make electricity The stable problem of Force system is more protruded than ever, and electric power system stability control technology and stabilizing control system are in national each power network It is widely used, as the indispensable important component of power network day-to-day operation.Power system is carried out after breaking down During emergent control, the generator total capacity for needing to cut off is calculated according to control strategy first, then the generating of excision is being available for Selected in machine, to reach optimal control effect, often require that the generator capacity of actual excision and total capacity need to be cut Matching error is minimum, when generator quantity is larger, and the situation of permutation and combination is a lot, and amount of calculation is very big.
Traditional searching method is to carry out permutation and combination to all generators, is then calculated inside each permutation and combination Generator can always cut capacity, finally judge which permutation and combination and the total capacity that need to be cut are closest, with 15 generators for cutting off Exemplified by：The first step selects 1 inside 15 generators, and finds out generator capacity and need to cut immediate one of total capacity Machine, has 15 combinations；Second step selects 2 inside 15 generators, and finds out generator capacity and need to cut total capacity most Two close machines, have 105 combinations；3rd step selects 3 inside 15 generators, and finds out generator capacity with needing Immediate three machines of total capacity are cut, 455 combinations are had；... finally find out the capacity of which permutation and combination with need to cut it is total Capacity is closest, a total of 32768 permutation and combination.When carrying out so many arrangement combinatorial operations, except to calculate each group The total capacity of conjunction, will also record the selection situation of each permutation and combination；Real system is available for the generator number of units of excision possible remote More than 15, the speed that stabilized control system belongs to control measure execution after emergent control, failure is faster, and the stabilization to system more has Profit；So many permutation and combination require that stabilizing control system is calculated within the extremely short time, and its real-time calculated is difficult to protect Card.
The content of the invention
The purpose of the present invention, is to provide a kind of capacity Optimum Matching based on group capacity coding method quickly side of calculating Method, when generator number of units is more, this method can significantly shorten the calculating time, reach the requirement controlled in real time.
In order to reach above-mentioned purpose, a kind of capacity Optimum Matching quick calculation method, it is characterised in that：
1) alternative generator is grouped first when calculating matching capacity；
2) i-th is distributed every generator in each packets inner in the weighted deviation address of a Weight, every group The weighted deviation address of generator is 2(i-1), it is the generator sum in the packet that i, which takes 1 to n, n,；Generator in every group is entered Row permutation and combination, obtains 2nIndividual permutation and combination, and geocoding is carried out to every kind of permutation and combination, the geocoding is every Not selected generator adds in the weighted deviation address sum for the generator being selected in individual permutation and combination, the permutation and combination Power offset address is not involved in geocoding；
3) for every kind of permutation and combination of generator in every group, generator capacity sum in the combination is calculated, is made Encoded for the capacity of this combination, and it is corresponding with the geocoding of the combination；
4) geocoding scanned in the mutual intersection point of geocoding described in every group, every group changes to maximum one by one from 0 It is scanned, (x1+x2×2n+x3×22n+……xm×2(m-1)n) step scans first group of xth1Individual geocoding, second group Xth2Individual geocoding, the 3rd group of xth3Individual geocoding ... m group xthmThe intersection point of individual geocoding, m is packet count, institute The capacity coding sum that generator capacity that intersection point represents is this in each group is stated, Optimum Matching capacity is obtained, and according to institute State geocoding of the Optimum Matching capacity in each group and find the generator for needing to cut off.
In such scheme：Location coding covers all permutation and combination of generator in this group, each geocoding to each group The unique capacity coding of correspondence one.
In such scheme：When calculating generator capacity coding, using recursion encryption algorithm, coding below is utilized above Encode result of calculation.
In such scheme：When calculating Optimum Matching capacity, appearance of the generator capacity that intersection point is represented as this in each group Amount coding sum, by the point, the geocoding in each group is directly calculated the selected generator of point.
In addition, the present invention also provides the computer that is stored with a kind of computer-readable storage medium, the computer-readable storage medium Executable instruction, the computer executable instructions are used for the quick calculation method described in perform claim 1 to 4 any one of requirement.
In addition, the present invention also provides a kind of quick computing device of capacity Optimum Matching, it is characterised in that single including packet Member, weighted coding unit, capacity coding unit, scanning element, wherein, the grouped element is used for alternative generator It is grouped；
The weighted coding unit is used for inclined to the weighting of every generator one Weight of distribution in each packets inner The weighted deviation address for moving i-th generator in address, every group is 2(i-1), it is the generator sum in the packet that i, which takes 1 to n, n,； And permutation and combination is carried out to the generator in every group, obtain 2nIndividual permutation and combination, and row address is entered to every kind of permutation and combination Coding, the geocoding is the weighted deviation address sum for the generator being selected in each permutation and combination, the permutation and combination The weighted deviation address of interior not selected generator is not involved in geocoding；
The capacity coding unit calculates generator in the combination for every kind of permutation and combination of generator in every group Capacity sum, encoded as capacity of this combination, it is and corresponding with the geocoding of the combination；
The geocoding that the scanning element is used to scan in the mutual intersection point between geocoding described in every group, every group is equal Maximum is changed to one by one from 0 to be scanned, (x1+x2×2n+x3×22n+……xm×2(m-1)n) step scans first group of xth1 Individual geocoding, second group of xth2Individual geocoding, the 3rd group of xth3Individual geocoding ... m group xthmIndividual geocoding Intersection point, m is packet count, the capacity coding sum that the generator capacity that the intersection point is represented is this in each group, obtains optimal Capacity is matched, and the generator for needing to cut off is found according to geocoding of the Optimum Matching capacity in each group
After such scheme, the searching method encoded by group capacity, when generator number of units is more, can be accelerated most The search speed of beutiful face amount, meets the requirement of real-time that stabilized control system is performed to control strategy, using the contrast example of 12 machines as Example, more than 4 times faster than conventional method of the calculating speed of this method.
Brief description of the drawings
Fig. 1 is the schematic diagram that the present invention is scanned for the generator capacity after coding.
Embodiment
Below with reference to accompanying drawing, technical scheme is described in detail.
The present invention provides a kind of capacity Optimum Matching quick calculation method based on group capacity coding method, if a certain electricity After net breaks down, being available for the generator of excision has 16, this 16 generators is divided into 2 groups first, by first group of generator X-axis is mapped to, second group of generator is mapped to as Y-axis, the generator in every group 8, first group is 1~generator of generator 8, the generator in second group is 9~generator of generator 16；One is distributed after packet to every generator in the group first Weighted deviation address, the weighted deviation address of generator 1 is in first group：2(1-1)=1, the weighted deviation address of generator 2 is： 2(2-1)The weighted deviation address of=2 ... ... generators 8 is：2(8-1)=128；The weighted deviation address of generator 9 in second group For 1 (generator 9 is the First generator in second group), the weighted deviation address of generator 10 is 2 ... ... generator 16 Weighted deviation address is 128；And geocoding is carried out to every kind of permutation and combination of the generator in every group, the geocoding is Not selected generator in the weighted deviation address sum for the generator being selected in each permutation and combination, the permutation and combination Weighted deviation address is not involved in geocoding, and the geocoding after every group of in-line coding can cover all of the interior generator of this group Permutation and combination, for every kind of permutation and combination of generator in every group, calculates total appearance sum of generator in the combination, is used as this The capacity coding of combination, and it is corresponding with the geocoding of the combination, and corresponding one of so each geocoding is unique to be held Amount coding, for example：Geocoding 0 represents the generator of ineligible inside the group, corresponding capacity coding in first group For 0；Geocoding 1 represents selection generator 1 in the group, and corresponding capacity is encoded to the capacity of generator 1；Geocoding 2 represent selection generator 2 in the group, and corresponding capacity is encoded to the capacity of generator 2；Geocoding 3 is represented in the group Select generator 1 and generator 2, corresponding capacity be encoded to the capacity of generator 1 and generator 2 capacity it With；…….To save the calculating time, recursion encryption algorithm is used when calculating capacity coding, coding below utilizes volume above Code result of calculation, such as corresponding capacity of geocoding 7 coding are corresponding with coding 4 with the corresponding capacity of geocoding 3 coding Capacity coding addition is drawn.The mutual intersection point between every group of coding is scanned after end-of-encode, the first step scans the first of first group The intersection point of individual geocoding and the first of second group geocoding, second step scans first group of first geocoding and the The intersection point ... of two groups of second geocoding, capacity of the generator capacity that intersection point is represented as this in each group encodes it With calculate the intersection point of Optimum Matching, and needs are directly found according to geocoding of the Optimum Matching point found in each group The generator of excision.The packet count of this sample is 2, and space coordinate is reduced to plane coordinates, as long as search is sat in plane during search Mark first quartile intersection point can (including origin of coordinates), if as illustrated, the coordinate of certain fault search be (x1, y1), X1 geocoding is 9 in the figure, represents selection generator 1 and generator 4, and the capacity that this represents in X-axis is encoded to The capacity sum of generator 1 and generator 4, y1 geocoding is 7, represents selection generator 9, generator 10, generator 11, The capacity that this represents in Y-axis is encoded to the capacity sum of generator 9, generator 10, generator 11.
With the capacity of traditional each permutation and combination of calculating, the minimum combination side of error in all permutation and combination is then selected Case is compared, the present invention uses group capacity coding method, alternative object is grouped first and to each group of progress Location is encoded to be encoded with capacity, and then each group of one be mapped in coordinate system reference axis can be existed by scanning every group of coding Intersection point in space coordinate calculates Optimum Matching, can accelerate the search speed of optimal capacity, meet stabilized control system to control strategy The requirement of real-time of execution.
In addition, the present invention also provides the computer that is stored with a kind of computer-readable storage medium, the computer-readable storage medium Executable instruction, the computer executable instructions are used to perform quick calculation method described in the invention.
In addition, the present invention also provides a kind of quick computing device of capacity Optimum Matching, including grouped element, weighted coding list Member, capacity coding unit, scanning element, wherein, the grouped element is used to be grouped alternative generator；
The weighted coding unit is used for inclined to the weighting of every generator one Weight of distribution in each packets inner The weighted deviation address for moving i-th generator in address, every group is 2(i-1), it is the generator sum in the packet that i, which takes 1 to n, n,； And permutation and combination is carried out to the generator in every group, obtain 2nIndividual permutation and combination, and row address is entered to every kind of permutation and combination Coding, the geocoding is the weighted deviation address sum for the generator being selected in each permutation and combination, the permutation and combination The weighted deviation address of interior not selected generator is not involved in geocoding；
The capacity coding unit calculates generator in the combination for every kind of permutation and combination of generator in every group Capacity sum, encoded as capacity of this combination, it is and corresponding with the geocoding of the combination；
The geocoding that the scanning element is used to scan in the mutual intersection point between geocoding described in every group, every group is equal Maximum is changed to one by one from 0 to be scanned, (x1+x2×2n+x3×22n+……xm×2(m-1)n) step scans first group of xth1 Individual geocoding, second group of xth2Individual geocoding, the 3rd group of xth3Individual geocoding ... m group xthmIndividual geocoding Intersection point, m is packet count, the capacity coding sum that the generator capacity that the intersection point is represented is this in each group, obtains optimal Capacity is matched, and the generator for needing to cut off is found according to geocoding of the Optimum Matching capacity in each group.
The technological thought of above example only to illustrate the invention, it is impossible to which protection scope of the present invention is limited with this, it is every According to technological thought proposed by the present invention, any change done on the basis of technical scheme each falls within the scope of the present invention Within.

Claims (6)

1. a kind of capacity Optimum Matching quick calculation method, it is characterised in that：
1) alternative generator is grouped first when calculating matching capacity；
2) the weighted deviation address of a Weight, every group in i-th generating is distributed every generator in each packets inner The weighted deviation address of machine is 2(i-1), it is the generator sum in the packet that i, which takes 1 to n, n,；Generator in every group is arranged Row combination, obtains 2nIndividual permutation and combination, and geocoding is carried out to every kind of permutation and combination, the geocoding is each row The weighting of not selected generator is inclined in the weighted deviation address sum of selected generator, the permutation and combination in row combination Move address and be not involved in geocoding；
3) for every kind of permutation and combination of generator in every group, generator capacity sum in the combination is calculated, this is used as The capacity coding of individual combination, and it is corresponding with the geocoding of the combination；
4) scan the geocoding in the mutual intersection point of geocoding described in every group, every group and change to maximum progress one by one from 0 Scanning, (x1+x2×2n+x3×22n+……xm×2(m-1)n) step scans first group of xth1Individual geocoding, second group of xth2 Individual geocoding, the 3rd group of xth3Individual geocoding ... m group xthmThe intersection point of individual geocoding, m is packet count, the friendship The capacity that the generator capacity that represents of point is this in each group encodes sum, obtains Optimum Matching capacity, and according to it is described most Geocoding of the excellent matching capacity in each group finds the generator for needing to cut off.
2. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, it is characterised in that：Location coding covers to each group Cover all permutation and combination of generator this group Nei, the unique capacity coding of corresponding one of each geocoding.
3. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, it is characterised in that：Calculate generator capacity During coding, using recursion encryption algorithm, coding below utilizes coding result of calculation above.
4. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, it is characterised in that：Optimum Matching is calculated to hold During amount, the capacity coding sum that the generator capacity that intersection point is represented is this in each group, the selected generator of point is by this Point geocoding in each group is directly calculated.
5. be stored with computer executable instructions, the calculating in a kind of computer-readable storage medium, the computer-readable storage medium Machine executable instruction is used for the quick calculation method described in perform claim 1 to 4 any one of requirement.
6. a kind of quick computing device of capacity Optimum Matching, it is characterised in that including grouped element, weighted coding unit, capacity Coding unit, scanning element, wherein, the grouped element is used to be grouped alternative generator；
The weighted coding unit is with being used for the weighted deviation that a Weight is distributed every generator in each packets inner Location, the weighted deviation address of i-th generator is 2 in every group(i-1), it is the generator sum in the packet that i, which takes 1 to n, n,；And it is right Generator in every group carries out permutation and combination, obtains 2nIndividual permutation and combination, and geocoding is carried out to every kind of permutation and combination, The geocoding is the weighted deviation address sum for the generator being selected in each permutation and combination, in the permutation and combination not by The weighted deviation address for the generator chosen is not involved in geocoding；
The capacity coding unit calculates the appearance of generator in the combination for every kind of permutation and combination of generator in every group Sum is measured, is encoded as the capacity of this combination, and it is corresponding with the geocoding of the combination；
The geocoding that the scanning element is used to scan in the mutual intersection point between geocoding described in every group, every group is from 0 Change to maximum one by one to be scanned, (x1+x2×2n+x3×22n+……xm×2(m-1)n) step scans first group of xth1Individually Location coding, second group of xth2Individual geocoding, the 3rd group of xth3Individual geocoding ... m group xthmThe friendship of individual geocoding Point, m is packet count, the capacity coding sum that the generator capacity that the intersection point is represented is this in each group, obtains optimal With capacity, and the generator for needing to cut off is found according to geocoding of the Optimum Matching capacity in each group.
CN201410637856.XA 2014-11-12 2014-11-12 A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium Active CN104376374B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410637856.XA CN104376374B (en) 2014-11-12 2014-11-12 A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410637856.XA CN104376374B (en) 2014-11-12 2014-11-12 A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium

Publications (2)

Publication Number Publication Date
CN104376374A CN104376374A (en) 2015-02-25
CN104376374B true CN104376374B (en) 2017-07-18

Family

ID=52555269

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410637856.XA Active CN104376374B (en) 2014-11-12 2014-11-12 A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium

Country Status (1)

Country Link
CN (1) CN104376374B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107860972A (en) * 2017-10-25 2018-03-30 北京信息科技大学 Method for detecting harmonic wave and m-Acetyl chlorophosphonazo

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0516333A2 (en) * 1991-05-31 1992-12-02 AT&T Corp. Automated resource allocation system employing a learning arrangement
CN103150606A (en) * 2013-01-22 2013-06-12 中国电力科学研究院 Optimal power flow optimization method of distributed power supplies
CN103186818A (en) * 2011-12-27 2013-07-03 北京能高自动化技术股份有限公司 Optimal matching method for wind turbine generator systems and wind resource conditions

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0516333A2 (en) * 1991-05-31 1992-12-02 AT&T Corp. Automated resource allocation system employing a learning arrangement
CN103186818A (en) * 2011-12-27 2013-07-03 北京能高自动化技术股份有限公司 Optimal matching method for wind turbine generator systems and wind resource conditions
CN103150606A (en) * 2013-01-22 2013-06-12 中国电力科学研究院 Optimal power flow optimization method of distributed power supplies

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种基于暂态稳定风险的储能位置与容量优化方法;吴迪 等;《电力科学与技术学报》;20120331;第19-26页 *

Also Published As

Publication number Publication date
CN104376374A (en) 2015-02-25

Similar Documents

Publication Publication Date Title
Kazempour et al. Strategic generation investment using a complementarity approach
AlRashidi et al. Optimal planning of multiple distributed generation sources in distribution networks: A new approach
Corboz et al. Stripes in the two-dimensional t-J model with infinite projected entangled-pair states
Singh et al. Optimum siting and sizing of distributed generations in radial and networked systems
Mahdavi et al. Evaluating the effect of load growth on annual network losses in TNEP considering bundle lines using DCGA
Liu et al. Distributionally robust optimal reactive power dispatch with wasserstein distance in active distribution network
CN110020403A (en) A kind of power distribution automation equipment test synthesis evaluation method and system
Kumawat et al. Optimally allocation of distributed generators in three-phase unbalanced distribution network
CN110519128A (en) A kind of operating system recognition methods based on random forest
Mahdavi et al. Transmission lines loading enhancement using ADPSO approach
CN106452825A (en) Power distribution and utilization communication network alarm correlation analysis method based on improved decision tree
Mahdavi et al. Comparing efficiency of PSO with GA in transmission expansion planning considering network adequacy
CN104376374B (en) A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium
CN114936544A (en) Data processing method and device, electronic equipment and storage medium
Guillen et al. Data‐driven short‐circuit detection and location in microgrids using micro‐synchrophasors
Titz et al. Predicting dynamic stability from static features in power grid models using machine learning
Shu et al. Enhanced multi‐dimensional power network planning based on ant colony optimization
Syed et al. Simultaneous optimal placement of DGs and fixed capacitor banks in radial distribution systems using BSA optimization
Jalaliyoon et al. Marketization of higher education institute; identifying a set of performance measurements based on analytic hierarchy process
CN108229734A (en) Paths planning method and device
Cedeño et al. Convexification method for bilinear transmission expansion problem
Saha et al. Pattern recognition techniques for determining the health index of oil-paper insulation of in-service power transformers
CN106027369A (en) Email address characteristic oriented email address matching method
Monjo et al. Theoretical study of the steinmetz circuit design
Sharifzadeh Two efficient logarithmic formulations to solve nonconvex economic dispatch

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant