CN109743252A - Generation method, device, computer equipment and the storage medium in grid switching operation path - Google Patents
Generation method, device, computer equipment and the storage medium in grid switching operation path Download PDFInfo
- Publication number
- CN109743252A CN109743252A CN201811589301.7A CN201811589301A CN109743252A CN 109743252 A CN109743252 A CN 109743252A CN 201811589301 A CN201811589301 A CN 201811589301A CN 109743252 A CN109743252 A CN 109743252A
- Authority
- CN
- China
- Prior art keywords
- node
- initial
- electric network
- nodes
- current
- 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.)
- Granted
Links
Abstract
This application involves the generation method in grid switching operation path, device, computer equipment and storage mediums.This method comprises: the initial primary topology and target topology of building electric network wiring, the node number of the target topology and the node number of the initial primary topology are identical；Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；Using the neighborhood of nodes of the initial node as current node, determine the initial node to the shortest path between the current node by heuristic search algorithm；Using next neighborhood of nodes of the neighborhood of nodes as new current node, the initial node is determined to the shortest path between the current node, until the adjacent node is the destination node by heuristic search algorithm；Export the shortest path successively after all nodes.The application can get grid switching operation path automatically, reduce search space, improve efficiency.
Description
Technical field
This application involves electric power system dispatching service technique fields, more particularly to a kind of generation side in grid switching operation path
Method, device, computer equipment and storage medium.
Background technique
With the continuous development of electric system, electric power system dispatching business shows complexity and diversity, dispatches business
Workload is continuously increased.
Currently, Substation Switch Changing Operation ticket expert system is mostly the system being manually arranged based on typical wiring, do not have spirit
Activity and popularity.It is most all to be mentioned simply by the unique heuristic function of design to reach meanwhile in similar technique application
Efficient purpose, this makes the efficiency of searching method be dependent only on heuristic function, therefore when search larger space, efficiency is mentioned
It rises few.
In view of frequently involved in scheduler routine it is some be basically unchanged and relatively simple operation, if can be complete using computer
At the simple work of this part, then the workload of dispatcher can be not only reduced, but also can be realized more acurrate more convenient and fast
Scheduling, it is therefore necessary to the method that research can intelligently generate grid switching operation sequence.
Summary of the invention
Based on this, it is necessary in view of the above technical problems, provide a kind of grid switching operation that can be improved coordinates measurement efficiency
Generation method, device, computer equipment and the storage medium in path.
A kind of generation method in grid switching operation path, this method comprises:
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target are constructed
The node number of topological structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, the initial knot is determined by heuristic search algorithm
Point arrives the shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
The step of initial primary topology of the building electric network wiring includes: in one of the embodiments,
The original state matrix for constructing electric network wiring, in the element representation electric network wiring in the original state matrix
The connection relationship of each node and branch；
The step of target topology of the building electric network wiring includes:
Construct the dbjective state matrix of electric network wiring, the row of the line number of the dbjective state matrix and the original state matrix
Number is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
The initial node should be determined to the current node by heuristic search algorithm in one of the embodiments,
Between shortest path the step of include:
(1) calculates the initial node and reaches the step number between the current node by each branch according to the following formula
F (n)=g (n)+h (n) (1)；
Wherein, g (n) indicates the step number for reaching the current node n by a branch from the initial node, h (n) table
Show the step number still needed to away from current node n to the destination node；
The smallest branch of f (n) value is determined as shortest path.
Determine the initial node to the current knot by heuristic search algorithm at this in one of the embodiments,
Point between shortest path the step of before, this method further include:
It will be unsatisfactory for the node deletion of preset condition.
In one of the embodiments, the method also includes:
The node that the optimal path successively passes through is determined as to need the location point of grid switching operation.
The preset condition includes: in one of the embodiments,
Two bus current potentials for having branch connected are equal；And/or
The connected state of load bus and power supply node with preset it is identical.
A kind of generating means in grid switching operation path, the device include:
First building module constructs the initial topology knot of electric network wiring for the current wiring condition according to electric network
Structure；
Second building module, for the wiring condition according to the required electric network, the target for constructing electric network wiring is opened up
Structure is flutterred, the node number of the target topology and the node number of the initial primary topology are identical；
Node determining module, for determining initial node according to the initial primary topology, according to the target topology knot
Structure determines destination node；
Path determination module, for passing through heuristic search using the neighborhood of nodes of the initial node as current node
Algorithm determines the initial node to the shortest path between the current node；
Iteration module, for using next neighborhood of nodes of the neighborhood of nodes as new current node, by heuristic
Searching algorithm determines the initial node to the shortest path between the current node, until the neighborhood of nodes is the mesh
Mark node；
Output module, for export the shortest path successively after all nodes.
The iteration module includes: in one of the embodiments,
Computing unit calculates the initial node according to formula f (n)=g (n)+h (n) based on and is reached by each branch
Step number between the current node, wherein g (n) indicates to reach the current knot from the initial node by a branch
The step number of point n, h (n) indicate the step number still needed to away from current node n to the destination node；
Path determining unit, for the smallest branch of f (n) value to be determined as shortest path.
A kind of computer equipment can be run on a memory and on a processor including memory, processor and storage
Computer program, the processor perform the steps of when executing the computer program
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target are constructed
The node number of topological structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, the initial knot is determined by heuristic search algorithm
Point arrives the shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
It is performed the steps of when row
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target are constructed
The node number of topological structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, the initial knot is determined by heuristic search algorithm
Point arrives the shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
Generation method, device, computer equipment and the storage medium in above-mentioned grid switching operation path are connect by constructing electric network
The initial primary topology and target topology of line, compare both topological structures, under the different position of wiring state is determined
Come, the node for successively needing back brake from initial wiring state to target wiring state is then searched for by heuritic approach, automatically
Grid switching operation path is got, search space is reduced, improves efficiency.
Detailed description of the invention
Fig. 1 is the applied environment figure of the generation method in grid switching operation path in one embodiment；
Fig. 2 is the flow diagram of the generation method in grid switching operation path in one embodiment；
Fig. 3 is the flow diagram of the generation method in grid switching operation path in another embodiment；
Fig. 4 is the structural block diagram of the generating means in grid switching operation path in one embodiment；
Fig. 5 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
The generation method in grid switching operation path provided by the present application, can be applied in application environment as shown in Figure 1.Its
In, terminal 102 is communicated with server 104 by network by network.Wherein, terminal 102 can be, but not limited to be various
Personal computer, laptop, smart phone, tablet computer and portable wearable device, server 104 can be with independently
The server cluster of server either multiple servers composition realize.
In one embodiment, it as shown in Fig. 2, providing a kind of generation method in grid switching operation path, answers in this way
For being illustrated for the terminal in Fig. 1, comprising the following steps:
Step 201, according to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
Step 202, according to the wiring condition of the required electric network, the target topology of electric network wiring is constructed, it should
The node number of target topology and the node number of the initial primary topology are identical；
Step 203, initial node is determined according to the initial primary topology, target is determined according to the target topology
Node；
Step 204, using the neighborhood of nodes of the initial node as current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node；
Step 205, it using next neighborhood of nodes of the neighborhood of nodes as new current node, is calculated by heuristic search
Method determines the initial node to the shortest path between the current node, until the neighborhood of nodes is the target knot
Point；
Step 206, export the shortest path successively after all nodes.
Wherein, the node which successively passes through is the location point for needing grid switching operation.
Heuristic search algorithm is that the heuristic information that Utilizing question possesses comes guiding search direction, and it is complicated to reach reduction problem
The purpose of degree, currently, the searching algorithm is widely used in all trades and professions.In field of biomedicine, it is proposed that a kind of minority is harmonious
Searching algorithm, the algorithm instruct the search without marginal effect model using combination entropy as heuristic greedy method, to adapt to various diseases
Disease model；In unmanned plane field, it is proposed that a kind of stratification heuristic search based on gauss hybrid models, to region of search into
Row major sorts to obtain flight path；In network safety filed, it is proposed that a kind of meta-heuristic algorithms of biobjective scheduling, the calculation
Method has preferable effect to processing big data network security problem using precision and model complexity as two conflicting targets
Fruit.
In the generation method in above-mentioned grid switching operation path, opened up by the initial primary topology and target that construct electric network wiring
Structure is flutterred, both topological structures are compared, the different position of wiring state is decided, is then searched for by heuritic approach
The node of back brake is successively needed from initial wiring state to target wiring state, gets grid switching operation path automatically, and reduction is searched
Rope space, improves efficiency.
The step of initial primary topology of the building electric network wiring includes: in one of the embodiments,
The original state matrix for constructing electric network wiring, in the element representation electric network wiring in the original state matrix
The connection relationship of each node and branch；
The step of target topology of the building electric network wiring includes:
Construct the dbjective state matrix of electric network wiring, the row of the line number of the dbjective state matrix and the original state matrix
Number is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
Wherein, the row of the original state matrix indicates the number of nodes of the electric network wiring, the original state matrix
Column indicate the circuitry number of the electric network wiring.The row of the characterization of the row and column of dbjective state matrix and original state matrix with
Arrange it is identical, unlike electric network wiring state.
The initial node should be determined to the current node by heuristic search algorithm in one of the embodiments,
Between shortest path the step of include:
(1) calculates the initial node and reaches the step number between the current node by each branch according to the following formula
F (n)=g (n)+h (n) (1)；
Wherein, g (n) indicates the step number for reaching the current node n by a branch from the initial node, h (n) table
Show the step number still needed to away from current node n to the destination node；
The smallest branch of f (n) value is determined as shortest path.
Described determine that the initial node is worked as described in by heuristic search algorithm at this in one of the embodiments,
Before the step of shortest path between preceding node, this method further include:
It will be unsatisfactory for the node deletion of preset condition.
In one of the embodiments, the method also includes:
The node that the optimal path successively passes through is determined as to need the location point of grid switching operation.
The preset condition includes: in one of the embodiments,
Two bus current potentials for having branch connected are equal；And/or
The connected state of load bus and power supply node with preset it is identical.
The application proposes a kind of intelligent grid switching operation path generating method based on the search of heuristic constraint satisfaction, this method
It can be realized automatically generating for Substation Bus Arrangement grid switching operation sequence.Power transformation station owner is established by way of topological matrix first
Then the network topology structure of wiring excludes the scheme for being unsatisfactory for constraint condition by constraint condition.Then meeting condition
Heuristic function value is calculated in scheme, and is chosen the smallest scheme of heuristic function value and be constantly extended.
The process of the implementation method of the present embodiment is as follows:
One, the topological structure of electric network wiring is constructed
In real-time grid network wiring state, initial wiring condition is read, constructs n row m column matrix, referred to as original state square
Battle array, wherein n is nodal point number, and m is circuitry number；Matrix element represents the connection relationship of node and branch, and specific element meaning is as follows:
(1) element ' 0 ', which represents the node and branch, does not have any incidence relation；
(2) it is relevant with branch to represent the node for element ' 1 ', and the branch is connected at present；
(3) it is relevant with branch to represent the node for element ' -1 ', and the branch disconnects at present.
Determine target wiring condition, construction n row m column matrix, referred to as dbjective state matrix.
Initialize close_path table, open_path table and Voltage table, and representing the initial of network initial state
Node is added in close_path table.
Node: a kind of wiring state of network, i.e., a kind of wiring state matrix.
Node: predominantly bus, leading-out terminal and end of incoming cables.
Voltage table: for storing real time node current potential.
Close_path table: for storing the child node extended.The result of iteration
Open_path table: for storing the child node for waiting extension in next step, i.e., storage in next step can be with the knot of back brake
Point.
Two, suitable heuristic function is designed
Heuristic function uses classical field formalism:
F (n)=g (n)+h (n)
The child node that n is extended by current heuristic search is the matrix for indicating current wiring state.
F (n) is the calculating cost from start node to destination node.
G (n) be from start node to the actual cost of current node n, in the present embodiment, g (n) be from start node to
The step number of current node n；
H (n) is the estimate cost from current node n to destination node, in the present embodiment, obtains the method for h (n) value such as
Under:
(1) (wiring state) matrix element for comparing current node n (matrix of wiring state) and destination node, obtains
The different element position of element value in two matrixes.
(2) it counts the number that element value is different in two matrixes and represents current main electrical scheme to target main electrical scheme as h (n) value
The step number still needed to away.
Three, complete constraint condition is constructed
Wherein, constraint condition includes:
(1) two bus current potentials for having branch connected are answered equal；
(2) except undesired load bus has a power failure, otherwise the load bus cannot have a power failure, and guarantee load bus and power supply node
Connection；
(3) node of connection relationship is not had to be considered as no-voltage node with power supply node.
Four, using heuristic search algorithm, loop iteration, until finding path
Fig. 3 is the flow diagram of the generation method in grid switching operation path in another embodiment, according to the one of the present embodiment
Kind implementation method is as shown in figure 3, iterative process is as shown in Figure 3, comprising:
Step S301: building initial node.
Step S306: the child node that can be extended in this time search is successively traversed.
Step S303；Call constraint condition rejects the child node for the condition that is unsatisfactory for.
Step S304: calculating and updates the heuristic function value of all child nodes for meeting condition.
Step S305: open_path table is updated.If the child node in open_path table, gos to step
S306。
Step S306: compare stored to the sub- knot into the path of the child node and open_path in current path
The heuristic function value in the path of point retains wherein smaller path, and updates open_path table；If the child node does not exist
Open_path table then the child node is added in open_path table, using the smallest child node of heuristic function value as the layer
The child node for needing to extend in search is deleted from open_path table, and is added to close_path table.
Step S307: if the child node extended in step S306 is destination node, search has solution, obtains path side
Case stops search；If the child node extended in step S306 is not destination node, return step S302 is continued cycling through repeatedly
Generation.
The path of motion that finally output search obtains, the scheme as the heuristic search.
It should be appreciated that although each step in the flow chart of Fig. 2 and Fig. 3 is successively shown according to the instruction of arrow,
It is these steps is not that the inevitable sequence according to arrow instruction successively executes.Unless expressly stating otherwise herein, these steps
There is no stringent sequences to limit for rapid execution, these steps can execute in other order.Moreover, in Fig. 2 and Fig. 3 extremely
Few a part of step may include that perhaps these sub-steps of multiple stages or stage are not necessarily same to multiple sub-steps
Moment executes completion, but can execute at different times, and the execution sequence in these sub-steps or stage is also not necessarily
It successively carries out, but in turn or can be handed over at least part of the sub-step or stage of other steps or other steps
Alternately execute.
In one embodiment, as shown in figure 4, providing a kind of generating means 10 in grid switching operation path, the device packet
Include the first building module 11, second building module 12, node determining module 13, path determination module 14, iteration module 15 and defeated
Module 16 out, in which:
First building module 11 constructs the initial topology of electric network wiring for the current wiring condition according to electric network
Structure；
Second building module 12 constructs the target of electric network wiring for the wiring condition according to the required electric network
Topological structure, the node number of the target topology and the node number of the initial primary topology are identical；
Node determining module 13, for determining initial node according to the initial primary topology, according to the target topology
Structure determination destination node；
Path determination module 14, for being searched by heuristic using the neighborhood of nodes of the initial node as current node
Rope algorithm determines the initial node to the shortest path between the current node；
Iteration module 15, for passing through inspiration using next neighborhood of nodes of the neighborhood of nodes as new current node
Formula searching algorithm determines the initial node to the shortest path between the current node, until the neighborhood of nodes is described
Destination node；
Output module 16, for export the shortest path successively after all nodes.
Above-mentioned first building module 11 is specifically used for the original state of building electric network wiring in one of the embodiments,
Matrix, the connection relationship of each node and branch in the element representation electric network wiring in the original state matrix；Above-mentioned second
Construct the dbjective state matrix that module 12 is specifically used for building electric network wiring, the line number of the dbjective state matrix and the initial shape
The line number of state matrix is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
The iteration module 14 includes: in one of the embodiments,
Computing unit reaches institute by each branch for calculating the initial node according to formula f (n)=g (n)+h (n)
State the step number between current node, wherein g (n) indicates to reach the current node n from the initial node by a branch
Step number, h (n) indicates the step number that still needs to away from current node n to the destination node；
Path determining unit, for the smallest branch of f (n) value to be determined as shortest path.
The generating means 10 in the grid switching operation path in one of the embodiments, further include:
Removing module, for the node deletion of preset condition will to be unsatisfactory for.
The generating means 10 in the grid switching operation path in one of the embodiments, further include:
Location point determining module, the node for successively passing through the optimal path are determined as needing the position of grid switching operation
It sets a little.
The preset condition includes: in one of the embodiments,
Two bus current potentials for having branch connected are equal；And/or
The connected state of load bus and power supply node with preset it is identical.
The specific restriction of generating means about grid switching operation path may refer to above for grid switching operation path
The restriction of generation method, details are not described herein.Modules in the generating means in above-mentioned grid switching operation path can whole or portion
Divide and is realized by software, hardware and combinations thereof.Above-mentioned each module can be embedded in the form of hardware or independently of computer equipment
In processor in, can also be stored in a software form in the memory in computer equipment, in order to processor calling hold
The corresponding operation of the above modules of row.
In one embodiment, a kind of computer equipment is provided, which can be terminal, internal structure
Figure can be as shown in Figure 5.The computer equipment includes processor, the memory, network interface, display connected by system bus
Screen and input unit.Wherein, the processor of the computer equipment is for providing calculating and control ability.The computer equipment is deposited
Reservoir includes non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system and computer journey
Sequence.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The calculating
The network interface of machine equipment is used to communicate with external terminal by network connection.When the computer program is executed by processor with
Realize a kind of generation method in grid switching operation path.The display screen of the computer equipment can be liquid crystal display or electronic ink
Water display screen, the input unit of the computer equipment can be the touch layer covered on display screen, be also possible to computer equipment
Key, trace ball or the Trackpad being arranged on shell can also be external keyboard, Trackpad or mouse etc..
It will be understood by those skilled in the art that structure shown in Fig. 5, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, a kind of computer equipment is provided, including memory, processor and storage are on a memory
And the computer program that can be run on a processor, processor perform the steps of when executing computer program
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target are constructed
The node number of topological structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, the initial knot is determined by heuristic search algorithm
Point arrives the shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
In one embodiment, it is also performed the steps of when processor executes computer program
The original state matrix for constructing electric network wiring, in the element representation electric network wiring in the original state matrix
The connection relationship of each node and branch；
Construct the dbjective state matrix of electric network wiring, the row of the line number of the dbjective state matrix and the original state matrix
Number is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
In one embodiment, it is also performed the steps of when processor executes computer program
(1) calculates the initial node and reaches the step number between the current node by each branch according to the following formula
F (n)=g (n)+h (n) (1)；
Wherein, g (n) indicates the step number for reaching the current node n by a branch from the initial node, h (n) table
Show the step number still needed to away from current node n to the destination node；
The smallest branch of f (n) value is determined as shortest path.
In one embodiment, it is also performed the steps of when processor executes computer program
It will be unsatisfactory for the node deletion of preset condition.
In one embodiment, it is also performed the steps of when processor executes computer program
The node that the optimal path successively passes through is determined as to need the location point of grid switching operation.
In one embodiment, it is equal with two bus current potentials that the node has branch connected that the preset condition includes:；
And/or the node and the connected state of power junctions with preset it is identical.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target are constructed
The node number of topological structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, the initial knot is determined by heuristic search algorithm
Point arrives the shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, institute is determined by heuristic search algorithm
Initial node is stated to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
In one embodiment, it is also performed the steps of when computer program is executed by processor
The original state matrix for constructing electric network wiring, in the element representation electric network wiring in the original state matrix
The connection relationship of each node and branch；
Construct the dbjective state matrix of electric network wiring, the row of the line number of the dbjective state matrix and the original state matrix
Number is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
In one embodiment, it is also performed the steps of when computer program is executed by processor
(1) calculates the initial node and reaches the step number between the current node by each branch according to the following formula
F (n)=g (n)+h (n) (1)；
Wherein, g (n) indicates the step number for reaching the current node n by a branch from the initial node, h (n) table
Show the step number still needed to away from current node n to the destination node；
The smallest branch of f (n) value is determined as shortest path.
In one embodiment, it is also performed the steps of when computer program is executed by processor
It will be unsatisfactory for the node deletion of preset condition.
In one embodiment, it is also performed the steps of when computer program is executed by processor
The node that the optimal path successively passes through is determined as to need the location point of grid switching operation.
In one embodiment, it is equal with two bus current potentials that the node has branch connected that the preset condition includes:；
And/or the node and the connected state of power junctions with preset it is identical.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of generation method in grid switching operation path, which comprises
According to the current wiring condition of electric network, the initial primary topology of electric network wiring is constructed；
According to the wiring condition of the required electric network, the target topology of electric network wiring, the target topology are constructed
The node number of structure is identical as the node number of the initial primary topology；
Initial node is determined according to the initial primary topology, and destination node is determined according to the target topology；
Using the neighborhood of nodes of the initial node as current node, determine that the initial node arrives by heuristic search algorithm
Shortest path between the current node；
Using next neighborhood of nodes of the neighborhood of nodes as new current node, determined by heuristic search algorithm described first
Beginning node is to the shortest path between the current node, until the neighborhood of nodes is the destination node；
Export the shortest path successively after all nodes.
2. the method according to claim 1, wherein the step of the initial primary topology of the building electric network wiring
Suddenly include:
The original state matrix for constructing electric network wiring, in electric network wiring described in the element representation in the original state matrix
The connection relationship of each node and branch；
It is described building electric network wiring target topology the step of include:
Construct the dbjective state matrix of electric network wiring, the row of the line number of the dbjective state matrix and the original state matrix
Number is equal, and the dbjective state matrix column number is equal with the original state matrix column number.
3. the method according to claim 1, wherein described determine the initial knot by heuristic search algorithm
Point includes: to the step of shortest path between the current node
(1) calculates the initial node and reaches the step number between the current node by each branch according to the following formula
F (n)=g (n)+h (n) (1)；
Wherein, g (n) indicates to reach the step number of the current node n by a branch from the initial node, h (n) expression from
The step number that current node n is still needed to away to the destination node；
The smallest branch of f (n) value is determined as shortest path.
4. according to claim 1 to method described in 3 any one, which is characterized in that pass through heuristic search algorithm described
Before the step of determining the initial node to shortest path between the current node, the method also includes:
It will be unsatisfactory for the node deletion of preset condition.
5. according to the method described in claim 4, it is characterized in that, the preset condition includes:
Two bus current potentials for having branch connected are equal；And/or
The connected state of load bus and power supply node with preset it is identical.
6. according to claim 1 to method described in 3 any one, which is characterized in that the method also includes:
The node that the optimal path successively passes through is determined as to need the location point of grid switching operation.
7. a kind of generating means in grid switching operation path, which is characterized in that described device includes:
First building module constructs the initial primary topology of electric network wiring for the current wiring condition according to electric network；
Second building module constructs the target topology of electric network wiring for the wiring condition according to the required electric network
Structure, the node number of the target topology are identical as the node number of the initial primary topology；
Node determining module, it is true according to the target topology for determining initial node according to the initial primary topology
Set the goal node；
Path determination module, for passing through heuristic search algorithm using the neighborhood of nodes of the initial node as current node
Determine the initial node to the shortest path between the current node；
Iteration module, for passing through heuristic search using next neighborhood of nodes of the neighborhood of nodes as new current node
Algorithm determines the initial node to the shortest path between the current node, until the neighborhood of nodes is the target knot
Point；
Output module, for export the shortest path successively after all nodes.
8. device according to claim 7, which is characterized in that the iteration module includes:
Computing unit, for calculating the initial node by working as described in the arrival of each branch according to formula f (n)=g (n)+h (n)
Step number between preceding node, wherein g (n) indicates the step for reaching the current node n by a branch from the initial node
Number, h (n) indicate the step number still needed to away from current node n to the destination node；
Path determining unit, for the smallest branch of f (n) value to be determined as shortest path.
9. a kind of computer equipment including memory, processor and stores the meter that can be run on a memory and on a processor
Calculation machine program, which is characterized in that the processor realizes any one of claims 1 to 6 institute when executing the computer program
The step of stating method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 6 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811589301.7A CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811589301.7A CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109743252A true CN109743252A (en) | 2019-05-10 |
| CN109743252B CN109743252B (en) | 2021-08-31 |
Family
ID=66361201
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811589301.7A Active CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109743252B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111309989A (en) * | 2020-02-13 | 2020-06-19 | 平安科技（深圳）有限公司 | Graph database-based shortest path query method and related equipment |
| CN116613892A (en) * | 2023-07-18 | 2023-08-18 | 南方电网数字电网研究院有限公司 | Device incremental topology analysis method, device, computer device and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102420392A (en) * | 2011-07-30 | 2012-04-18 | 山东鲁能智能技术有限公司 | Transformer substation inspection robot global path planning method based on magnetic navigation |
| JP2012147271A (en) * | 2011-01-12 | 2012-08-02 | Nippon Telegr & Teleph Corp <Ntt> | Monitoring controller, communication route setting method, and program |
| CN103199521A (en) * | 2013-02-18 | 2013-07-10 | 天津市电力公司 | Power network planning construction method based on network reconstruction and optimized load-flow simulating calculation |
| CN105590145A (en) * | 2016-01-11 | 2016-05-18 | 北京交通大学 | Identification method and apparatus of shortest connecting distance between primary devices in substation |
| CN107437799A (en) * | 2016-05-27 | 2017-12-05 | 国家电网公司 | A kind of appraisal procedure for determining power network bulk transmission grid circuit |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
-
2018
- 2018-12-25 CN CN201811589301.7A patent/CN109743252B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2012147271A (en) * | 2011-01-12 | 2012-08-02 | Nippon Telegr & Teleph Corp <Ntt> | Monitoring controller, communication route setting method, and program |
| CN102420392A (en) * | 2011-07-30 | 2012-04-18 | 山东鲁能智能技术有限公司 | Transformer substation inspection robot global path planning method based on magnetic navigation |
| CN103199521A (en) * | 2013-02-18 | 2013-07-10 | 天津市电力公司 | Power network planning construction method based on network reconstruction and optimized load-flow simulating calculation |
| CN105590145A (en) * | 2016-01-11 | 2016-05-18 | 北京交通大学 | Identification method and apparatus of shortest connecting distance between primary devices in substation |
| CN107437799A (en) * | 2016-05-27 | 2017-12-05 | 国家电网公司 | A kind of appraisal procedure for determining power network bulk transmission grid circuit |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
Non-Patent Citations (1)
| Title |
|---|
| 陈晓玲，杨军，罗超，孙元章: "一种大电网潮流转移路径快速搜索方法", 《电网技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111309989A (en) * | 2020-02-13 | 2020-06-19 | 平安科技（深圳）有限公司 | Graph database-based shortest path query method and related equipment |
| CN116613892A (en) * | 2023-07-18 | 2023-08-18 | 南方电网数字电网研究院有限公司 | Device incremental topology analysis method, device, computer device and storage medium |
| CN116613892B (en) * | 2023-07-18 | 2024-02-27 | 南方电网数字电网研究院有限公司 | Device incremental topology analysis method, device, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109743252B (en) | 2021-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem | |
| Victoire et al. | Deterministically guided PSO for dynamic dispatch considering valve-point effect | |
| CN103189853A (en) | Method and apparatus for providing efficient context classification | |
| CN109743252A (en) | Generation method, device, computer equipment and the storage medium in grid switching operation path | |
| Lin et al. | Modified artificial bee colony algorithm for scheduling optimization for printed circuit board production | |
| Gomes et al. | Static transmission expansion planning using Heuristic and metaheuristic techniques | |
| CN109379195A (en) | Optimization method, device, equipment and the readable storage medium storing program for executing of zero-knowledge proof circuit | |
| CN115204612A (en) | Method, device, equipment and storage medium for determining carbon emission of power system | |
| CN110009161A (en) | Water supply forecast method and device | |
| Hongyun et al. | Multi-goal path planning algorithm for mobile robots in grid space | |
| Babaei et al. | A novel approach for real-time implementation of MVDC shipboard power system reconfiguration | |
| CN111190711B (en) | BDD combined heuristic A search multi-robot task allocation method | |
| CN116307336A (en) | Method and device for planning path of electricity exchanging and computer equipment | |
| Barabanov et al. | Data processing algorithm for parallel computing | |
| CN110555597A (en) | Method and device for generating scheduling operation command ticket of power equipment and computer equipment | |
| CN105335267A (en) | Server temperature prediction method, apparatus and system | |
| Ding et al. | Preserving languages and properties in stepwise refinement-based synthesis of Petri nets | |
| Li et al. | Power distribution network reconfiguration for bounded transient power loss | |
| CN108964107A (en) | A kind of modeling method and equipment of the DC control protection model based on RTDS | |
| CN113408779A (en) | Multi-target planning method and device for new energy collection network and computer equipment | |
| Shunmugalatha et al. | Maximum loadability limit of a power system using multiagent-based hybrid particle swarm optimization | |
| Parassuram et al. | A hybrid technique using particle swarm optimization and differential evolution to solve economic dispatch problem with valve-point effect | |
| Benidris et al. | Use of intelligent search methods in performing sensitivity analysis of power system reliability indices | |
| JP2008059146A (en) | Search device for state space and search method for state space | |
| CN110322073A (en) | Methods of electric load forecasting, device and equipment based on Recognition with Recurrent Neural Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200917 Address after: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Applicant after: Guangzhou Power Supply Bureau of Guangdong Power Grid Co.,Ltd. Address before: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Applicant before: GUANGZHOU POWER SUPPLY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |