CN112686633B - Intelligent ticket simulating method - Google Patents
Intelligent ticket simulating method Download PDFInfo
- Publication number
- CN112686633B CN112686633B CN202011610718.4A CN202011610718A CN112686633B CN 112686633 B CN112686633 B CN 112686633B CN 202011610718 A CN202011610718 A CN 202011610718A CN 112686633 B CN112686633 B CN 112686633B
- Authority
- CN
- China
- Prior art keywords
- index
- elements
- equipment
- level
- priority
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an intelligent ticket-drawing method, which comprises the following steps: s1: establishing a multi-stage index of a bus, a line, a branch line and a transformer of a substation; s2: establishing a plurality of index tables according to the multilevel indexes; s3: according to the multi-level indexes, eliminating redundant data; s4: realizing rapid storage according to the multi-level index; s5: generating thumbnails of the subsets; s6: dividing elements in the graph model into a plurality of classes, and setting each class of elements as different priorities; s7: and when the automatic ticket drawing conflict occurs, performing overlay processing according to the priority, and clearing the marks of the elements when the automatic ticket drawing is finished. The method comprises the steps of establishing a multi-level index of a bus-line-branch line-transformer of the substation, eliminating redundant numbers by a multi-level index method, realizing rapid storage, solving the problem of how to automatically generate a scheduling instruction ticket during the storage of a graph model bottom layer and data conflict and redundancy by a priority system when data conflict occurs.
Description
Technical Field
The invention relates to the technical field of power systems, in particular to an intelligent ticket-drawing method.
Background
The process of dispatching the instruction ticket comprises 5 links of ticket planning, ticket checking, ordering, executing and filing.
The graph simulation ticket refers to that in a ticket simulation link, required equipment or lines are manually selected in an equipment electrical contact topological graph, operation types are selected, work contents are imported, and a system automatically generates a scheduling instruction ticket. The basis of the current graph simulation ticket is that the graph model is correct, and one of the problems is that after the information and the data of the equipment and the contact relation thereof are collected and integrated, the formats of the data are not uniform, the contents conflict with each other, the system cannot be identified correctly like manual work, so that the drawing cannot be correctly performed, and the instruction ticket cannot be correctly generated; the conflict generally means that new and old contact relations coexist, the same device is named differently, and different devices are named identically. The graph model refers to a visual graph model, and the model refers to a node contact relation. Another problem is that the graph-model data provider is not aware of the user, and often provides data much larger than the required range, resulting in more and more useless data, and the system itself cannot recognize the useless garbage data, resulting in slow software loading or memory overflow. Current ticketing methods do not effectively address these issues.
For example, chinese patent CN102096856A, published 2011, 6.15, a method for generating a power generation work ticket sketch based on a power grid topology, includes the following steps: step 1: initializing parameters for generating a work ticket diagram; step 2: extracting the power grid topology, and creating a simplified topological structure which is convenient for generating a work ticket diagram; and step 3: and generating a work ticket diagram according to the simplified topological structure. The electric power production work ticket simplified diagram can be automatically generated by combining the business requirements and the generation rule of the work ticket simplified diagram, and the maintenance work of field maintenance personnel can be conveniently guided. But it does not consider the problem that the contents of the data to be voted conflict with each other and the useless data are too much to cause slow loading of software or overflow of memory.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the current ticket-drawing method cannot solve the technical problems of slow software loading or memory overflow caused by conflict of the contents of ticket-drawing data and excessive useless data. The intelligent ticket-drawing method can solve the problems of ticket-drawing data content conflict and excessive useless data.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows: an intelligent ticket drafting method comprises the following steps:
s1: establishing a multi-stage index of a substation bus, a line, a branch line and a transformer;
s2: establishing a plurality of index tables according to the multilevel indexes;
s3: according to the multi-level indexes, eliminating redundant data;
s4: realizing rapid storage according to the multi-level index;
s5: generating thumbnails of the subsets;
s6: dividing elements in the graph model into a plurality of classes, and setting each class of elements as different priorities;
s7: and when the automatic ticket drawing conflict occurs, performing overlay processing according to the priority, and clearing the marks of the elements when the automatic ticket drawing is finished. The method comprises the steps of establishing a multi-stage index of a substation bus-line-branch line-transformer, removing redundant numbers by the multi-stage index method, realizing rapid storage, dividing elements in a graph model into a plurality of types, setting each type of element as different priorities, solving the problem that a scheduling instruction ticket can be automatically generated when data conflict occurs due to the coexistence of new and old contact relations, different names of the same equipment or the same name of different equipment, and the like, and solving the problem that the scheduling instruction ticket can be automatically generated when the data conflict occurs in the bottom storage of the graph model and the data conflict and redundancy.
Preferably, the method of the multi-level index is as follows; naming a substation bus as a primary index; naming the line as a secondary index; naming the branch line as a three-level index; the transformer is named as a four-level index. The method comprises the steps of establishing a multi-level index of a bus, a line, a branch line and a transformer of the substation, and establishing a first-level index table, a second-level index table, a third-level index table and a fourth-level index table according to the multi-level index, wherein the index tables are one-dimensional arrays which are formed by a plurality of basic units and take data structures formed by names, set positions, numbers and null pointers as the basic units.
For the first-level index table, the basic unit is a data structure consisting of the name of a bus of the substation, the relative position of a line set capable of supplying power by the bus in the second-level index table, the number of lines in the line set and a pointer pointing to the data table; similarly, the second-level index table is a one-dimensional array formed by a plurality of basic units and a basic unit formed by pointers pointing to the data table, wherein the basic units are named by lines, the relative positions of branch line sets capable of supplying power to the lines in the third-level index table, the number of branch lines in the branch line sets, and the basic units; the three-level index table is a one-dimensional array formed by naming branch lines, the relative positions of transformer sets which can be supplied with power by the branch lines in the four-level index table, the number of the transformers in the transformer sets and pointers pointing to a data table, and a plurality of basic units; the four-level index table is a one-dimensional array formed by a plurality of basic units and a basic unit formed by pointers which are named by transformers and point to a data table.
Preferably, the step S3 includes the following steps:
s31: obtaining a substation managed by scheduling;
s32: according to the multi-level indexes of the bus-line-branch line-transformer of the substation, the main equipment and the common equipment, equipment of the substation, the first-level indexes of which are not managed by scheduling, is eliminated;
s33: and for the reserved equipment, generating a new incidence matrix according to the original incidence matrix. The method has the advantages that the useless data are quickly eliminated based on the multi-level indexes of the bus, the line, the branch line and the transformer of the substation, and the software is quickly loaded and operated.
Preferably, the method for rejecting redundant data in step S3 further includes rejecting redundant data according to a scheduling jurisdiction, and the method for rejecting redundant data according to a scheduling jurisdiction includes the following steps:
s34: obtaining a substation managed by scheduling;
s35: searching main equipment and common equipment from power transformation to load according to the incidence matrix provided by the model, and putting the main equipment and the common equipment into a set 1;
s36: clearing all elements except set 1;
s37: and generating a new incidence matrix or a linked list by the elements in the set 1 according to the original incidence matrix. The main equipment from power transformation to load and the ordinary equipment are searched according to the incidence matrix provided by the model, namely, the power supply range of the power transformation substation is searched according to the incidence matrix, wherein the main trunk in the main equipment refers to a bus, a line, a branch line, a transformer and the like of the power transformation substation, is used for transmitting a main loop of electric energy and is different from the load of the electric energy consumption. After the multi-level index is adopted, the system records a main loop, switching equipment connected in series with the main loop and load equipment connected in parallel with the main loop according to a tree form, so that the memory of a power grid is formed, the quick storage and the quick elimination of useless data can be performed, the redundant data is eliminated according to the scheduling jurisdiction, and the scheduling jurisdiction can be obtained, so that the useful and useless equipment and information thereof can be identified, and the problems of slow software operation and overflow of a memory caused by overload are prevented.
Preferably, the step S4 includes the following steps:
s41: judging the device type according to the identifier, judging whether the device type is a trunk device, if so, entering step S44, otherwise, entering step S42;
s42: analyzing the contact relation of the newly added equipment according to the graph model to obtain trunk equipment in contact with the newly added equipment, and copying the multistage index of the trunk equipment as the index of the newly added equipment;
s43: searching an index table according to the index of the newly added equipment, and adding the newly added equipment into an equipment list pointed by the index table null pointer;
s44: analyzing the contact relation of the newly added equipment according to the graph model to obtain trunk equipment in contact with the newly added equipment, and copying the multistage index of the trunk equipment as the index of the newly added equipment;
s45: updating the index table: and searching an index table according to the index of the newly added equipment, adding the index table into the equipment set appointed by the index, and adding the newly added equipment into an equipment list pointed by the null pointer of the index table. The method comprises the following steps of judging whether the device type is different processing of the trunk device or not, wherein the two processing modes are divided into two processing modes, the same preprocessing step of the two modes is to obtain the trunk device which is in contact with the trunk device, then copy the multistage index of the trunk device, use the multistage index as the index of the newly added device, if the device type is the trunk device, search the index table according to the index of the newly added device, add the newly added device into a device list pointed by an empty pointer of the index table, and if the device type is not the trunk device, update the index table: and searching the index table according to the index of the newly added equipment, adding the index table into the equipment set appointed by the index, and adding the newly added equipment into an equipment list pointed by the null pointer of the index table, so that the index table is convenient to store quickly.
Preferably, the generation of the thumbnail in step S5 includes the following steps:
s51: traversing the elements in the subset, finding out an element composition set 1 with the highest index value by using a bubble algorithm, and forming an element with the second highest index value into a set 2;
s52: in the original incidence matrix, the highest and second-level nodes corresponding to the index table are reserved, and the rest nodes are deleted to generate a new incidence matrix. The next highest index value is the highest element except the element with the highest index value, and the actual graph model is that a plurality of graphs store a plurality of different devices and contact relations thereof and is recorded in the form of subsets, so that thumbnails need to be generated on the graphs, namely the subsets. The index value is that the named level of a bus of a substation is 1, the named level of the bus of the substation-the named level of a line is 2, the named level of the bus of the substation-the named line-the named level of a branch line is 3, the named level of the bus of the substation-the named line-the named branch line-the named level of a transformer is 4, the highest level is 1, the lowest level is 4, and the level 1 is more than the level 2 and more than the level 3 and more than the level 4; each node in the incidence matrix corresponds to each element in the subset.
Preferably, the step S6 includes the following steps:
s61: marking the display area and the manually clicked elements as first-class elements, and marking the priority as 0;
s62: setting all switches to be in a closed conducting state, searching in the incidence matrix by taking elements of the first class of graphs as starting points and power supply points with the same voltage level as end points, marking the elements of the same electrical node as second class elements, marking the priority as 1, and setting the priority level of the 1 level to be lower than the priority level of the 0 level;
s63: in the opened and not shown graph model, marking the elements which are not marked as the first class and not marked as the second class as elements of a third class, and marking the elements with the priority as 2, wherein the priority level of the 2 is lower than the priority level of the 1;
s64: and marking the unmarked elements in the graph model as elements of a fourth type, and marking the priority as 3, wherein the priority level of 3 is lower than the priority level of 2. And classifying the elements in the graph model according to a classification algorithm, wherein each class has different priorities, four classes of the priorities are respectively 0, 1, 2 and 3, the 0 class is the highest, and the 3 class is the lowest, wherein the elements of the first class of graphs are used as starting points, power supply points with the same voltage class are used as end points, searching is carried out in the incidence matrix, the elements of the same electrical node are marked as second class elements, and namely equipment or lines from the first class of graphs to the secondary side of the transformer are in the second class.
Preferably, the step S7 includes the following steps:
s71: judging whether graph-mode conflict occurs, if so, entering step S72, otherwise, entering step S74;
s72: judging whether the same named elements exist in the conflicting graph models, if so, taking the topology of the high-priority element as the standard, and if not, entering the step S73;
s73: checking the topology consistency, judging whether the two image topologies are consistent, if so, naming the elements with low priority to be covered by the elements with high priority in the topology, otherwise, not covering;
s74: and (5) finishing the automatic ticket drawing and clearing the mark of the element. The graph mode conflict problem is solved by setting a priority, wherein if the graph modes in conflict are associated by a chain pointer and are in the relationship between a root graph and a subgraph, the upper layer topology in the subgraph is considered to be consistent with the root graph, and the consistency of the topologies of the two graphs is checked, for example, if the upper layer topology in the subgraph is consistent with the corresponding node association matrixes of the root graph, namely, A and B, and if A is not equal to B but TAE = B and T | =1 and E | =1, the topologies of the two graphs are considered to be still consistent due to conflict, and the elements with high priority in the topology are named to cover the elements with low priority.
The substantial effects of the invention are as follows: the method comprises the steps of establishing a multilevel index of a bus-line-branch line-transformer of a substation, eliminating redundant numbers by a multilevel index method, realizing rapid storage, dividing elements in a graph model into a plurality of types, setting each type of element as different priorities, solving the problem of automatic generation of a scheduling instruction ticket when data conflicts occur due to the coexistence of new and old contact relations, different names of the same equipment or the same name of different equipment through a priority system, automatically generating the scheduling instruction ticket by the method, and solving the problems of automatic generation of the scheduling instruction ticket when the bottom layer of the graph model is stored, and data conflicts and redundancies.
Drawings
Fig. 1 is a schematic flow chart of the present embodiment.
Fig. 2 is a structure diagram of the multi-level index data in the present embodiment.
Fig. 3 is a simplified diagram of a primary wiring of the present embodiment.
Fig. 4 is a diagram illustrating the priorities of the present embodiment.
Fig. 5 is a schematic diagram of the embodiment.
Detailed Description
The following provides a more detailed description of the present invention, with reference to the accompanying drawings.
An intelligent ticket booking method, as shown in fig. 1, includes the following steps:
s1: establishing a multi-stage index of a substation bus, a line, a branch line and a transformer; the method of the multi-level index is as follows; naming a substation bus as a primary index; naming the line as a secondary index; naming the branch line as a three-level index; the transformer is named as a four-level index. The method comprises the steps of establishing a multi-level index of a bus, a line, a branch line and a transformer of the substation, and establishing a first-level index table, a second-level index table, a third-level index table and a fourth-level index table according to the multi-level index, wherein the index tables are one-dimensional arrays which are formed by a plurality of basic units and take data structures formed by names, set positions, numbers and null pointers as the basic units. For the first-level index table, the basic unit is a data structure consisting of the name of a bus of the substation, the relative position of a line set capable of supplying power by the bus in the second-level index table, the number of lines in the line set and a pointer pointing to the data table; similarly, the second-level index table is a one-dimensional array formed by a plurality of basic units and a basic unit formed by pointers pointing to the data table, wherein the basic units are named by lines, the relative positions of branch line sets capable of supplying power to the lines in the third-level index table, the number of branch lines in the branch line sets, and the basic units; the three-level index table is a one-dimensional array formed by naming branch lines, the relative positions of transformer sets which can be supplied with power by the branch lines in the four-level index table, the number of the transformers in the transformer sets and pointers pointing to a data table, and a plurality of basic units; the four-level index table is a one-dimensional array formed by a plurality of basic units and a basic unit formed by pointers which are named by transformers and point to a data table.
S2: establishing a plurality of index tables according to the multilevel indexes;
s3: according to the multi-level indexes, removing redundant data; the step S3 includes the following steps:
s31: obtaining a substation managed by scheduling;
s32: according to the multi-level indexes of the bus-line-branch line-transformer of the substation, the main equipment and the common equipment, equipment of the substation, the first-level indexes of which are not managed by scheduling, is eliminated;
s33: and for the reserved equipment, generating a new incidence matrix according to the original incidence matrix. The method has the advantages that the useless data are quickly eliminated based on the multi-level indexes of the bus, the line, the branch line and the transformer of the substation, and the software is quickly loaded and operated. The method for eliminating redundant data in step S3 further includes eliminating redundant data according to a scheduling jurisdiction, and the method for eliminating redundant data according to a scheduling jurisdiction includes the following steps:
s34: obtaining a substation managed by scheduling;
s35: searching for main equipment and common equipment from power transformation to load according to the incidence matrix provided by the model, and putting the main equipment and the common equipment into a set 1;
s36: clearing all elements except set 1;
s37: and generating a new incidence matrix or a linked list by the elements in the set 1 according to the original incidence matrix. The main equipment from power transformation to load and the ordinary equipment are searched according to the incidence matrix provided by the model, namely, the power supply range of the power transformation substation is searched according to the incidence matrix, wherein the main trunk in the main equipment refers to a bus, a line, a branch line, a transformer and the like of the power transformation substation, is used for transmitting a main loop of electric energy and is different from the load of the electric energy consumption. After the multilevel index is adopted, the system records a trunk loop, switching equipment connected in series with the trunk and load equipment connected in parallel with the trunk according to the tree shape, so that memory of a power grid is formed, rapid storage and rapid elimination of useless data can be performed, redundant data is eliminated according to a scheduling jurisdiction, and the scheduling jurisdiction can be obtained, so that useful and useless equipment and information thereof are identified, and the problems of slow software operation and overflow of a memory caused by overload are prevented.
S4: realizing rapid storage according to the multi-level index; the step S4 includes the following steps:
s41: judging the device type according to the identifier, judging whether the device type is a trunk device, if so, entering step S44, otherwise, entering step S42;
s42: analyzing the contact relation of the newly added equipment according to the graph model to obtain main equipment in contact with the newly added equipment, and copying the multistage index of the main equipment as the index of the newly added equipment;
s43: searching an index table according to the index of the newly added equipment, and adding the newly added equipment into an equipment list pointed by the index table null pointer;
s44: analyzing the contact relation of the newly added equipment according to the graph model to obtain trunk equipment in contact with the newly added equipment, and copying the multistage index of the trunk equipment as the index of the newly added equipment;
s45: updating the index table: and searching an index table according to the index of the newly added equipment, adding the index table into the equipment set appointed by the index, and adding the newly added equipment into an equipment list pointed by the null pointer of the index table. The method comprises the following steps of judging whether the device type is different processing of the trunk device, dividing the processing into two processing modes, obtaining the trunk device which is in contact with the device in the same pre-processing step of the two modes, copying a multi-level index of the trunk device to be used as an index of the newly-added device, if the device type is the trunk device, searching an index table according to the index of the newly-added device, adding the newly-added device into a device list pointed by an empty pointer of the index table, and if the device type is not the trunk device, updating the index table: and searching the index table according to the index of the newly added equipment, adding the index table into the equipment set appointed by the index, and adding the newly added equipment into an equipment list pointed by the null pointer of the index table, so that the index table is convenient to store quickly.
S5: generating thumbnails of the subsets; the generation of the thumbnail in the step S5 includes the following steps:
s51: traversing the elements in the subset, finding out an element composition set 1 with the highest index value by using a bubble algorithm, and forming an element with the second highest index value into a set 2;
s52: in the original incidence matrix, the highest and second-level nodes corresponding to the index table are reserved, and the rest nodes are deleted to generate a new incidence matrix. The next highest index value is the highest element except the element with the highest index value, and the actual graph model is that a plurality of graphs store a plurality of different devices and contact relations thereof and is recorded in the form of subsets, so that thumbnails need to be generated on the graphs, namely the subsets. The index value is that the named level of a bus of a substation is 1, the named level of the bus of the substation-the named level of a line is 2, the named level of the bus of the substation-the named line-the named level of a branch line is 3, the named level of the bus of the substation-the named line-the named branch line-the named level of a transformer is 4, the highest level is 1, the lowest level is 4, and the level 1 is more than the level 2 and more than the level 3 and more than the level 4; each node in the incidence matrix corresponds to each element in the subset.
S6: the elements in the graph model are divided into a plurality of classes, and each class of elements is set to different priorities. The method comprises the steps of establishing a multilevel index of a bus-line-branch line-transformer of a substation, eliminating redundant numbers by a multilevel index method, realizing rapid storage, dividing elements in a graph model into a plurality of types, setting each type of element as different priorities, solving the problem of automatic generation of a scheduling instruction ticket when data conflicts occur due to the coexistence of new and old contact relations, different names of the same equipment or the same name of different equipment through a priority system, automatically generating the scheduling instruction ticket by the method, and solving the problems of automatic generation of the scheduling instruction ticket when the bottom layer of the graph model is stored, and data conflicts and redundancies. The step S6 includes the following steps:
s61: marking the display area and the manually clicked elements as first-class elements, and marking the priority as 0;
s62: setting all switches to be in a closed conducting state, searching in the incidence matrix by taking elements of the first class of graphs as starting points and power supply points with the same voltage level as end points, marking the elements of the same electrical node as second class elements, marking the priority as 1, and setting the priority level of the 1 level to be lower than the priority level of the 0 level;
s63: in the opened and not shown graph model, marking the elements which are not marked as the first class and not marked as the second class as elements of a third class, and marking the elements with the priority as 2, wherein the priority level of the 2 is lower than the priority level of the 1;
s64: and marking the unmarked elements in the graph model as the fourth type elements, wherein the priority is marked as 3, and the priority level of the 3 is lower than the priority level of the 2. And classifying the elements in the graph model according to a classification algorithm, wherein each class has different priorities, four classes of the priorities are respectively 0, 1, 2 and 3, the 0 class is the highest, and the 3 class is the lowest, wherein the elements of the first class of graphs are used as starting points, power supply points with the same voltage class are used as end points, searching is carried out in the incidence matrix, the elements of the same electrical node are marked as second class elements, and namely equipment or lines from the first class of graphs to the secondary side of the transformer are in the second class.
S7: and when the automatic ticket drawing conflict occurs, performing overlay processing according to the priority, and clearing the marks of the elements when the automatic ticket drawing is finished. The step S7 includes the following steps:
s71: judging whether graph-mode conflict occurs, if so, entering step S72, otherwise, entering step S74;
s72: judging whether the same named elements exist in the conflicting graph models, if so, taking the topology of the high-priority element as the standard, and if not, entering the step S73;
s73: checking the topology consistency, judging whether the two image topologies are consistent, if so, naming the elements with low priority to be covered by the elements with high priority in the topology, otherwise, not covering;
s74: and (5) finishing the automatic ticket drawing and clearing the mark of the element. The graph mode conflict problem is solved by setting a priority, wherein if the graph modes in conflict are associated by a chain pointer and are in the relationship between a root graph and a subgraph, the upper layer topology in the subgraph is considered to be consistent with the root graph, and the consistency of the topologies of the two graphs is checked, for example, if the upper layer topology in the subgraph is consistent with the corresponding node association matrixes of the root graph, namely, A and B, and if A is not equal to B but TAE = B and T | =1 and E | =1, the topologies of the two graphs are considered to be still consistent due to conflict, and the elements with high priority in the topology are named to cover the elements with low priority.
In fig. 2, the index table is a one-dimensional array formed by a plurality of basic units and a data structure formed by naming, set positions, numbers and null pointers as the basic units. For the first-level index table, the basic units are names of buses of the substation, relative positions of line sets capable of supplying power to the buses in the second-level index table and line numbers in the line sets, and data structures consisting of pointers pointing to a data table, the data table records an information table header of equipment and contact relations connected to the buses, the table header is added with index values of multi-level indexes, the index values refer to name values of buses of the substation where the empty pointers of the data table are located, similarly, the second-level index table is named of lines, relative positions of branch line sets capable of supplying power to the lines in the third-level index table and branch line numbers in the branch line sets, and basic units consisting of pointers pointing to the data table, one-dimensional arrays arranged by a plurality of basic units, the third-level index table is named of branch lines, relative positions of transformer sets capable of supplying power to the branch lines in the fourth-level index table and the number of transformers in the transformer sets, the four-level index table is a basic unit formed by pointers pointing to the data table named by the transformer, and a one-dimensional array formed by arranging a plurality of basic units.
In fig. 3, a substation a10kV bus is connected to a substation B10 kV bus through a line 1 and a line 2, a transformer 1 is connected to the line 1 through a branch line 1, and a transformer 2 is connected to the line 2 through a branch line 2. The index is built for FIG. 3 as follows:
step 1: obtaining lines capable of supplying power to a substation bus, wherein the A10kV bus power supply line of the substation is line 1 and line 2 to form a line set { line 1 and line 2}, the number of the lines is 2, and similarly, obtaining a B10 kV bus power supply line set { line 3 and line 4} of the substation, and the number of the lines is 2.
Step 2: establishing a first-level index table, wherein the first-level index table is provided with 2 units, the four elements of the first unit are the name of an A10kV bus of a substation, the position of a line set, the number of lines of the line set to be 2 and null pointers; the four elements of the second unit are the name of a B10 kV bus of the substation, the position of a line set, the number of lines of the line set to be 2 and null pointers;
and 3, step 3: and performing topology analysis to obtain a branch line set supplied with power by the line, wherein the branch line set supplied with power by the line 1 is { branch line 1}, the number of the branch lines is 1, and similarly, the branch line sets supplied with power by other lines are obtained.
And 4, step 4: establishing a second-level index table, wherein the second-level index table is provided with 2 units, the four elements of the first unit are line 1 names, the positions of branch line sets in the third-level index table, the number of the branch lines of the branch line sets is 2, and null pointers are arranged; the four elements of the second unit are line 2 naming, the position of the branch line set in the three-level index table, the number of the branch lines of the branch line set is 2, and the null pointer
And 5: performing topology analysis, and establishing a three-level index table, wherein the three-level index table is provided with 2 units, four elements of a first unit are the naming of a branch line 1, the position of a transformer set in a four-level index table, the number of transformers of the transformer set is 2, and a null pointer; the four elements of the second unit are the name of a branch line 2, the position of a transformer set in a four-level index table, the number of the transformers of the transformer set is 2, and a null pointer
Step 6: establishing a four-level index table, wherein the four-level index table is provided with 2 units, and four elements of a first unit are named and null pointers of a transformer 1; the second unit has four elements of a naming and null pointer of the transformer 2
And 7: each equipment is added with an index value attribute which is a multi-level index, the index value of the multi-level index of the equipment connected with the bus is named for the bus of the substation, if the same named line is the equipment connected with the line, the index value of the multi-level index is named for the bus of the substation-line naming, the equipment connected with the branch line is named for the bus-line naming-branch line, the equipment connected with the transformer is named for the bus-line naming-branch line, and the index value of the multi-level index of the equipment is named for the bus-line naming-branch line-naming-transformer naming; the obtained line 1 index value is named as a bus of a substation A10kV, the line 1 index value is named as a bus of a substation A10kV, the line 2 index value is named as a bus of a substation A10kV, the transformer 1 index value is named as a bus of a substation A10kV, the line 1 index value is named as a branch line 1, the transformer 1 index value is named as a branch line 1, and the transformer 2 index value is named as a bus of a substation A10kV, the line 2 index value is named as a branch line 2, and the transformer 2 index value is named as a branch line 2.
And 8: the contact relation between the common equipment and the trunk equipment is obtained through topology analysis, the equipment in contact with the same trunk equipment is combined into a set, namely an equipment set, and the data storage position of the equipment set is transmitted to the null pointer attribute of the multilevel index table of the corresponding trunk equipment.
In fig. 4, line 3 is connected in parallel with line 4 and then connected in series with line 2, both ends of line 1 are bridged over the bus of substation a and the bus of substation B, and both ends of line 3 are bridged over the bus of substation a and the bus of substation B. The thumbnail generation algorithm comprises the following steps:
step 1: traversing the elements in the subset, and finding out the elements with the highest index value by using a bubble algorithm to form a set 1, wherein the set 1 is { a substation A bus and a substation B bus }, the next highest element forms a set 2, and the set 2 is { a line 1, a line 2, a line 3 and a line 4 };
step 2: in the incidence matrix of the original contact relation, the highest and second-order elements corresponding to the index table are reserved, the rest elements are deleted, and a new contact relation is generated, so that the new contact relation only comprises a substation A bus, a substation B bus, a line 1, a line 2, a line 3 and a line 4.
In fig. 5, the middle section of line 1, switch 2 and middle section of line 2 are in the display area, and the whole lines of line 1 and line 2 are in the area of the second type except the display area. The elements in the graph model are classified and marked according to the priority, and the high priority is used as the standard when in conflict, and the high priority covers the first priority; the four levels of the priority are 0, 1, 2 and 3 levels respectively, 0 is the highest, 3 is the lowest, the elements in the graph model are classified according to a classification algorithm, each class has different priorities, and the classification algorithm is characterized by comprising the following steps:
step 1: entering an automatic ticket-making link;
step 2: displaying the elements which are manually clicked in the area, marking the first type of elements, and recording the priority as 0; the first type elements are line 1 mid-section, switch 2 and line 2 mid-section.
And step 3: setting all switches to be in a closed conducting state, taking elements of a first type of graph as a starting point, taking a power supply point with the same voltage level as an end point, searching in the incidence matrix, marking the elements of the same electrical node as a second type, and marking the priority as 1, namely, equipment or lines from the first type of graph to the secondary side of the transformer are in the second type, and the priority is 1; the second category is the full line of line 1 and line 2 except the first category.
And 4, step 4: in the graph simulation ticket software, in an opened but not displayed graph model, elements which are not marked as a second type or a first type are marked, the rest elements are marked as a third type, and the priority is marked as 2;
and 5: except the first three types, the remaining elements are not marked, and then the elements are classified into a fourth type, and the priority of the fourth type is 3.
Step 6: in the automatic ticket drawing link, topology analysis is carried out, when the graphs and the models conflict, the step 7 is carried out, and otherwise, the step 9 is carried out;
and 7: if the conflicting graph models have the same named elements, the topology of the high-priority elements is taken as the standard; otherwise, entering step 7;
and step 8: if the graph mode of the conflict is associated by a chain pointer and is the relationship between the root graph and the sub-graph, the upper-layer topology in the sub-graph is considered to be consistent with the root graph, and the consistency of the topologies of the two graphs is checked, for example, if the upper-layer topology in the sub-graph and the corresponding node incidence matrix of the root graph are A and B, if A is not equal to B but TAE = B and | T | =1 and | E | =1 due to the conflict, the topologies of the two graphs are considered to be still consistent, and the element with high priority in the topology is named to cover the element with low priority;
and step 9: and (5) finishing the automatic ticket drawing and clearing the mark of the element.
The above examples only show some embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that various changes and modifications can be made by those skilled in the art without departing from the spirit of the invention, and these changes and modifications are all within the scope of the invention.
Claims (7)
1. An intelligent ticket drafting method is characterized by comprising the following steps:
s1: establishing a multi-stage index of a bus, a line, a branch line and a transformer of a substation;
s2: establishing a plurality of index tables according to the multilevel indexes;
s3: according to the multi-level indexes, eliminating redundant data;
s4: realizing rapid storage according to the multi-level index;
s5: generating thumbnails of the subsets;
s6: dividing elements in the graph model into a plurality of classes, and setting each class of elements as different priorities;
s7: when the automatic ticket drawing conflict occurs, performing covering processing according to the priority, and clearing the marks of the elements when the automatic ticket drawing is finished; the method for eliminating redundant data in step S3 further includes eliminating redundant data according to a scheduling jurisdiction, and the method for eliminating redundant data according to a scheduling jurisdiction includes the following steps:
s34: obtaining a substation managed by scheduling;
s35: searching main equipment and common equipment from power transformation to load according to the incidence matrix provided by the model, and putting the main equipment and the common equipment into a set 1;
s36: clearing all elements except set 1;
s37: and generating a new incidence matrix or a linked list by the elements in the set 1 according to the original incidence matrix.
2. The intelligent ticket-booking method of claim 1, wherein the multi-level indexing method is; naming a substation bus as a primary index; naming the line as a secondary index; naming the branch line as a three-level index; the transformer is named as a four-level index.
3. The intelligent ticket booking method of claim 2, wherein the step S3 comprises the steps of:
s31: obtaining a substation managed by scheduling;
s32: according to the multi-level indexes of the bus-line-branch line-transformer of the substation, the main equipment and the common equipment, equipment of the substation, the first-level indexes of which are not managed by scheduling, is eliminated;
s33: and for the reserved equipment, generating a new incidence matrix according to the original incidence matrix.
4. The intelligent ticket booking method of claim 1 or 3, wherein the step S4 comprises the steps of:
s41: judging the device type according to the identifier, judging whether the device type is a trunk device, if so, entering a step S44, and if not, entering a step S42;
s42: analyzing the contact relation of the newly added equipment according to the graph model to obtain trunk equipment in contact with the newly added equipment, and copying the multistage index of the trunk equipment as the index of the newly added equipment;
s43: searching an index table according to the index of the newly added equipment, and adding the newly added equipment into an equipment list pointed by the index table null pointer;
s44: analyzing the contact relation of the newly added equipment according to the graph model to obtain trunk equipment in contact with the newly added equipment, and copying the multistage index of the trunk equipment as the index of the newly added equipment;
s45: updating an index table: and searching an index table according to the index of the newly added equipment, adding the index table into the equipment set appointed by the index, and adding the newly added equipment into an equipment list pointed by the null pointer of the index table.
5. An intelligent ticket booking method as claimed in claim 1 or 3, wherein the generation of the thumbnail in step S5 comprises the following steps:
s51: traversing the elements in the subset, finding out an element composition set 1 with the highest index value by using a bubble algorithm, and forming an element with the second highest index value into a set 2;
s52: in the original incidence matrix, the highest and second-level nodes corresponding to the index table are reserved, and the rest nodes are deleted to generate a new incidence matrix.
6. The intelligent ticket booking method of claim 1, wherein the step S6 comprises the steps of:
s61: marking the display area and the manually clicked elements as first-class elements, and marking the priority as 0;
s62: setting all switches to be in a closed conducting state, taking elements of a first class of graphs as a starting point, taking power supply points with the same voltage level as an end point, searching in an incidence matrix, marking the elements of the same electrical node as second class elements, marking the priority as 1, and setting the priority level of the 1 level to be lower than the priority level of the 0 level;
s63: in the opened and not shown graph model, marking the elements which are not marked as the first class and not marked as the second class as elements of a third class, and marking the elements with the priority as 2, wherein the priority level of the 2 is lower than the priority level of the 1;
s64: and marking the unmarked elements in the graph model as the fourth type elements, wherein the priority is marked as 3, and the priority level of the 3 is lower than the priority level of the 2.
7. The intelligent ticket drafting method as claimed in claim 6, wherein said step S7 comprises the following steps:
s71: judging whether the graph-model conflict occurs, if so, entering step S72, otherwise, entering step S74;
s72: judging whether the same named elements exist in the conflicting graph models, if so, taking the topology of the high-priority element as the standard, and if not, entering the step S73;
s73: checking topology consistency, judging whether the two image topologies are consistent, if so, naming the elements with high priority in the topology to cover the elements with low priority, and if not, not covering;
s74: and (5) finishing the automatic ticket drawing and clearing the mark of the element.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011610718.4A CN112686633B (en) | 2020-12-30 | 2020-12-30 | Intelligent ticket simulating method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011610718.4A CN112686633B (en) | 2020-12-30 | 2020-12-30 | Intelligent ticket simulating method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112686633A CN112686633A (en) | 2021-04-20 |
| CN112686633B true CN112686633B (en) | 2022-07-01 |
Family
ID=75455087
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011610718.4A Active CN112686633B (en) | 2020-12-30 | 2020-12-30 | Intelligent ticket simulating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112686633B (en) |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5043820B2 (en) * | 2005-03-11 | 2012-10-10 | ロックソフト リミテッド | How to index on low redundancy storage systems |
| CN101923346B (en) * | 2010-05-19 | 2013-02-13 | 广东电网公司电力科学研究院 | Method and system for automatically generating anti-sabotage, anti-blocking, water irrigation, breathing, fire burning logic rules of substation |
| CN103077479B (en) * | 2013-01-04 | 2015-01-21 | 湖州电力局 | Method for temporarily changing electric network topology structure in pattern dispatching operation ticket system |
| US10366065B2 (en) * | 2016-04-29 | 2019-07-30 | Netapp, Inc. | Memory efficient lookup structure |
| CN109523240A (en) * | 2018-11-30 | 2019-03-26 | 国电南瑞科技股份有限公司 | Intelligent substation billing system and method |
| CN111651423A (en) * | 2020-03-04 | 2020-09-11 | 国家电网公司 | Distributed memory-oriented security index system and method |
-
2020
- 2020-12-30 CN CN202011610718.4A patent/CN112686633B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112686633A (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2023115842A1 (en) | Data-driven offline and online integrated simulation system and method for power distribution network | |
| CN113553420B (en) | Power grid fault processing rule recommendation method and system based on knowledge graph | |
| CN106650161B (en) | Electrical single line diagram mapping method and system based on power grid GIS | |
| WO2016000341A1 (en) | Method and system for searching cross-regional power supply range based on cim model | |
| CN101930481B (en) | Method used for generating CIM model describing power grid change in designated time slot and system thereof | |
| CN107565562B (en) | Power system topology layered identification method based on island search technology | |
| CN107292003A (en) | A kind of automatic generating method of electric network station wiring diagram | |
| CN102403718B (en) | Generating method for power grid topological relationship based on Arcgis | |
| CN109857885B (en) | Intelligent substation main wiring diagram automatic generation method based on SCD file | |
| CN108206522B (en) | Power equipment state monitoring method and system | |
| CN112685570B (en) | Multi-label graph-based power grid network frame knowledge graph construction method | |
| CN110046391A (en) | Transforming plant primary wiring diagram automatic generation method based on monitoring information table | |
| CN112966385A (en) | Method and system for identifying topology weak points of power distribution network frame | |
| CN109830954B (en) | Topology hierarchical identification method suitable for automatic generation of power grid visual simulation model | |
| CN109271350B (en) | Database and information point table automatic comparison and synchronization method based on telecontrol communication | |
| CN107944659A (en) | A kind of substation supervisory control system auto report completing method and apparatus | |
| CN113570345A (en) | Power failure range automatic identification system based on construction project circuit diagram | |
| CN112686633B (en) | Intelligent ticket simulating method | |
| CN115579885B (en) | Power grid topology analysis method and device | |
| CN116841985A (en) | Method, system and device for building plant model topology | |
| CN115827885A (en) | Operation and maintenance knowledge graph construction method and device and electronic equipment | |
| CN115599897A (en) | Power distribution network equipment intelligent question-answering system construction method and system based on knowledge graph | |
| CN115658642A (en) | Data processing method based on power grid resource data | |
| CN113158392A (en) | Power distribution graphical monitoring and computing system | |
| CN112131432A (en) | Method and device for acquiring command line multi-way tree of data network equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |