CN105046363B - A kind of region distribution system single-line diagram layout and optimization method - Google Patents
A kind of region distribution system single-line diagram layout and optimization method Download PDFInfo
- Publication number
- CN105046363B CN105046363B CN201510446179.8A CN201510446179A CN105046363B CN 105046363 B CN105046363 B CN 105046363B CN 201510446179 A CN201510446179 A CN 201510446179A CN 105046363 B CN105046363 B CN 105046363B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- line
- grid
- layout
- 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.)
- Expired - Fee Related
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a kind of region distribution system single-line diagram layout and optimization methods, include the following steps：By arrangement space gridding, the Mesh Point Battle of node layout's solution space and the cabling corridor space of circuit are formed, node layout's solution space is limited in the Mesh Point Battle of node；Each trellis state is described using associated enumerated variable；Node layout is carried out, node layout's model is established, it is most short as node layout's optimization object function using the manhatton distance of node；It is mapped and is initialized, fork attribute is classified using distribution line, the position of substation within a grid is determined according to opposite geography information, class type placement algorithm is selected to be laid out each connection component line of distribution；Adaptive crossover probability is introduced, different crossover probabilities is introduced for different fitness values；Avoid overlapping, the crossing instances of cabling；Gridding method proposed by the present invention effectively facilitates the arrangement of the node layout optimization and circuit cabling of region distribution system single-line diagram.
Description
Technical field
The present invention relates to a kind of region distribution system single-line diagram layout and optimization methods.
Background technology
Electrical single-line diagram automatic mapping technology is one of the important subject in graph visualization field, and realizes system
A kind of intelligentized common support technology of application software.Urban Medium Voltage Distribution Network network is due to using Single-ring network, dual-ring network and more
A variety of ring-like modes of connection such as multi-joint network are segmented, the degree of coupling of node increases, and the complexity of network structure also increases therewith, because
This also proposes new problem to line chart Automatic Drawing.In existing pattern layout algorithm, class type placement algorithm is only applicable in
In the relatively simple network of radial equal topological structures, for ring network, then body limits its limitation；Gridding method tends to
Layout graph effect it is neat, beautiful but huge for catenet calculation amount, it is difficult to realize fast search；Continuous power is led
It is simply easily achieved, but non-uniform length of side distribution is then easy tod produce for contacting complicated network between node, influences to algorithm
The aesthetics of figure.Above-mentioned algorithm is dfficult to apply to the automatic arrangement of ring-like distribution system.
Invention content
The present invention is to solve the above-mentioned problems, it is proposed that a kind of region distribution system single-line diagram layout and optimization method, this
Method relies on advantage of the grid layout in complex network visualization application, studies the region power distribution system based on discrete grid block technology
The arrangement problem of the great deal of nodes and the line relationship between them of system line chart.
To achieve the goals above, the present invention adopts the following technical scheme that：
A kind of region distribution system single-line diagram layout and optimization method, include the following steps：
(1) Optimized model of node layout is established：Region distribution network is divided, effective grid collection, sequence arrangement branch are built
Line node；
(2) by genetic algorithm, the optimum individual in chess game optimization model is carried out in a manner of global parallel search, for the first time
Between genetic algorithm acquirement website after line node layout, using the branch node of location determination as the pact of genetic algorithm next time
Beam, again iteration seek the arrangement of remaining circuit；
(3) it is mapped and is initialized, using two website lines of the whole story as diagonal line, obtain its smooth vertical and horizontal rectangular edges
For path, extended, generates path set；
(4) optimum maintaining strategy evolution Model is used, the evolution of every generation, which is retained current optimum individual, does not participate in heredity
Operation, and its stable state is directly copied into next-generation group；
(5) determine port position, soundd out with line route, juxtaposition judgement, adjustment placement strategy carry out between node
Line, avoid the overlapping of cabling, crossing instances and by trellis state numerical examination, the coordinate of all nodes be subjected to cloth
Line.
The specific method of the step (1) is：It is a triple G=(V, S, l, n) to define a regional distribution network network,
Wherein V is the set of node；S is substation's set, and l is the branch line set connected between any two substation, and n is region electricity
Substation's number is netted, l is enabledpq:S5→S5To connect substation SpWith SqA branch line, wherein branch line lpqIncluding set of node { Vj,
Vj+1,…Vi, number Cnodes(lpq), for any one branch line lpq, it is located at and connects the corresponding of its first and last substation on painting canvas
Path is Lpq, occupied effective grid collection is { g1,g2,…gs, number Cgrids(Lpq), provide line chart node layout mesh
The calculation formula of scalar functions：
s.t.SXk=Ckx
SYk=Cky (1)
From L in formula (1)m={ g1,g2,…gsChoose Cnodes(li) a effective grid sequentially arranges branch line node, i.e.,
Each node x can be obtainedk、ykFor coordinate；Ckx、CkyTo calculate the coordinate constant of gained according to the opposite geographical location of substation.
In the step (2), genetic algorithm is a kind of simulation biological evolution basic process, is come in a manner of global parallel search
Optimum individual in chess game optimization group, the method for acquiring the optimal solution met the requirements, according to distribution network line feature, in addition to
It is directly connected to other than the circuit of two websites, there is also several branched lines drawn among circuit, therefore, according to above-mentioned
Thinking can not complete the optimization of whole system using a genetic algorithm iteration, between first time genetic algorithm obtains website
After line node layout, using the branch node of location determination as the constraint of genetic algorithm next time, iteration seeks residue again
The arrangement of circuit.
In the step (3), gene code is with path set L between websitepqFor population gene, C={ L1,L2,…Lm},i
=1,2 ..., k, k are chromosome length, using specific path as the chromosome of place gene, i.e.,：Lpq={ g1,g2,…gs, gj=
(x, y), j=1,2 ..., s.
In the step (3), the specific production method of initial path collection is：Using two website lines of the whole story as diagonal line,
Obtain its smooth vertical and horizontal rectangular edges be path, other Path selections using first rectangular edges as bounding box it is outwardly extending other
Rectangular edges generate one group of path set, and progress trellis state verification is needed to obtain its validity when generating circuit.
In the step (4), to prevent the randomness of genetic manipulation from destroying the individual that fitness is best in current group, shadow
Optimal speed is rung, selection opertor uses optimum maintaining strategy evolution Model, the i.e. evolution per a generation to retain current optimum individual not
The genetic operation participated in intersection, made a variation, and directly copy to its stable state in next-generation group.
In the step (4), crossover operator：It is that two paths in path set will be selected to carry out, exchange to intersect reorganization operation
Generate two new initial path point sequences, in order to ensure path can in a rectangle frame, with a rectangular edges be intersect it is single
Position, after intersecting, need to extend empty portions in path so that path keeps sealing range；
Mutation operator is to enable traversal path grid further to a kind of mode of line node sum, using multiple spot base
Because of position variation mode, the effective grid not covered by pel in specially seeking in neighborhood enables corresponding grid in path prominent
It fades in effective blank grid.
In the step (5), node is indicated in figure with a horizontal line, the head of the connecting line between node a and node b
Latter end is known as outlet port, and outlet is orthogonal with node at outlet port to connect.
In the step (5), specific method is：
Wiring path is arranged by rule base, then checks whether to exist the case where intersecting and being overlapped, if so, then adjusting road
Diameter, until meeting cabling requirement, this process is exploration process, and basis for estimation is as follows：The path L of two outlet ports of known connection
In shared grid, if there are be no juxtaposition when 0 grid occupied by other cablings；If exist be more than 0 it is discrete
It is to intersect when having occupied grid；It deposits when continuously having occupied grid more than or equal to 2 as overlapping, is arranged according to judging result corresponding
Trellis state Boolean variable m_nState values, it is assumed that the numerical value of the i-th row j row trellis states is expressed as φ (i, j) in arrangement space,
Then have：
In formula, ε is the weights for introducing crossover node, takes ε=10；To node b wiring paths state and it is from node a then：
L is the cabling in the paths node a to b, LxThe row passed through by path L, LyThe row passed through by path L.
In the step (5), exploration, local optimal searching and the method for adjustment of path L are to enable l among all broken lines of path L
With the straight line of linear correlation minimum where two node outgoing ports, state and minimum route searching flow are as follows；
Step1：It is with (x to enable l1,y1) and (x2,y2) be endpoint straightway, whereinIt calculatesTurn to step4；
Step2：Enable (x1,y1) and (x2,y2) be endpoint straight line toward overlap a parallel direction left side/top translation 1
A cell calculatesTurn to step4；
Step3：Enable (x1,y1) and (x2,y2) be endpoint straight line toward the horizontal direction that overlaps it is right/translate 1 below
A cell calculatesTurn to step4；
Step4：If S ≠+∞, step6 is turned to；If S=+ ∞, step2 is turned to；
Step5：If S ≠+∞, step6 is turned to；If S=+ ∞, step3 is turned to；
Step6：Terminate.
Beneficial effects of the present invention are：
(1) gridding method proposed effectively facilitates node layout's optimization and the circuit of region distribution system single-line diagram
The arrangement of cabling；
(2) in node layout's optimization algorithm used by, by the crossover operator in improved adaptive GA-IAGA, the overall situation is enhanced
Search capability improves algorithmic statement efficiency；
(3) by the numeralization of trellis state, keep cabling juxtaposition problem determination more quick, simple, improve cloth
Office's efficiency；
(4) can make to be uniformly distributed in node and figure, cabling is beautiful clear, and computational efficiency and graphical effect can meet engineering
Real requirement.
Description of the drawings
Fig. 1 is Load flow calculation flow chart；
Fig. 2 is two kinds of crossover operator schematic diagrames；
Fig. 3 is the gained path schematic diagram after intersection；
Fig. 4 is path individual variation process schematic；
Fig. 5 is node i and port direction schematic diagram when j levels；
Fig. 6 is port direction schematic diagram when node i is vertical with j；
Fig. 7 is that node i is in diagonal port direction schematic diagram with j.
Specific implementation mode：
The invention will be further described with embodiment below in conjunction with the accompanying drawings.
Application of 1 genetic algorithm in node layout
The universal model of 1.1 node layout's problems
To make the distribution of node geometry have preferable correspondence with network connectivity logic, arrangement space is separated into first
The vertical and horizontal neat grid of u rows v row, each node occupy a grid, while using the shape of a Boolean variable indicia grid
State.On the other hand, in order to meet operations staff see figure be accustomed to, should make power transformation station location with geography relative position it is substantially similar,
The present invention converts plant stand geography information in network to coordinate constant, is placed in corresponding grid, as an optimization the constraint of problem.
After plant stand position is fixed, the line arrangement problem between plant stand may be regarded as path planning problem, general thought be by
Circuit sees the area routing of first and last point determination as, and node considers at a series of path points on connecting up, by assuming in advance
Go out a series of path sets, primary convergence operation carried out to initial path point sequence according to interstitial content, finally converge to one with
Node arrangement path of the path of node phase margin minimum as circuit.Due to the mutual independence in each path, every circuit can
Independently to find respective phase margin minimal path, and realized using a kind of parallel network structure.
In order to realize above-mentioned target, the Optimized model for establishing node layout is needed first.In order to facilitate discussion, the present invention provides
Following 2 definition in relation to figure related notion.
It is a triple G=(V, S, l, n) to define 1 one regional distribution network networks, and wherein V is the set of node；S is to become
Power station is gathered, and l is the branch line set connected between any two substation, and n is regional power grid substation number.Enable lpq:S5→
S5To connect substation SpWith SqA branch line, wherein branch line lpqIncluding set of node { Vj,Vj+1,…Vi, number Cnodes
(lpq)。
2 are defined for any one branch line lpq, it is L to be located at and connect the respective paths of its first and last substation on painting canvaspq, institute
The effective grid collection of occupancy is { g1,g2,…gs, number Cgrids(Lpq)。
According to above definition and about marking, we provide the calculation formula of line chart node layout object function：
s.t.SXk=Ckx
SYk=Cky (1)
From L in formula (1)m={ g1,g2,…gsChoose Cnodes(li) a effective grid sequentially arranges branch line node, i.e.,
Each node x can be obtainedk、ykFor coordinate；SXk、SYkThe corresponding x of respectively k-th of substation, y-axis coordinate value, Ckx、CkyFor root
The coordinate constant of gained is calculated according to the opposite geographical location of substation.
1.2 genetic algorithms seek path
Genetic algorithm is a kind of simulation biological evolution basic process, is come in a manner of global parallel search in chess game optimization group
Optimum individual, the method for acquiring the optimal solution met the requirements.According to distribution network line feature, in addition to being directly connected to two stations
Other than the circuit of point, there is also several branched lines drawn among circuit.Therefore, according to above-mentioned thinking, using primary
Genetic algorithm iteration can not complete the optimization of whole system, we can first time genetic algorithm obtain website between circuit section
After point layout, using the branch node of location determination as the constraint of genetic algorithm next time, iteration seeks remaining circuit again
Arrangement.The general process that wherein genetic algorithm follows is as shown in Figure 1.
1.2.1 the mapping and initialization of gene
Gene code is with path set L between websitepqFor population gene, C={ L1,L2,…Lm, i=1,2 ..., k, k is
Chromosome length, using specific path as the chromosome of place gene, i.e.,：Lpq={ g1,g2,…gs, gj=(x, y), j=1,
2,…,s。
The generation of initial path collection.According to algorithm thinking described above, the logically contiguous website of any two is both needed to
A series of path sequence is generated, in order to enable the circuit logic of arrangement is clear, initial path collection follows such a thinking：With
Two website lines of the whole story are diagonal line, and it is path to obtain its smooth vertical and horizontal rectangular edges, and other paths may be selected with first
Rectangular edges are other outwardly extending rectangular edges of bounding box, generate one group of path set as a result,.It should be noted that institute of the present invention
It in the path planning problem stated, avoids the repetition in path from generating and is very important, because the corresponding path of different circuits generates
In the process, it is possible to the case where converging to same paths occur, so as to cause circuit arranged superposed.In order to avoid such feelings
Condition needs progress trellis state verification to obtain its validity when generating circuit.
1.2.2 selection, intersection and mutation operator
Selection, to intersect with variation be operator important in genetic algorithm.It is current to prevent the randomness of genetic manipulation from destroying
The best individual of fitness in group influences optimal speed, and selection opertor of the present invention uses optimum maintaining strategy evolution Model, i.e.,
Evolution per a generation retains current optimum individual and does not participate in the genetic operations such as intersection, variation, and directly copies to down its stable state
In generation group.Remaining intersects and mutation operator design is as follows.
Crossover operator：Intersecting reorganization operation will select two paths progress part exchange generation two in path set new
Initial path point sequence, in order to ensure that path can be in a rectangle frame, the present invention is to intersect unit with a rectangular edges, is occurred
After intersection, empty portions in path need to be extended so that path keeps sealing range.
Mutation operator：Mutation operator is to enable traversal path grid further to a kind of mode of line node sum,
For the present invention using multiple spot gene position variation mode, the effective grid not covered by pel in specially seeking in neighborhood enables road
Corresponding grid is mutated into effective blank grid in diameter.
Wherein intersect and permanent amount p is respectively adopted with mutation probabilityc、pm。
2 wiring process
After completing node layout's optimization, need to carry out to being laid out node line and in circuit corridor space into walking
Line, and the overlapping of cabling, crossing instances are avoided by trellis state numerical examination and as possible, keep figure whole clear beautiful.
Entire wiring process can be divided into two port position determination, route searching steps, between node a and node b
Line for, illustrate wiring process.
The determination of 2.1 port positions
Node indicates that the first and last section of the connecting line between node a and node b is known as leading-out terminal in figure with a horizontal line
Mouthful, outlet is orthogonal with node at outlet port to connect.The direction of port is divided into 2 kinds of situations：1) outlet port side at two nodes
To identical；2) outlet port direction is opposite at two nodes.Fig. 5, Fig. 6, Fig. 7 show that node relative position is horizontal line side respectively
To, several outlet port directions type in vertical line direction and diagonal.
Line between 2.2 nodes
The placement strategy that line is soundd out using line route, juxtaposition judgement, adjusts between node.
It is different according to node relative position, the rule base of wiring path selection is established, cabling number is secondary in wherein Fig. 5,6,7
Sequence is the priority of rule base interior joint relative position Path selection.According to node relative position rule searching library, then can establish
The path of one connection first and last outlet port.
Rule base is pressed first and arranges wiring path, then checks whether to exist the case where intersecting and being overlapped, if so, then adjusting
Path, until meeting cabling requirement, this process is exploration process.Basis for estimation is as follows：The road of two outlet ports of known connection
In grid shared by diameter L, if there are be no juxtaposition when 0 grid occupied by other cablings；If existing discrete more than 0
The grid of occupancy when for intersect；It deposits when continuously having occupied grid more than or equal to 2 as overlapping.According to judging result, we can
Corresponding trellis state Boolean variable m_nState values are arranged.Assuming that the numerical value of the i-th row j row trellis states indicates in arrangement space
For φ (i, j), then have：
In formula, ε is the weights for introducing crossover node, takes ε=10；To node b wiring paths state and it is from node a then：
L is the cabling in the paths node a to b, LxThe row passed through by path L, LyThe row passed through by path L.
Exploration, local optimal searching and the method for adjustment of path L be enable l be all broken lines of path L among with two node outgoing ends
The straight line of linear correlation minimum where mouthful, state and minimum route searching flow are as follows.
Step1：It is with (x to enable l1,y1) and (x2,y2) be endpoint straightway, whereinCalculating formula
(3), S is enabled0=S turns to step4；
Step2：Enable (x1,y1) and (x2,y2) be endpoint straight line toward overlap a parallel direction left side/top translation 1
A cell turns to step1；
Step3：Enable (x1,y1) and (x2,y2) be endpoint straight line toward the horizontal direction that overlaps it is right/translate 1 below
A cell turns to step1；
Step4：If S0≠+∞ turns to step6；If S0=+∞ turns to step2；
Step5：If S ≠+∞, step6 is turned to；If S=+ ∞, step3 is turned to.
Step6：Terminate.
The standardization support technology of 3 graphics systems
To realize that the shared and interoperability of system figure, the graphical interaction scheme of this graphics system reference IEC61970 are right
Model describes and storage form is respectively adopted and follows the standardization such as common information model (CIM) and expansible vector graphics (SVG)
Mode is established.Wires and Topology packets description in distribution network topological relation application CIM files, wherein system connectivity
Model description is established by ConductingEquipment-Terminal-ConnectivityNode three.Secondly, it also needs
The public pel packet based on SVG is established, including plant stand is rectangle frame, node is strigula, and overhead transmission line is fine line, electric power electricity
Cable road is dotted line.
Follow the model and icon saving format and the above-mentioned grid figure based on genetic algorithm of CIM_SVG
Automatic generating calculation, as three big technology essential factors of structure graphics system structure, when system and other applications interact
When, standardized graphics file need to only be carried out simply importing and exporting, you can generate the rule for meeting electric power enterprise particular demands
The graphic file of generalized figure.
4 examples
The test that line chart automatically generates is carried out to power distribution system network according to the above method, selection region network contains 3
Substation, totally 7 feeder lines, a node more than 30, kind of a group mean adaptive value increases to 89% from 50% in 2s.From pattern layout knot
From the point of view of fruit, substation keeps geographical relative position in generated figure, and line construction is clear, Node distribution is well-balanced, meets engineering
Real requirement.
Above-mentioned, although the foregoing specific embodiments of the present invention is described with reference to the accompanying drawings, not protects model to the present invention
The limitation enclosed, those skilled in the art should understand that, based on the technical solutions of the present invention, those skilled in the art are not
Need to make the creative labor the various modifications or changes that can be made still within protection scope of the present invention.
Claims (2)
1. the layout and optimization method of region distribution system in a kind of line chart, it is characterized in that：Include the following steps：
(1) Optimized model of node layout is established：Region distribution network is divided, effective grid collection is built, sequence arranges branch line section
Point；
(2) by genetic algorithm, the optimum individual in chess game optimization model is carried out in a manner of global parallel search, in heredity for the first time
Algorithm obtains between website after line node layout, using the branch node of location determination as the constraint of genetic algorithm next time,
Again iteration seeks the arrangement of remaining circuit；
(3) it is mapped and is initialized, using two website lines of the whole story as diagonal line, it is road to obtain its smooth vertical and horizontal rectangular edges
Diameter is extended, and path set is generated；
(4) optimum maintaining strategy evolution Model is used, the evolution of every generation, which is retained current optimum individual, does not participate in genetic operation,
And its stable state is directly copied into next-generation group；
(5) it determines port position, is soundd out with line route, juxtaposition judges, the placement strategy of adjustment carries out the company between node
Line avoids the overlapping of cabling, crossing instances and by trellis state numerical examination, the coordinate of all nodes is connected up；
The specific method of step (1) is：It is a four-tuple G=(V, S, l, n) to define a regional distribution network network, and wherein V is
The set of node；S is substation's set, and l is the branch line set connected between any two substation, and n is regional power grid power transformation
It stands number, enables lpq：SP→SQTo connect substation SPWith SQA branch line, wherein branch line lpqIncluding set of node { Vj,Vj+1,…
Vi, node number contained by set of node is Cnodes(lpq), for any one branch line lpq, it is located on painting canvas and connects its first and last power transformation
The respective paths stood are Lpq, occupied effective grid collection is { g1,g2,…gs, grid integrate contained by meshes number as Cgrids
(Lpq), provide the calculation formula of line chart node layout object function：
s.t.SXk=Ckx
SYk=Cky (1)
From L in formula (1)ij={ g1, g2... gsChoose Cnodes(lij) a effective grid sequentially arranges branch line node, you can
Obtain each node xk、ykFor coordinate；SXk、SYkThe corresponding x of respectively k-th of substation, y-axis coordinate value, Ckx、CkyAccording to
The opposite geographical location of substation calculates the coordinate constant of gained；
In step (3), gene shine is with path set L between websitepqFor population gene, C={ L1,L2,…Lm, i=1,
2 ..., k, k are chromosome length, using specific path as the chromosome of place gene, i.e.,：Lpq={ g1,g2,…gs, gj=(x,
Y), j=1,2 ..., s；
In step (3), the specific production method of initial path collection is：Using two website lines of the whole story as diagonal line, its cross is obtained
Flat vertical rectangular edges are path, other Path selections using first rectangular edges as other outwardly extending rectangular edges of bounding box,
One group of path set is generated, progress trellis state verification is needed to obtain its validity when generating circuit；
In step (4), to prevent the randomness of genetic manipulation from destroying the individual that fitness is best in current group, optimization speed is influenced
Degree, selection opertor use optimum maintaining strategy evolution Model, i.e., the evolution per a generation retain current optimum individual do not participate in intersection,
The genetic operation of variation, and directly copy to its stable state in next-generation group；
In step (4), crossover operator：It is that two paths in path set will be selected to carry out, exchange generation two to intersect reorganization operation
New initial path point sequence, in order to ensure that path can be to intersect unit with a rectangular edges, hand in a rectangle frame
After fork, empty portions in path need to be extended so that path keeps sealing range；
Mutation operator is to enable traversal path grid further to a kind of mode of line node sum, using multiple spot gene position
Variation mode, the effective grid not covered by pel in specially seeking in neighborhood, enable in path corresponding grid be mutated to
In effective blank grid；
In step (5), node is indicated in figure with a horizontal line, and the first and last section of the connecting line between node a and node b is known as
Outlet port, outlet is orthogonal with node at outlet port to connect；
In step (5), specific method is：
Wiring path is arranged by rule base, then checks whether to exist the case where intersecting and being overlapped, if so, then adjusts path, directly
To cabling requirement is met, this process is exploration process, and basis for estimation is as follows：Shared by the path L of two outlet ports of known connection
In grid, if there are be no juxtaposition when 0 grid occupied by other cablings；If there is accounted for discrete more than 0
It is intersection when with grid；It deposits when continuously having occupied grid more than or equal to 2 as overlapping, corresponding grid is arranged according to judging result
State Boolean variable m_nState values, it is assumed that the numerical value of the i-th row j row trellis states is expressed as φ (i, j) in arrangement space, then
Have：
In formula, ε is the weights for introducing crossover node, takes ε=10；To node b wiring paths state and it is from node a then：
L is the cabling in the paths node a to b, LxThe row passed through by path L, LyThe row passed through by path L；
In step (5), exploration, local optimal searching and the method for adjustment of path L be enable l be all broken lines of path L among with two nodes
The straight line of linear correlation minimum where outlet port, state and minimum route searching flow are as follows；
Step1：It is with (x to enable l1,y1) and (x2,y2) be endpoint straightway, whereinIt calculatesTurn to step4；
Step2：Enable (x1,y1) and (x2,y2) be endpoint straight line toward overlap a parallel direction left side/top translate 1 list
First lattice calculateTurn to step4；
Step3：Enable (x1,y1) and (x2,y2) be endpoint straight line toward the horizontal direction that overlaps it is right/1 list of translation below
First lattice calculateTurn to step4；
Step4：If S ≠+∞, step6 is turned to；If S=+ ∞, step2 is turned to；
Step5：If S ≠+∞, step6 is turned to；If S=+ ∞, step3 is turned to；
Step6：Terminate.
2. the layout and optimization method of region distribution system in a kind of line chart as described in claim 1, it is characterized in that：Step
(2) in, genetic algorithm is a kind of simulation biological evolution basic process, is come in a manner of global parallel search in chess game optimization group
Optimum individual, the method for acquiring the optimal solution met the requirements, according to distribution network line feature, in addition to being directly connected to two websites
Circuit other than, the branched lines that there is also several to draw among the circuit therefore can not be complete using a genetic algorithm iteration
At the optimization of whole system, obtained between website after line node layout, by the branch of location determination in first time genetic algorithm
Constraint of the node as genetic algorithm next time, again iteration seek the arrangement of remaining circuit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510446179.8A CN105046363B (en) | 2015-07-24 | 2015-07-24 | A kind of region distribution system single-line diagram layout and optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510446179.8A CN105046363B (en) | 2015-07-24 | 2015-07-24 | A kind of region distribution system single-line diagram layout and optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105046363A CN105046363A (en) | 2015-11-11 |
| CN105046363B true CN105046363B (en) | 2018-11-02 |
Family
ID=54452890
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510446179.8A Expired - Fee Related CN105046363B (en) | 2015-07-24 | 2015-07-24 | A kind of region distribution system single-line diagram layout and optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105046363B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017124132A1 (en) | 2016-01-22 | 2017-07-27 | Biarri Networks Pty Ltd | Method and system for designing an electricity distribution network |
| CN106777686A (en) * | 2016-12-15 | 2017-05-31 | 天津冠睿霖科技发展有限公司 | The automatic distribution office method of distribution single line in power network based on geography information |
| CN107330205B (en) * | 2017-07-05 | 2020-07-07 | 大连民族大学 | Track layout optimization equipment for complex push type movable partition system |
| CN108564637B (en) * | 2018-04-19 | 2022-03-29 | 北京知道创宇信息技术股份有限公司 | Geometric model arrangement method and device |
| CN109344476B (en) * | 2018-09-20 | 2023-05-26 | 山东鲁能软件技术有限公司 | CIM model-based power distribution network single line diagram line branch structure generation method and device |
| CN109933858B (en) * | 2019-02-20 | 2020-12-15 | 中国农业大学 | Core division parallel simulation method for power distribution network |
| CN112734353A (en) * | 2019-10-28 | 2021-04-30 | 北京国双科技有限公司 | Layout method and device for dynamic multi-branch of visual process |
| CN111324998B (en) * | 2019-12-31 | 2023-09-12 | 浙江华云信息科技有限公司 | Route search-based connecting wire routing layout method |
| CN113836681B (en) * | 2021-11-26 | 2022-03-11 | 国电南瑞南京控制系统有限公司 | Power grid single line diagram layout method and device |
| CN116485056B (en) * | 2023-04-13 | 2023-10-20 | 珠海华成电力设计院股份有限公司 | Scene construction system based on transmission line path planning |
| CN116227888B (en) * | 2023-05-05 | 2023-07-28 | 山东大学 | Urban power distribution network planning method and system considering non-cross constraint of lines in road section |
| CN117892690A (en) * | 2024-01-15 | 2024-04-16 | 广东工业大学 | Wiring optimization method of FPGA Die-level system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102393869A (en) * | 2011-12-02 | 2012-03-28 | 河海大学 | Continuous physical distribution node layout optimization method based on weighted Voronoi diagram |
| CN103020871A (en) * | 2012-12-05 | 2013-04-03 | 陕西电力科学研究院 | Electric power transmission line and disaster geographic information system |
| KR20130095882A (en) * | 2012-02-21 | 2013-08-29 | 한국전력공사 | Distribution automation design method and system |
-
2015
- 2015-07-24 CN CN201510446179.8A patent/CN105046363B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102393869A (en) * | 2011-12-02 | 2012-03-28 | 河海大学 | Continuous physical distribution node layout optimization method based on weighted Voronoi diagram |
| KR20130095882A (en) * | 2012-02-21 | 2013-08-29 | 한국전력공사 | Distribution automation design method and system |
| CN103020871A (en) * | 2012-12-05 | 2013-04-03 | 陕西电力科学研究院 | Electric power transmission line and disaster geographic information system |
Non-Patent Citations (1)
| Title |
|---|
| 基于新型力导算法的省级输电网均匀接线图自动布局;张坚民等;《电力系统自动化》;20130610;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105046363A (en) | 2015-11-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105046363B (en) | A kind of region distribution system single-line diagram layout and optimization method | |
| CN108629061A (en) | A kind of power distribution network line chart automatic generation method of hybrid layout | |
| CN105138764B (en) | A kind of method of the power grid thematic map automatic mapping model based on multiple-objection optimization | |
| Cossi et al. | Planning of secondary distribution circuits through evolutionary algorithms | |
| CN105488269A (en) | CIM based automatic graph-forming system for power transmission and distribution network | |
| CN107545085B (en) | Automatic generation method for process level network connection diagram of intelligent substation | |
| CN111444587A (en) | Electric power graph drawing method based on automatic drawing technology | |
| CN104850011B (en) | A kind of TSP avoidances optimum path planning method in obstacle environment | |
| CN103020335A (en) | Method for automatically converting distribution network geographic wiring diagram into region orthogonal diagram | |
| CN105205203B (en) | A kind of boundless cross wire method of distribution feeder line chart | |
| CN103942345B (en) | Method for automatically generating IED network graph | |
| CN108413963A (en) | Bar-type machine people's paths planning method based on self study ant group algorithm | |
| CN111027161B (en) | Automatic generation method for large-scale transmission network tidal current diagram | |
| CN108988400A (en) | Power distribution method and electronic equipment for multi-machine parallel connection electric power electric transformer | |
| CN108495252A (en) | Indoor positioning network element Optimal Deployment Method based on genetic algorithm and simulated annealing | |
| Hassan et al. | Evaluation of clustering algorithms for DAP placement in wireless smart meter network | |
| CN116976057B (en) | Automatic arrangement method for device layout | |
| CN109872384A (en) | A kind of shaft tower automation modeling method based on airborne LIDAR point cloud data | |
| CN111639412A (en) | Method for automatically generating single line diagram based on geographical edge layout | |
| CN114896746B (en) | Topological optimization method for current collection system of offshore wind farm | |
| CN110163440A (en) | The location determining method and device of power equipment | |
| Lendák et al. | Electric power system one-line diagram generation with genetic algorithm | |
| CN114254467A (en) | Power grid ring network diagram generation method | |
| Zhang et al. | Research on complete coverage path planning for unmanned surface vessel | |
| Su et al. | Path planning for mobile robots based on genetic algorithms |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181102 |