CN105488589A - Genetic simulated annealing algorithm based power grid line loss management evaluation method - Google Patents

Genetic simulated annealing algorithm based power grid line loss management evaluation method Download PDF

Info

Publication number
CN105488589A
CN105488589A CN201510846007.XA CN201510846007A CN105488589A CN 105488589 A CN105488589 A CN 105488589A CN 201510846007 A CN201510846007 A CN 201510846007A CN 105488589 A CN105488589 A CN 105488589A
Authority
CN
China
Prior art keywords
line loss
electrical network
electric pressure
grid line
calculated
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201510846007.XA
Other languages
Chinese (zh)
Inventor
陈静
安海云
周前
刘建坤
张宁宇
朱鑫要
赵静波
嵇托
王大江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201510846007.XA priority Critical patent/CN105488589A/en
Publication of CN105488589A publication Critical patent/CN105488589A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06Energy 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)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention discloses a genetic simulated annealing algorithm based power grid line loss management evaluation method. The method comprises: step 1: modeling a factor influencing the line loss of a power grid and establishing an N-dimensional index vector; step 2: randomly selecting k samples from a generated sample set and performing floating-point coding on chromosomes; step 3: performing initialization; step 4: performing sample clustering on initial populations according to clustering centers and calculating a fitness value of each individual; step 5: performing selection, crossing and mutation operations on individuals in the populations, calculating the fitness values of the individuals, and performing simulated annealing algorithm operation to generate a new population; step 6: when an evolutional frequency is less than a maximum evolutional frequency S, returning to the step 5; otherwise, going to the step 7; step 7: if the algorithm is ended, decoding optimal individuals to obtain optimal clustering number and clustering center, performing sample clustering, and dividing a line loss management level of a to-be-evaluated power grid into different levels; and step 8: performing evaluation according to a line loss value.

Description

A kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm
Technical field
The present invention relates to a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm.
Background technology
Due to the difference of each side such as electric network composition, socio-economic factor, there is larger difference in the line loss level between different electrical network, in order to more objective evaluation Controlling line loss level, several echelon need be marked off according to the different attribute of electrical network, electrical network like Attribute class is gathered in an echelon and evaluates, separately between each echelon do not interfere with each other, it is in the nature a kind of cluster.
K-MEANS algorithm is a kind of simple and effective clustering algorithm, but because it have employed heuristic in the process finding cluster centre, comparatively responsive to the selection of initial cluster center, and, this algorithm needs to specify cluster number in advance, and often accurately cannot learn the cluster number of sample in actual applications, therefore, traditional K-MEANS clustering algorithm is easily absorbed in locally optimal solution.
Genetic algorithm (GeneticAlgorithm, GA) be the computation model of simulating the natural selection of Darwinian evolutionism and the biological evolution process of genetic mechanisms, it is a kind of method by simulating nature evolutionary process search optimum solution, which introduce the operations such as selection, crossover and mutation, optimum solution can be obtained in a random way, but its local optimal searching scarce capacity, and there is precocious defect.Simulated annealing (SimulatedAnnealing, SA) from a certain higher initial temperature, with the continuous decline of temperature parameter, locally optimal solution can be probability jump out and be finally tending towards global optimum, there is very strong local search ability.Clustering algorithm based on Global Genetic Simulated Annealing Algorithm then combines the advantage of genetic algorithm and simulated annealing, can obtain globally optimal solution with larger probability.
Summary of the invention
For the problems referred to above, the invention provides a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm, cluster number in partition process dynamic conditioning in algorithm operational process is determined, compensate for the deficiency that traditional K-MEANS clustering algorithm is responsive to initial cluster center, be difficult to determine in advance cluster number, the division result of global optimum can be obtained with larger probability, to grid line loss administrative evaluation work, there is certain reference value.
For realizing above-mentioned technical purpose, reach above-mentioned technique effect, the present invention is achieved through the following technical solutions:
Based on a grid line loss administrative evaluation method for Global Genetic Simulated Annealing Algorithm, it is characterized in that, comprise the steps:
Step one: mathematical modeling is carried out on the factor affecting grid line loss level, comprise electric pressure and level, circuit average length, sectional area of wire, distribution transforming status of equipment, reactive-load compensation configuration, duration of load application distribution, unit power transformation capacity load rate, the maximum natural load or burden without work coefficient of electrical network, dividing potential drop electricity sales amount, can't harm electricity accounting, rural area area accounting, non-industrial GDP accounting and power density, and set up grid line loss N dimension indicator vector according to application needs and the quality of data, wherein, 1≤N≤13;
Step 2: in the sample set that grid line loss N dimension indicator vector generates, randomly draw k sample as initial cluster center, adopt the chromosome floating-point code mode based on cluster centre, every bar chromosomal coding C is: C=kc λ... c k, gene c λbe certain grid line loss N dimensional vector that λ cluster centre is corresponding, the division evaluation method of the individual corresponding a kind of Controlling line loss level of each dyeing;
Step 3: initialization algorithm controling parameters, comprises population at individual number M, maximum evolution number of times S, crossover probability P c, mutation probability P m, temperature cooling ratio k c, annealing initial temperature T 0, annealing final temperature T end;
Step 4: to the variant individuality of initial population, respectively according to cluster centre, carries out sample clustering according to Euclidean distance minimum principle, calculates the fitness value of variant individuality;
Step 5: select the individuality in population, intersect, mutation operation, calculates its fitness value to the new individuality produced, carries out simulated annealing operation, generate new population;
Step 6: when evolution number of times is less than maximum evolution number of times S, return step 5; Otherwise, forward step 7 to;
Step 7: if temperature index is lower than final temperature T end, then algorithm stops, and decodes to the optimum individual in existing population, obtains best cluster number and cluster centre, then carries out sample clustering by the Controlling line loss horizontal division of electrical network to be evaluated in different echelons; If temperature index is higher than final temperature T end, then perform cooling and operate and return step 5;
Step 8: in the same echelon of line loss management level, the size according to line loss value is evaluated, and the height of the corresponding Controlling line loss level of height of line loss value, evaluates separate between each echelon.
First by calculating line loss influence factor index, form grid line loss indicator vector sample set, randomly draw some samples as initial cluster center, carry out the floating-point code of variable cluster centre, and cluster number is added in chromosome coding as first gene position, solve optimum individual and decode to determine cluster number and cluster centre, by the Controlling line loss horizontal division of electrical network to be evaluated in different echelons, in same echelon, carry out administrative evaluation according to the size of line loss value, its management level are more excellent for less then the thinking of line loss value.The present invention has merged the thought of genetic algorithm and simulated annealing in the process evaluated, eliminate responsive to initial cluster center in traditional clustering algorithm, to be easily absorbed in local optimum defect, and without the need to specifying cluster number in advance, the similar division result of the line loss of global optimum can be found with larger probability.
Preferably, in step 4, for k cluster centre selected in chromosome, by grid line loss indicator vector x lcluster centre c is included into according to the principle that Euclidean distance is minimum λ, that is:
||x l-c λ||=min||x l-c j||(j=1,2,...,k)
Wherein, x lfor the N dimensional vector that each influence factor index of grid line loss is formed, and x l=(x l1, x l2..., x lN), x l1~ x lNcorrespond respectively to N number of influence factor index value.
Wherein, the cluster object definition fitness that, between class distance minimum according to inter-object distance is maximum is wherein J = Σ λ = 1 k Σ x l ∈ c λ | | x l - c λ | | 1 + Σ m ≠ n | | c m - c n | | .
The invention has the beneficial effects as follows: the clustering algorithm based on genetic simulated annealing is applied in grid line loss administrative evaluation work by the present invention, first electrical network to be evaluated is divided into several different echelon, then carries out management level evaluation according to the size of line loss value in same echelon.Cluster number in partition process dynamic conditioning in algorithm operational process is determined, compensate for the deficiency that traditional K-MEANS clustering algorithm is responsive to initial cluster center, be difficult to determine in advance cluster number, the division result of global optimum can be obtained with larger probability, to grid line loss administrative evaluation work, there is certain reference value.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm of the present invention.
Embodiment
Below in conjunction with accompanying drawing and specific embodiment, technical solution of the present invention is described in further detail, can better understand the present invention to make those skilled in the art and can be implemented, but illustrated embodiment is not as a limitation of the invention.
Based on a grid line loss administrative evaluation method for Global Genetic Simulated Annealing Algorithm, as shown in Figure 1, comprise the steps:
Step one: mathematical modeling is carried out on the factor affecting grid line loss level, comprise electric pressure and level, circuit average length, sectional area of wire, distribution transforming status of equipment, reactive-load compensation configuration, duration of load application distribution, unit power transformation capacity load rate, the maximum natural load or burden without work coefficient of electrical network, dividing potential drop electricity sales amount, can't harm electricity accounting, rural area area accounting, non-industrial GDP accounting and power density, and set up grid line loss N dimension indicator vector according to application needs and the quality of data, wherein, 1≤N≤13;
Step 2: in the sample set that grid line loss N dimension indicator vector generates, randomly draw k sample as initial cluster center, adopt the chromosome floating-point code mode based on cluster centre, every bar chromosome is made up of the coding of k cluster centre and clusters number k, and to be C be the chromosome floating-point code based on cluster centre: C=kc λ... c k, gene c λbe certain grid line loss N dimensional vector that λ cluster centre is corresponding, k is also this chromosomal cluster number, the division evaluation method of the individual corresponding a kind of Controlling line loss level of each dyeing;
Step 3: initialization algorithm controling parameters, comprises population at individual number M, maximum evolution number of times S, crossover probability P c, mutation probability P m, temperature cooling ratio k c, annealing initial temperature T 0, annealing final temperature T end;
Step 4: to the variant individuality of initial population, respectively according to cluster centre, carries out sample clustering according to Euclidean distance minimum principle, calculates the fitness value of variant individuality;
Preferably, in this step, for k cluster centre selected in chromosome, by grid line loss indicator vector x lcluster centre c is included into according to the principle that Euclidean distance is minimum λ, that is:
||x l-c λ||=min||x l-c j||(j=1,2,...,k)
Wherein, x lfor the N dimensional vector that each influence factor index of grid line loss is formed, and x l=(x l1, x l2..., x lN), x l1~ x lNcorrespond respectively to N number of influence factor index value.
The maximum cluster object definition fitness of, between class distance minimum according to inter-object distance is wherein J = Σ λ = 1 k Σ x l ∈ c λ | | x l - c λ | | 1 + Σ m ≠ n | | c m - c n | | .
Step 5: select the individuality in population, intersect, mutation operation, calculates its fitness value to the new individuality produced, carries out simulated annealing operation, generate new population;
Step 6: when evolution number of times is less than maximum evolution number of times S, return step 5; Otherwise, forward step 7 to;
Step 7: if temperature index is lower than final temperature T end, then algorithm stops, and decodes to the optimum individual in existing population, obtains best cluster number and cluster centre, then carries out sample clustering by the Controlling line loss horizontal division of electrical network to be evaluated in different echelons; If temperature index is higher than final temperature T end, then perform cooling and operate and return step 5;
Step 8: in the same echelon of line loss management level, the size according to line loss value is evaluated, and the height of the corresponding Controlling line loss level of height of line loss value, evaluates separate between each echelon.
General, in step one, mathematical modeling is carried out on the factor affecting grid line loss level, is specially:
(1) electric pressure and level Y dYDJcalculated with mathematical model formula be:
Y DYDJ=ΣLoss i
Wherein, each electric pressure in i=500 ~ 10kV; Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided;
(2) circuit average length Y xLCDcalculated with mathematical model formula be:
Y X L C D = Σ L i × 10 2 / i 2 Σ N i
Wherein: L ifor the line length under electrical network i electric pressure to be divided; N ifor electrical network i electric pressure circuit total number to be divided;
(3) sectional area of wire Y dXJMcalculated with mathematical model formula:
Y DXJM=ΣLoss iq θ(q iaL iθa+q ibL iθb+q icL iθc)
Wherein: θ is wire type sequence number, when θ=1, represent pole line, during θ=2, represent cable; q θfor wire type weight, by the length ratio of pole line and cable, if certain electrical network is without cable, then q 1get 100%; Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; L i θ a, L i θ b, L i θ cfor the i electric pressure overhead transmission line of electrical network to be divided or the cross section of cable and the ratio of electrical network i electric pressure line length to be divided, wire is divided into I cross section, II cross section, cross section, three kinds, III cross section by sectional area size, the sectional area that wherein sectional area in I cross section is less than the sectional area in II cross section, the sectional area in II cross section is less than III cross section, a, b, c represent I cross section, II cross section, III cross section respectively; q ia, q ib, q icrepresent i electric pressure a respectively, weight coefficient that b, c cross section wire affects line loss.
(4) distribution transforming status of equipment Y pBZKcalculated with mathematical model formula:
Y PBZK=q dT d+q eT e+q fT f
Wherein: T d, T e, T fbe respectively the capacity of distribution transform ratio of high consumption model, common model, energy-conservation model, high consumption model is below S7, and common model is S9 ~ S11, and energy-conservation model is more than S11, and the capacity merging of wherein non-crystaline amorphous metal change and single-phase change is included into more than S11 model and is participated in calculating;
(5) reactive-load compensation configuration Y wGBCcalculated with mathematical model formula be:
Y WGBC=ΣLoss i(1-W i)
Wherein: Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; W ifor the i electric pressure reactive-load compensation configuration coefficients of each electrical network, main transformer configure the ratio of condenser capacity and main transformer capacity;
(6) load space distribution Y fHSJcalculated with mathematical model formula:
Y F H S J = Σ i = 1 12 ψ i
Wherein: ψ ifor the moon load degree of uniformity of each electrical network, the ratio of front-month maximum peak-valley difference and monthly average load.
(7) unit power transformation capacity load rate Y zBFZcalculated with mathematical model formula be:
Y Z B F Z = η i G i G 500 + G 330 + G 220 + G 110
η i = P 0 i P i / B i + P 1 i S i 2 × P i B i
Wherein: G ifor power transmission amount under i electric pressure transformer; G 500, G 330, G 220, G 110the lower power transmission amount of corresponding 500kV, 330kV, 220kV, 110kV electric pressure transformer respectively; η ifor the proportion of goods damageds of i electric pressure transformer; P 0ifor the representative value of i electric pressure transformer noload losses; P 1ifor the representative value of i electric pressure transformer load loss; S ifor the representative value of i electric pressure transformer rated capacity; P ifor sending power under i electric pressure transformer; B ifor the capacity of i electric pressure transformer;
(8) maximum natural load or burden without work coefficient Y zRWGcalculated with mathematical model formula:
Y Z R W G = 1 / Q P
Wherein: Q is the maximum reactive power capability of electrical network, P is the maximum tracking burden with power of electrical network;
The maximum reactive power capability of electrical network is:
Q=Q G+Q C+Q R+Q L
Wherein: Q gfor the reactive power of generator, Q cfor capacitive reactive power compensates total volume, Q rfor adjacent net inputs or outputs idle, Q lfor the charge power of circuit and cable;
(9) dividing potential drop electricity sales amount Y fYDLindex calculate formula:
Y F Y D L = Σ A i Loss i A
Wherein: Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; A ifor electrical network i electric pressure delivery; A is total delivery of electrical network;
(10) harmless electricity Y wSDLcalculated with mathematical model formula:
Y WSDL=1-W
Wherein: W is that each electrical network can't harm electricity accounting;
(11) rural area area accounting Y nCMJcalculated with mathematical model formula be:
Y NCMJ=S’
Wherein: S ' is each electrical network rural area area accounting;
(12) non-industrial GDP accounting Y fGYcalculated with mathematical model formula be:
Y FGY=G
Wherein: G is the non-industrial GDP accounting of each electrical network;
(13) power density Y gDMDcalculated with mathematical model formula be:
Y G D M D = A η
Wherein: A is total delivery of electrical network, η is each mains supply area.
Set forth the similar splitting scheme of line loss of the present invention for the sake of simplicity, suppose that dividing object is electrical network A, electrical network B, electrical network C, electrical network D, electrical network E and electrical network F, then a concrete embodiment is as follows:
S1, mathematical modeling is carried out on all kinds of factors affecting grid line loss level, set up grid line loss multidimensional index vector.Influence factor comprises electric pressure and level, circuit average length, sectional area of wire, distribution transforming status of equipment, reactive-load compensation configuration, duration of load application distribution, unit power transformation capacity load rate, maximum natural load or burden without work coefficient, dividing potential drop electricity sales amount, can't harm electricity, rural area area accounting, non-industrial GDP accounting and power density, sets up N dimension indicator vector (1≤N≤13) according to application needs and the quality of data;
For simplified schematic, choose electric pressure and level, circuit average length, sectional area of wire, distribution transforming status of equipment four influence factors, set up 4 dimension indicator vectors according to mathematical formulae mentioned above, be respectively:
X 1=(x 11, x 12, x 13, x 14), x 2=(x 21, x 22, x 23, x 24), x 3=(x 31, x 32, x 33, x 34), x 4=(x 41, x 42, x 43, x 44), x 5=(x 51, x 52, x 53, x 54), x 6=(x 61, x 62, x 63, x 64), with x 1for example, x 11, x 12, x 13, x 14be respectively electric pressure and level index, circuit average length index, sectional area of wire index and the distribution transforming status of equipment index of electrical network A.X 2, x 3, x 4, x 5and x 6then be respectively the indicator vector of electrical network B, electrical network C, electrical network D, electrical network E and electrical network F.
S2, grid line loss multidimensional index vector generate sample set in, randomly draw k sample as initial cluster center, adopt the floating-point code mode based on cluster centre, every bar chromosome is made up of the coding of k cluster centre and clusters number k; The division evaluation method of the individual corresponding a kind of Controlling line loss level of each dyeing;
Such as, randomly drawing sample x 4and x 6as initial cluster center, then chromosome 1 is encoded to 2x 4x 6; If sample drawn x 1, x 3and x 5as cluster centre, then chromosome 2 is encoded to 3x 1x 3x 5; If sample drawn x 1, x 3as cluster centre, then chromosome 3 is encoded to 2x 1x 3.
S3, initialization algorithm controling parameters, comprise population at individual number M, maximum evolution number of times S, crossover probability P c, mutation probability P m, temperature cooling ratio k c, annealing initial temperature T 0, annealing final temperature T end;
S4, variant individuality to initial population, respectively according to cluster centre, carry out sample clustering by Euclidean distance minimum principle, calculate the fitness value of variant individuality;
For chromosome 2, calculate all the other grid line loss indicator vectors x respectively 2, x 4and x 6apart from the Euclidean distance of each cluster centre, and carry out cluster according to the principle that Euclidean distance is minimum, can obtain:
||x 2-x 3||=min||x 2-x j||(j=1,3,5)
||x 4-x 1||=min||x 4-x j||(j=1,3,5)
||x 6-x 3||=min||x 6-x j||(j=1,3,5)
Namely initial clustering result is: { x 1, x 4, { x 2, x 3, x 6, { x 5.
The cluster result of chromosome 1 and 3 is respectively: { x 3, x 4, x 5, { x 2, x 1, x 6and { x 1, x 4, x 6, { x 2, x 3, x 5.
The cluster object definition fitness that, between class distance minimum according to inter-object distance is maximum is again wherein, in population, 3 chromosomes are respectively calculated as follows:
J 1 = Σ λ = 1 k Σ x l ∈ c λ | | x l - c λ | | 1 + Σ m ≠ n | | c m - c n | | = | | x 3 - x 4 | | + | | x 5 - x 4 | | + | | x 1 - x 6 | | + | | x 2 - x 6 | | 1 + | | x 4 - x 6 | |
J 2 = Σ λ = 1 k Σ x l ∈ c λ | | x l - c λ | | 1 + Σ m ≠ n | | c m - c n | | = | | x 4 - x 1 | | + | | x 2 - x 3 | | + | | x 6 - x 3 | | 1 + | | x 1 - x 3 | | + | | x 1 - x 5 | | + | | x 3 - x 5 | |
J 3 = Σ λ = 1 k Σ x l ∈ c λ | | x l - c λ | | 1 + Σ m ≠ n | | c m - c n | | = | | x 4 - x 1 | | + | | x 6 - x 1 | | + | | x 2 - x 3 | | + | | x 5 - x 3 | | 1 + | | x 1 - x 3 | | .
S5, the individuality in population selected, intersect, mutation operation, its fitness value is calculated to the new individuality produced, carries out simulated annealing operation, generate new population;
According to the chromosomal fitness value sequence that S4 calculates be: f 2> f 1> f 3,
Select operation: chromosome 2 can be chosen by roulette wheel selection and chromosome 1 enters population of future generation;
Interlace operation: can adopt single-point bracketing method, random generation natural number 2, as point of crossing, produces a Probability p at random, is greater than the crossover probability P in S3 as p ctime, intersect from chromosome the 2nd gene position, and first gene position newly individual according to the length amendment after intersecting.The new chromosome coding that this step produces is 2x 1x 6, 3x 4x 3x 5;
Mutation operation: produce a natural number 3 at random as change point, random generation Probability p ', the mutation probability P in S3 is greater than as p ' mtime, chromosomal 3rd gene position is made a variation, replaces with the sample vector that the random number produced is corresponding, suppose that the new individual UVR exposure that variation produces is 3x 4x 1x 5;
Calculate new 3 the chromosomal fitness value f ' produced i, carry out simulated annealing operation, adopt Metropolis acceptance criterion, if f ' i> f i, then the old individuality of new individual replacement is accepted, if f ' i< f i, then with probability accept new individual to replace old individuality, k is Boltzmann constant, generates new population to be: chromosome 1 is encoded 3x 1x 3x 5, chromosome 2 encodes 3x 4x 1x 5, chromosome 3 encodes 2x 1x 6.
S6, when evolution number of times is less than maximum evolution number of times, return S5; Otherwise, forward S7 to;
If S7 temperature index is lower than final temperature, then algorithm stops, and decodes to the optimum individual in existing population, obtains best cluster number and cluster centre, then carries out sample clustering by the Controlling line loss horizontal division of electrical network to be evaluated in different echelons; If temperature index is higher than final temperature, then performs cooling and operate and return S5;
When temperature index is lower than final temperature T endtime, algorithm stops, and now existing Evolution of Population is: chromosome 1 is encoded 3x 1x 3x 5, chromosome 2 encodes 3x 4x 1x 6, chromosome 3 encodes 2x 1x 4, calculate fitness value sequence for f 3> f 1> f 2, then chromosome 3 is optimum individual, and can obtain best cluster centre number to its decoding is 2, and cluster centre is sample x 1and x 4.Divide 6 grid line loss situations according to this cluster condition, can obtain best division result is echelon 1{x 1, x 3and echelon 2{x 2, x 4, x 5, x 6.
S8, in the same echelon of line loss management level, the size according to line loss value is evaluated, and the electrical network that line loss value is less then thinks that Controlling line loss level is more excellent, evaluates separate between each echelon;
For echelon 1, if the line loss value of electrical network 3 is less than electrical network 1, then think that the Controlling line loss level of electrical network 3 is relatively excellent.
Clustering algorithm based on genetic simulated annealing is applied in grid line loss administrative evaluation work by the present invention, first electrical network to be evaluated is divided into several different echelon, then carries out management level evaluation according to the size of line loss value in same echelon.Cluster number in partition process dynamic conditioning in algorithm operational process is determined, when the between class distance of cluster is identical, the inter-object distance based on the clustering algorithm of Global Genetic Simulated Annealing Algorithm can be starkly lower than K-MEANS algorithm, and effect is more excellent.Compensate for the deficiency that traditional K-MEANS clustering algorithm is responsive to initial cluster center, be difficult to determine in advance cluster number, the division result of global optimum can be obtained with larger probability, to grid line loss administrative evaluation work, there is certain reference value.
These are only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every utilize instructions of the present invention and accompanying drawing content to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in the technical field that other are relevant, be all in like manner included in scope of patent protection of the present invention.

Claims (6)

1., based on a grid line loss administrative evaluation method for Global Genetic Simulated Annealing Algorithm, it is characterized in that, comprise the steps:
Step one: mathematical modeling is carried out on the factor affecting grid line loss level, comprise electric pressure and level, circuit average length, sectional area of wire, distribution transforming status of equipment, reactive-load compensation configuration, duration of load application distribution, unit power transformation capacity load rate, the maximum natural load or burden without work coefficient of electrical network, dividing potential drop electricity sales amount, can't harm electricity accounting, rural area area accounting, non-industrial GDP accounting and power density, and set up grid line loss N dimension indicator vector according to application needs and the quality of data, wherein, 1≤N≤13;
Step 2: in the sample set that grid line loss N dimension indicator vector generates, randomly draw k sample as initial cluster center, adopt the chromosome floating-point code mode based on cluster centre, every bar chromosomal coding C is: C=kc λ... c k, gene c λbe certain grid line loss N dimensional vector that λ cluster centre is corresponding, the division evaluation method of the individual corresponding a kind of Controlling line loss level of each dyeing;
Step 3: initialization algorithm controling parameters, comprises population at individual number M, maximum evolution number of times S, crossover probability P c, mutation probability P m, temperature cooling ratio k c, annealing initial temperature T 0, annealing final temperature T end; Step 4: to the variant individuality of initial population, respectively according to cluster centre, carries out sample clustering according to Euclidean distance minimum principle, calculates the fitness value of variant individuality;
Step 5: select the individuality in population, intersect, mutation operation, calculates its fitness value to the new individuality produced, carries out simulated annealing operation, generate new population;
Step 6: when evolution number of times is less than maximum evolution number of times S, return step 5; Otherwise, forward step 7 to;
Step 7: if temperature index is lower than final temperature T end, then algorithm stops, and decodes to the optimum individual in existing population, obtains best cluster number and cluster centre, then carries out sample clustering by the Controlling line loss horizontal division of electrical network to be evaluated in different echelons; If temperature index is higher than final temperature T end, then perform cooling and operate and return step 5;
Step 8: in the same echelon of line loss management level, the size according to line loss value is evaluated, and the height of the corresponding Controlling line loss level of height of line loss value, evaluates separate between each echelon.
2. a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm according to claim 1, is characterized in that, in step 4, for k cluster centre selected in chromosome, by grid line loss indicator vector x lcluster centre c is included into according to the principle that Euclidean distance is minimum λ, that is:
||x l-c λ||=min||x l-c j||(j=1,2,...,k)
Wherein, x lfor the N dimensional vector that each influence factor index of grid line loss is formed, and x l=(x l1, x l2..., x lN), x l1~ x lNcorrespond respectively to N number of influence factor index value.
3. a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm according to claim 2, is characterized in that, in step 4, the maximum cluster object definition fitness of, between class distance minimum according to inter-object distance is f = 1 1 + J , Wherein J = &Sigma; &lambda; = 1 k &Sigma; x l &Element; c &lambda; | | x l - c &lambda; | | 1 + &Sigma; m &NotEqual; n | | c m - c n | | .
4. a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm according to claim 1, is characterized in that, carry out mathematical modeling in step one on the factor affecting grid line loss level, wherein: electric pressure and level Y dYDJcalculated with mathematical model formula be:
Y DYDJ=ΣLoss i
Wherein, each electric pressure in i=500 ~ 10kV; Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided;
Circuit average length Y xLCDcalculated with mathematical model formula be:
Y X L C D = &Sigma;L i &times; 10 2 / i 2 &Sigma;N i
Wherein: L ifor the line length under electrical network i electric pressure to be divided; N ifor electrical network i electric pressure circuit total number to be divided;
Sectional area of wire Y dXJMcalculated with mathematical model formula:
Y DXJM=ΣLoss iq θ(q iaL iθa+q ibL iθb+q icL iθc)
Wherein: θ is wire type sequence number, when θ=1, represent pole line, during θ=2, represent cable; q θfor wire type weight, by the length ratio of pole line and cable, if certain electrical network is without cable, then q 1get 100%; Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; L i θ a, L i θ b, L i θ cfor the i electric pressure overhead transmission line of electrical network to be divided or the cross section of cable and the ratio of electrical network i electric pressure line length to be divided, wire is divided into I cross section, II cross section, cross section, three kinds, III cross section by sectional area size, the sectional area that wherein sectional area in I cross section is less than the sectional area in II cross section, the sectional area in II cross section is less than III cross section, a, b, c represent I cross section, II cross section, III cross section respectively; q ia, q ib, q icrepresent i electric pressure a respectively, weight coefficient that b, c cross section wire affects line loss.
5. a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm according to claim 4, is characterized in that, carry out mathematical modeling in step one on the factor affecting grid line loss level, wherein: distribution transforming status of equipment Y pBZKcalculated with mathematical model formula:
Y PBZK=q dT d+q eT e+q fT f
Wherein: T d, T e, T fbe respectively the capacity of distribution transform ratio of high consumption model, common model, energy-conservation model, high consumption model is below S7, and common model is S9 ~ S11, and energy-conservation model is more than S11, and the capacity merging of wherein non-crystaline amorphous metal change and single-phase change is included into more than S11 model and is participated in calculating; Reactive-load compensation configuration Y wGBCcalculated with mathematical model formula be:
Y WGBC=ΣLoss i(1-W i)
Wherein: Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; W ifor the i electric pressure reactive-load compensation configuration coefficients of each electrical network, main transformer configure the ratio of condenser capacity and main transformer capacity;
Load space distribution Y fHSJcalculated with mathematical model formula:
Y F H S J = &Sigma; i = 1 12 &psi; i
Wherein: ψ ifor the moon load degree of uniformity of each electrical network, the ratio of front-month maximum peak-valley difference and monthly average load.
6. a kind of grid line loss administrative evaluation method based on Global Genetic Simulated Annealing Algorithm according to claim 5, is characterized in that, carry out mathematical modeling in step one on the factor affecting grid line loss level, wherein: unit power transformation capacity load rate Y zBFZcalculated with mathematical model formula be:
Y Z B F Z = &eta; i G i G 500 + G 330 + G 220 + G 110
&eta; i = P 0 i P i / B i + P 1 i S i 2 &times; P i B i
Wherein: G ifor power transmission amount under i electric pressure transformer; G 500, G 330, G 220, G 110the lower power transmission amount of corresponding 500kV, 330kV, 220kV, 110kV electric pressure transformer respectively; η ifor the proportion of goods damageds of i electric pressure transformer; P 0ifor the representative value of i electric pressure transformer noload losses; P 1ifor the representative value of i electric pressure transformer load loss; S ifor the representative value of i electric pressure transformer rated capacity; P ifor sending power under i electric pressure transformer; B ifor the capacity of i electric pressure transformer; Maximum natural load or burden without work coefficient Y zRWGcalculated with mathematical model formula:
Y Z R W G = 1 / Q P
Wherein: Q is the maximum reactive power capability of electrical network, P is the maximum tracking burden with power of electrical network;
The maximum reactive power capability of electrical network is:
Q=Q G+Q C+Q R+Q L
Wherein: Q gfor the reactive power of generator, Q cfor capacitive reactive power compensates total volume, Q rfor adjacent net inputs or outputs idle, Q lfor the charge power of circuit and cable;
Dividing potential drop electricity sales amount Y fYDLindex calculate formula:
Y F Y D L = &Sigma; A i Loss i A
Wherein: Loss ifor i electric pressure dividing potential drop line loss per unit in electrical network gamut to be divided; A ifor electrical network i electric pressure delivery; A is total delivery of electrical network;
Harmless electricity Y wSDLcalculated with mathematical model formula:
Y WSDL=1-W
Wherein: W is that each electrical network can't harm electricity accounting;
Rural area area accounting Y nCMJcalculated with mathematical model formula be:
Y NCMJ=S’
Wherein: S ' is each electrical network rural area area accounting;
Non-industrial GDP accounting Y fGYcalculated with mathematical model formula be:
Y FGY=G
Wherein: G is the non-industrial GDP accounting of each electrical network;
Power density Y gDMDcalculated with mathematical model formula be:
Y G D M D = A &eta;
Wherein: A is total delivery of electrical network, η is each mains supply area.
CN201510846007.XA 2015-11-27 2015-11-27 Genetic simulated annealing algorithm based power grid line loss management evaluation method Pending CN105488589A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510846007.XA CN105488589A (en) 2015-11-27 2015-11-27 Genetic simulated annealing algorithm based power grid line loss management evaluation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510846007.XA CN105488589A (en) 2015-11-27 2015-11-27 Genetic simulated annealing algorithm based power grid line loss management evaluation method

Publications (1)

Publication Number Publication Date
CN105488589A true CN105488589A (en) 2016-04-13

Family

ID=55675558

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510846007.XA Pending CN105488589A (en) 2015-11-27 2015-11-27 Genetic simulated annealing algorithm based power grid line loss management evaluation method

Country Status (1)

Country Link
CN (1) CN105488589A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106231610A (en) * 2016-09-30 2016-12-14 重庆邮电大学 Resource allocation methods based on sub-clustering in Femtocell double-layer network
CN107194510A (en) * 2017-05-19 2017-09-22 中国电力科学研究院 Var Optimization Method in Network Distribution based on simulated annealing chicken group's algorithm
CN109034244A (en) * 2018-07-27 2018-12-18 国家电网有限公司 Line loss abnormality diagnostic method and device based on electric quantity curve characteristic model
CN109063769A (en) * 2018-08-01 2018-12-21 济南大学 Clustering method, system and the medium of number of clusters amount are automatically confirmed that based on the coefficient of variation
CN111553532A (en) * 2020-04-28 2020-08-18 闽江学院 Method and system for optimizing urban express delivery vehicle path
CN113344073A (en) * 2021-06-02 2021-09-03 云南电网有限责任公司电力科学研究院 Daily load curve clustering method and system based on fusion evolution algorithm
US20220114317A1 (en) * 2020-10-13 2022-04-14 Samsung Electronics Co., Ltd. Systems, methods, and computer program products for transistor compact modeling using artificial neural networks

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105046584A (en) * 2015-08-10 2015-11-11 国家电网公司 K-MEANS algorithm-based ideal line loss rate calculation method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105046584A (en) * 2015-08-10 2015-11-11 国家电网公司 K-MEANS algorithm-based ideal line loss rate calculation method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
武兆慧: "基于遗传算法的聚类方法研究", 《中国优秀博硕士学位论文全文数据库》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106231610A (en) * 2016-09-30 2016-12-14 重庆邮电大学 Resource allocation methods based on sub-clustering in Femtocell double-layer network
CN106231610B (en) * 2016-09-30 2019-06-14 重庆邮电大学 Based on the resource allocation methods of sub-clustering in Femtocell double-layer network
CN107194510A (en) * 2017-05-19 2017-09-22 中国电力科学研究院 Var Optimization Method in Network Distribution based on simulated annealing chicken group's algorithm
CN107194510B (en) * 2017-05-19 2022-08-23 中国电力科学研究院 Power distribution network reactive power optimization method based on simulated annealing chicken swarm algorithm
CN109034244A (en) * 2018-07-27 2018-12-18 国家电网有限公司 Line loss abnormality diagnostic method and device based on electric quantity curve characteristic model
CN109034244B (en) * 2018-07-27 2020-07-28 国家电网有限公司 Line loss abnormity diagnosis method and device based on electric quantity curve characteristic model
CN109063769A (en) * 2018-08-01 2018-12-21 济南大学 Clustering method, system and the medium of number of clusters amount are automatically confirmed that based on the coefficient of variation
CN109063769B (en) * 2018-08-01 2021-04-09 济南大学 Clustering method, system and medium for automatically determining cluster number based on coefficient of variation
CN111553532A (en) * 2020-04-28 2020-08-18 闽江学院 Method and system for optimizing urban express delivery vehicle path
CN111553532B (en) * 2020-04-28 2022-12-09 闽江学院 Method and system for optimizing urban express vehicle path
US20220114317A1 (en) * 2020-10-13 2022-04-14 Samsung Electronics Co., Ltd. Systems, methods, and computer program products for transistor compact modeling using artificial neural networks
CN113344073A (en) * 2021-06-02 2021-09-03 云南电网有限责任公司电力科学研究院 Daily load curve clustering method and system based on fusion evolution algorithm

Similar Documents

Publication Publication Date Title
CN105488589A (en) Genetic simulated annealing algorithm based power grid line loss management evaluation method
Huang et al. A clustering based grouping method of nearly zero energy buildings for performance improvements
CN107612016B (en) Planning method of distributed power supply in power distribution network based on maximum voltage correlation entropy
CN106779277B (en) Classified evaluation method and device for network loss of power distribution network
CN107316125A (en) A kind of active distribution network economical operation evaluation method based on economical operation domain
CN105046584B (en) A kind of calculation method of the ideal line loss per unit based on K-MEANS algorithm
CN104037943A (en) Method and system for monitoring voltage and capable of improving power grid voltage quality
CN103136585A (en) Weighting Voronoi diagram substation planning method based on chaotic and genetic strategy
CN106803130B (en) Planning method for distributed power supply to be connected into power distribution network
CN1323478C (en) Reactive optimizing method of power system based on coordinate evolution
CN104699959A (en) Similar line-loss division method based on K-MEANS algorithm
CN112712281B (en) Cloud model-based energy storage working condition adaptability comprehensive evaluation method and system
CN104573857A (en) Power grid load rate prediction method based on intelligent algorithm optimization and combination
CN109389272A (en) A kind of comprehensive estimation method and system for voltage coordination control strategy effect
CN104112237A (en) WAMS-based genetic algorithm-improved power grid reactive capacity optimization configuration method
CN102904252B (en) Method for solving uncertainty trend of power distribution network with distributed power supply
CN114996908A (en) Active power distribution network extension planning method and system considering intelligent soft switch access
CN110163283A (en) A kind of calculation method of power distribution network limit line loss per unit
CN106257477B (en) A kind of intermediate frequency amorphous alloy transformer optimization method based on multi-objective genetic algorithm
CN105701717B (en) Power distribution network interaction scheme compilation method based on improved genetic algorithm
CN106384307A (en) Differentiated evaluation method for county-area power distribution network plan
CN104463365B (en) Reactive Voltage Optimum analyzing evaluation method based on distribution automation
CN106251035A (en) The data processing method calculated for the project indicator and device
CN103632210A (en) Sectional optimizing method for medium-voltage distribution network
Ghanegaonkar et al. Coordinated optimal placement of distributed generation and voltage regulator by multi-objective efficient PSO algorithm

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20160413