CN114218900B - 110kV and below transformer substation operation ticket filling method, system, device and medium - Google Patents
110kV and below transformer substation operation ticket filling method, system, device and medium Download PDFInfo
- Publication number
- CN114218900B CN114218900B CN202111592631.3A CN202111592631A CN114218900B CN 114218900 B CN114218900 B CN 114218900B CN 202111592631 A CN202111592631 A CN 202111592631A CN 114218900 B CN114218900 B CN 114218900B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- binary tree
- command
- instruction
- judging whether
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 19
- 238000003860 storage Methods 0.000 claims description 7
- 238000000605 extraction Methods 0.000 claims description 3
- 238000005429 filling process Methods 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/174—Form filling; Merging
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- General Health & Medical Sciences (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Artificial Intelligence (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Computational Linguistics (AREA)
- Development Economics (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method, a system, a device and a medium for filling operation tickets of 110kV and below transformer substations, which are used for acquiring a dispatching order to generate a dispatching order queue List; wherein the scheduling order queue List comprises a plurality of scheduling orders; based on the content of the scheduling instruction, matching an instruction module corresponding to the content for the scheduling instruction; the instruction module corresponds to the operation steps; and extracting all matched operation steps to form a complete operation ticket. The method simplifies the flow of filling the operation ticket by the operator in a data mode, improves the working efficiency, reduces the error rate caused by step missing, step error and the like in the filling process of the operation ticket, and ensures the safety of switching operation.
Description
Technical Field
The invention belongs to the technical field of filling of operation tickets of electric power systems, and particularly relates to a method, a system, a device and a medium for filling operation tickets of 110kV and below transformer substations.
Background
The number and the scale of the transformer substation construction are increased year by year, and the corresponding switching operation times are increased. The switching operation is always an important point of the power transformation operation work, and as new staff enter the enterprise in recent years, more and more staff are on line, but the filling of operation tickets is not skilled, and sometimes a plurality of conditions such as step missing and step misplacement are easy to occur, so that the switching operation ticket filling becomes an important work in daily work for safely and reliably completing the switching operation task, and the efficient and accurate switching operation ticket filling method is designed to have very strong practical significance.
The operation ticket filling process is to decompose the operation steps into different step modules, combine according to the sequence of the dispatching order, the regulation of switching operation, a secondary operation sequence and the like, and finally form a complete switching operation ticket. The operation step module comprises automatic switching off, a pull-on switch, ground wire hanging and the like.
The current operation ticket is filled in by adopting a manual filling mode, and an operator writes operation steps according to a scheduling instruction, so that time consumption, inefficiency and high error rate are caused for the operator.
Disclosure of Invention
The invention aims to provide a method, a system, a device and a medium for filling operation tickets of 110kV or below in order to solve the problem that in the prior art, the error rate of the operation tickets is high due to step missing, step misplacement and the like when the operation tickets are manually filled.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
the invention provides a 110kV and below transformer substation operation ticket filling method based on a binary tree algorithm, which comprises the following steps:
acquiring a scheduling order to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders;
based on the content of the scheduling instruction, matching an instruction module corresponding to the content for the scheduling instruction; wherein the instruction module corresponds to the operation steps;
and extracting all matched operation steps, and combining the operation steps according to the sequence of the scheduling queue List to form a complete operation ticket.
Optionally, the instruction module corresponding to the content is matched for the scheduling instruction, and the specific method is as follows:
1) Acquiring a scheduling number of a current scheduling order;
2) Judging whether the scheduling number in the scheduling order is 2 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 2, and if so, matching: pulling or closing a mother connection switch with the number of 2 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 10kV outlet line;
3) Judging whether the scheduling number in the scheduling order is 1 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 1, and if so, matching: pulling or closing a mother switch with the number of 1 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the 110kV switch and the command module corresponding to the processing of the disconnecting link;
4) Judging whether the scheduling number in the scheduling order is 3 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 3, and if so, matching: pulling or closing a mother connection switch with the number of 3 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 35kV outlet line;
5) And (3) integrating the operation steps of the matched instruction modules according to the steps 1) to 4) to form an operation ticket.
Optionally, traversing the binary tree Ty [ i ], comprising the steps of:
step 41: let the current node be the root, i.e. current=root;
step 42: judging whether the current node is empty, if so, ending, otherwise, performing the next step;
step 43: ty [ i ] =current output Ty [ i ];
step 44: the current node points to the left subtree, i.e. current=btreel lchild, and returns to step 42 to loop;
step 45: the current node points to the right subtree, i.e. current = btreerchild, returns to step 42 to loop. Optionally, the binary tree is obtained by:
step 11: the scheduling number ch is acquired to. "end; circularly obtaining a complete scheduling number queue List [ i ] = "ch";
step 12: traversing the schedule queue tr=list [ i ]; and judging whether the scheduling number queue is. If yes, ending; otherwise, the next step is carried out;
step 13: establishing a root node, and pushing the root node to a stack;
step 14: and reading the character Tr, and judging whether the Tr is the character or not. If yes, proceeding to the next step, otherwise, building up the nodes P, P push stack, and circulating to Tr. ";
step 15: let the left subtree of the node be "NULL";
step 16: and reading the character Tr, and judging whether the Tr is the character or not. If not, building a node P, P push stack, and returning to the step 14; otherwise, the right subtree of the node is made to be 'NULL', whether 'stack empty' is judged, if yes, a binary tree BTre is output, otherwise, a pop node pre is output, and the step 16 is returned to for circulation.
Optionally, the instruction module corresponds to an operation step, specifically:
acquiring all known scheduling orders;
dividing each scheduling order into a plurality of instruction modules, giving each instruction module a code number, and filling corresponding operation steps for each instruction module.
Optionally, each instruction module is given a code number, specifically as follows:
step 21: acquiring a scheduling command queue, dividing the scheduling command queue into h sections by characters, thereby obtaining m [ h ];
step 22: the current scheduling command given with the code number is the i-th segment, i=1, 2,3 … … h, the relation between i and h is judged, if i is less than or equal to h, the next step is carried out, otherwise, the process is ended;
step 23: reading a digital field list [ i ] in the scheduling command, and reading a Chinese character field word [ i ] in the scheduling command; the number field list [ i ] in the scheduling order is a scheduling number, and the Chinese character field word [ i ] is a specific operation term; and respectively using different symbols and/or numbers corresponding to the number field list [ i ] and the Chinese character field word [ i ] as codes.
Alternatively, if the Chinese character field is "pull-open", let this field be A; if the Chinese character field is "pull out", let this field be B; if the Chinese character field is "push-in", let the field be C; if the Chinese character field is "on", let the field be D; based on the above, code numbers are assigned to all Chinese character fields.
In a second aspect of the present invention, a system for the binary tree algorithm-based 110kV and below transformer substation operation ticket filling method is provided, including:
the scheduling order acquisition module is used for acquiring the scheduling orders to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders;
the matching module is used for matching the instruction module corresponding to the content for the scheduling command based on the content of the scheduling command; wherein the instruction module corresponds to the operation steps;
and the extraction module is used for extracting all matched operation steps to form a complete operation ticket.
In a third aspect of the present invention, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the binary tree algorithm-based 110kV and below transformer substation operation ticket filling method when executing the computer program.
In a fourth aspect of the present invention, a computer readable storage medium is provided, where a computer program is stored, where the computer program, when executed by a processor, implements the method for filling out operation tickets of 110kV and below based on a binary tree algorithm.
The beneficial effects of the invention are as follows:
according to the substation operation ticket filling method based on the binary tree algorithm, provided by the invention, the dispatching order is acquired to generate a dispatching order queue List; based on the content of the scheduling instruction, matching an instruction module corresponding to the content for the scheduling instruction; wherein the instruction module corresponds to the operation steps; and extracting all matched operation steps to form a complete operation ticket. The process of filling the operation ticket by the operator is simplified in a data mode, and the working efficiency is improved. The error rate caused by step missing, step error and the like in the process of filling the operation ticket is reduced, and the safety of switching operation is ensured.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention. In the drawings:
FIG. 1 is a flow chart of generating an operation ticket in an embodiment of the invention;
FIG. 2 is a flow chart of a graphical digitizing function in an embodiment of the invention;
FIG. 3 is a flow chart of a function of analyzing a scheduling command according to an embodiment of the present invention;
FIG. 4 is a flow chart of an exemplary ticket function in an embodiment of the invention;
FIG. 5 is a flow chart of traversing a binary tree function in an embodiment of the present invention.
Detailed Description
The invention will be described in detail below with reference to the drawings in connection with embodiments. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other.
The following detailed description is exemplary and is intended to provide further details of the invention. Unless defined otherwise, all technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments in accordance with the invention.
As shown in fig. 1, the embodiment of the invention provides a method for filling out a transformer substation operation ticket of 110kV and below based on a binary tree algorithm, which comprises the following steps:
s1, acquiring a scheduling order to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders; the dispatch number is input and then a graph digitizing function is called to generate a binary tree dispatch number queue BTrees.
In this embodiment, btre is a digital storage structure that converts a primary system diagram of a power grid from a graph to a computer-aware, and includes the scheduling number of the switches and the relationship between the switches. The switch schedule number, and the relationship between the switches, can be read by traversing the binary tree.
S2, based on the content of the dispatching order, a typical ticket function (List, BTrees) is called, a binary tree algorithm is utilized to traverse a binary tree dispatching number queue BTrees, the content of a dispatching number in the current dispatching order is judged according to the binary tree dispatching number queue BTrees, and then the content of specific operations in the current dispatching order, such as a pulling action, a closing action and the like, are judged. Matching instruction modules corresponding to the content for the dispatching orders; the instruction module corresponds to an operation step of specific operation;
s3, extracting all matched operation steps, and combining the extracted operation steps according to the sequence of a scheduling queue List to form a complete operation ticket.
As shown in fig. 4, for the instruction module corresponding to the content and matched with the scheduling instruction, the specific method is as follows:
1) Acquiring a scheduling number of a current scheduling order;
as an example, the scheduling orders are "pull somewhere way 210 switch", "pull busbar 245 switch", "pull somewhere line 111 switch", "pull busbar 134 switch", "pull somewhere way 31 switch", "pull busbar 345 switch", etc.;
2) Judging whether the scheduling number in the scheduling order is 2 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 2, and if so, matching: pulling or closing a mother connection switch with the number of 2 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 10kV outlet line;
as an example, the parent connection numbered 2 includes a parent connection of 234,235,245,253, etc.
3) Judging whether the scheduling number in the scheduling order is 1 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 1, and if so, matching: pulling or closing a mother switch with the number of 1 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 110kV switch and the disconnecting link;
as an example, the parent at the beginning of the number 1 includes parent 134,145 and the like.
4) Judging whether the scheduling number in the scheduling order is 3 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 3, and if so, matching: pulling or closing a mother connection switch with the number of 3 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 35kV outlet line;
as an example, the parent at the beginning of number 3 includes a parent at 345, etc.
5) And (3) integrating the operation steps of the matched instruction modules according to the steps 1) to 4) to form an operation ticket.
As shown in fig. 5, traversing the binary tree Ty [ i ], comprises the steps of:
step 41: let the current node be the root, i.e. current=root;
step 42: judging whether the current node is empty, if so, ending, otherwise, performing the next step;
step 43: ty [ i ] =current output Ty [ i ];
step 44: the current node points to the left subtree, i.e. current=btreel lchild, and returns to step 42 to loop;
step 45: the current node points to the right subtree, i.e. current = btreerchild, returns to step 42 to loop.
As shown in fig. 2, the binary tree is obtained by:
step 11: the scheduling number ch is acquired according to the voltage class, so as to obtain the scheduling number. "end; circularly obtaining a complete scheduling number queue List [ i ] = "ch";
step 12: traversing the schedule queue tr=list [ i ]; and judging whether the scheduling number queue is. If yes, ending; otherwise, the next step is carried out;
step 13: establishing a root node, and pushing the root node to a stack;
step 14: and reading the character Tr, and judging whether the Tr is the character or not. If yes, proceeding to the next step, otherwise, building up the nodes P, P push stack, and circulating to Tr. ";
step 15: let the left subtree of the node be "NULL";
step 16: and reading the character Tr, and judging whether the Tr is the character or not. If not, building a node P, P push stack, and returning to the step 14; otherwise, the right subtree of the node is made to be 'NULL', whether 'stack empty' is judged, if yes, a binary tree BTre is output, and all scheduling numbers are included in the binary tree BTre; otherwise, outputting the pop node pre, and returning to the step 16 for circulation.
The instruction module applied to the embodiment of the invention corresponds to the operation steps, specifically:
acquiring all known scheduling orders; dividing each scheduling order into a plurality of instruction modules, giving each instruction module code, filling corresponding operation steps for each instruction module, and forming a database.
As an example of the present invention, known scheduling instructions are divided into several instruction modules, including self-switching off, pulling on and off switches, hanging ground wires, etc.
As an example of the present invention, the instruction module "pull a path 210 open and switch" write operation step "pull 210; inspection 210 should be pulled apart; "and the like.
As shown in fig. 3, according to the content of the scheduling instruction, a scheduling instruction parsing function is called to assign each instruction module code as follows:
step 21: acquiring a scheduling command queue, dividing the scheduling command queue into h sections by characters, thereby obtaining m [ h ];
step 22: the current scheduling command given with the code number is the i-th segment, i=1, 2,3 … … h, the relation between i and h is judged, if i is less than or equal to h, the next step is carried out, otherwise, the process is ended;
step 23: reading a digital field list [ i ] in the scheduling command, and reading a Chinese character field word [ i ] in the scheduling command; the number field list [ i ] in the scheduling order is the scheduling number, and the Chinese character field word [ i ] is the specific operation; and respectively using different symbols and/or numbers corresponding to the number field list [ i ] and the Chinese character field word [ i ] as codes.
As an example of the present invention, if the Chinese character field is "pull open", let the field be a, otherwise go to the next step; if the Chinese character field is "pull out", making the field be B, otherwise, making the next step; if the Chinese character field is pushed in, the field is made to be C, otherwise, the next step is carried out; if the Chinese character field is "on", making the field be D, otherwise, making the next step; by such pushing, the numerical code and/or the character code of the scheduling number and the corresponding operation instruction are finally obtained.
In a second aspect of the present invention, a system for the binary tree algorithm-based 110kV and below transformer substation operation ticket filling method is provided, including:
the scheduling order acquisition module is used for acquiring the scheduling orders to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders;
the matching module is used for matching the instruction module corresponding to the content for the scheduling command based on the content of the scheduling command; wherein the instruction module corresponds to the operation steps;
and the extraction module is used for extracting all matched operation steps to form a complete operation ticket.
In a third aspect of the present invention, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the binary tree algorithm-based 110kV and below transformer substation operation ticket filling method when executing the computer program.
In a fourth aspect of the present invention, a computer readable storage medium is provided, where a computer program is stored, where the computer program, when executed by a processor, implements the method for filling out operation tickets of 110kV and below based on a binary tree algorithm.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be appreciated by those skilled in the art that the present invention can be carried out in other embodiments without departing from the spirit or essential characteristics thereof. Accordingly, the above disclosed embodiments are illustrative in all respects, and not exclusive. All changes that come within the scope of the invention or equivalents thereto are intended to be embraced therein.
Claims (6)
1. A transformer substation operation ticket filling method of 110kV and below based on a binary tree algorithm is characterized by comprising the following steps:
acquiring a scheduling order to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders;
based on the content of the scheduling instruction, matching an instruction module corresponding to the content for the scheduling instruction; wherein the instruction module corresponds to the operation steps;
extracting all matched operation steps, and combining the matched operation steps according to the sequence of a scheduling queue List to form a complete operation ticket;
the instruction module corresponding to the content is matched for the dispatching order, and the specific method comprises the following steps:
1) Acquiring a scheduling number of a current scheduling order;
2) Judging whether the scheduling number in the scheduling order is 2 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 2, and if so, matching: pulling or closing a mother connection switch with the number of 2 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 10kV outlet line;
3) Judging whether the scheduling number in the scheduling order is 1 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 1, and if so, matching: pulling or closing a mother switch with the number of 1 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the 110kV switch and the command module corresponding to the processing of the disconnecting link;
4) Judging whether the scheduling number in the scheduling order is 3 XX; if not, proceeding to the next step; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is a parent link with the beginning of the number 3, and if so, matching: pulling or closing a mother connection switch with the number of 3 and a command module corresponding to the operation of the disconnecting link, otherwise, matching the command module corresponding to the 35kV outlet line;
5) According to the steps 1) to 4), integrating the operation steps of the matched instruction module to form an operation ticket;
the instruction module corresponds to operation steps, and specifically comprises the following steps:
acquiring all known scheduling orders;
dividing each scheduling order into a plurality of instruction modules, giving each instruction module a code number, and filling corresponding operation steps for each instruction module;
each instruction module is given a code number as follows:
step 21: acquiring a scheduling command queue, dividing the scheduling command queue into h sections by characters, thereby obtaining m [ h ];
step 22: the current scheduling command given with the code number is the i-th segment, i=1, 2,3 … … h, the relation between i and h is judged, if i is less than or equal to h, the next step is carried out, otherwise, the process is ended;
step 23: reading a digital field list [ i ] in the scheduling command, and reading a Chinese character field word [ i ] in the scheduling command; the number field list [ i ] in the scheduling order is the scheduling number, and the Chinese character field word [ i ] is the specific operation; respectively using different symbols and/or numbers corresponding to the number field list [ i ] and the Chinese character field word [ i ] as codes;
if the Chinese character field is "pull open", let this field be A; if the Chinese character field is "pull out", let this field be B; if the Chinese character field is "push-in", let the field be C; if the Chinese character field is "on", let this field be D.
2. The method for filling out the operation ticket of the transformer substation of 110kV and below based on the binary tree algorithm as claimed in claim 1, wherein the step of traversing the binary tree Ty [ i ] comprises the following steps:
step 41: let the current node be the root, i.e. current=root;
step 42: judging whether the current node is empty, if so, ending, otherwise, performing the next step;
step 43: ty [ i ] =current output Ty [ i ];
step 44: the current node points to the left subtree, i.e. current=btreel lchild, and returns to step 42 to loop;
step 45: the current node points to the right subtree, i.e. current = btreerchild, returns to step 42 to loop.
3. The method for filling out the operation ticket of the transformer substation of 110kV and below based on the binary tree algorithm as claimed in claim 1, wherein the binary tree is obtained by the following steps:
step 11: the scheduling number ch is acquired to. "end; circularly obtaining a complete scheduling number queue List [ i ] = "ch";
step 12: traversing the schedule queue tr=list [ i ]; and judging whether the scheduling number queue is. If yes, ending; otherwise, the next step is carried out;
step 13: establishing a root node, and pushing the root node to a stack;
step 14: and reading the character Tr, and judging whether the Tr is the character or not. If yes, proceeding to the next step, otherwise, building up the nodes P, P push stack, and circulating to Tr. ";
step 15: let the left subtree of the node be "NULL";
step 16: and reading the character Tr, and judging whether the Tr is the character or not. If not, building a node P, P push stack, and returning to the step 14; otherwise, the right subtree of the node is made to be 'NULL', whether 'stack empty' is judged, if yes, a binary tree BTre is output, otherwise, a pop node pre is output, and the step 16 is returned to for circulation.
4. A system for the binary tree algorithm-based 110kV and below substation ticket filling method of claim 1, comprising:
the scheduling order acquisition module is used for acquiring the scheduling orders to generate a scheduling order queue List; wherein, the dispatching order queue List comprises a plurality of dispatching orders;
the matching module is used for matching the instruction module corresponding to the content for the scheduling command based on the content of the scheduling command; wherein the instruction module corresponds to the operation steps;
and the extraction module is used for extracting all matched operation steps to form a complete operation ticket.
5. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements a binary tree algorithm based 110kV and below transformer substation ticket filling method according to any of claims 1 to 3 when the computer program is executed.
6. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the binary tree algorithm-based 110kV and below substation operation ticket filling method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592631.3A CN114218900B (en) | 2021-12-23 | 2021-12-23 | 110kV and below transformer substation operation ticket filling method, system, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592631.3A CN114218900B (en) | 2021-12-23 | 2021-12-23 | 110kV and below transformer substation operation ticket filling method, system, device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114218900A CN114218900A (en) | 2022-03-22 |
| CN114218900B true CN114218900B (en) | 2024-02-20 |
Family
ID=80705599
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111592631.3A Active CN114218900B (en) | 2021-12-23 | 2021-12-23 | 110kV and below transformer substation operation ticket filling method, system, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114218900B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013186588A2 (en) * | 2012-06-15 | 2013-12-19 | University Of Calcutta | K-ary tree to binary tree conversion through complete height balanced technique |
| CN104965437A (en) * | 2015-07-03 | 2015-10-07 | 国家电网公司 | Intelligent operation order generation method |
| CN106647648A (en) * | 2015-11-04 | 2017-05-10 | 中国南方电网有限责任公司 | Method for checking power plant and transformer substation operation order execution conditions in scheduling automation system |
| CN111968009A (en) * | 2020-07-29 | 2020-11-20 | 国网山东省电力公司德州市陵城区供电公司 | PDPC-based power grid intelligent operation instruction ticket booking method and system |
| CN111984673A (en) * | 2020-08-19 | 2020-11-24 | 江苏方天电力技术有限公司 | Fuzzy retrieval method and device for tree structure of power grid electric energy metering system |
-
2021
- 2021-12-23 CN CN202111592631.3A patent/CN114218900B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013186588A2 (en) * | 2012-06-15 | 2013-12-19 | University Of Calcutta | K-ary tree to binary tree conversion through complete height balanced technique |
| CN104965437A (en) * | 2015-07-03 | 2015-10-07 | 国家电网公司 | Intelligent operation order generation method |
| CN106647648A (en) * | 2015-11-04 | 2017-05-10 | 中国南方电网有限责任公司 | Method for checking power plant and transformer substation operation order execution conditions in scheduling automation system |
| CN111968009A (en) * | 2020-07-29 | 2020-11-20 | 国网山东省电力公司德州市陵城区供电公司 | PDPC-based power grid intelligent operation instruction ticket booking method and system |
| CN111984673A (en) * | 2020-08-19 | 2020-11-24 | 江苏方天电力技术有限公司 | Fuzzy retrieval method and device for tree structure of power grid electric energy metering system |
Non-Patent Citations (1)
| Title |
|---|
| 二叉树构造算法详解与教学设计;平安;玉溪师范学院学报;第37卷(第6期);17-21 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114218900A (en) | 2022-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111985653B (en) | Power grid fault knowledge recommendation and knowledge management system and method based on knowledge graph | |
| CN106021203B (en) | Intelligent substation anti-misoperation lockout logic graphical expression method | |
| CN107844466B (en) | System and method for automatically generating fault recording file analysis model | |
| CN110852023B (en) | Automatic generation method and device for primary main wiring diagram of intelligent substation | |
| CN106651198B (en) | Power grid accident auxiliary processing method and system | |
| CN106709143A (en) | VFTO batch simulation analysis method and system based on ATP automatic modeling | |
| CN116169794B (en) | Prompting device and prompting method for power system | |
| CN114218900B (en) | 110kV and below transformer substation operation ticket filling method, system, device and medium | |
| CN107944659B (en) | Method and device for automatically generating plant station monitoring system report | |
| CN111241488A (en) | Distribution network protection fixed value setting system based on full information data flow | |
| CN103632307A (en) | Method for checking consistency between SCD and virtual loop table of intelligent substation | |
| CN111026451A (en) | Parameter configuration method and configuration tool for transformer substation terminal interval | |
| CN111046189A (en) | Modeling method of power distribution network knowledge graph model | |
| CN104112183B (en) | The intelligent scheduling model management system and management method of intelligent substation plug and play | |
| CN102868220B (en) | Intelligent comprehensive command decomposition method of master station type comprehensive intelligent error prevention system for power scheduling | |
| CN103001318B (en) | A kind of based on 61850 the anti-implementation method of intelligent transformer substation topology five | |
| CN104077395A (en) | Method for equivalently simplifying and regenerating memory bank indexes for electrical power system | |
| CN102880988A (en) | Topology comparison-based method and device for importing substation model | |
| CN104749493A (en) | Grid fault equipment analyzing and reasoning method based on rule tree | |
| CN111697573B (en) | Power grid section power supply range analysis method based on topology tracking | |
| CN107748819A (en) | A kind of electrical secondary equipment modeling method and system based on natural language processing | |
| CN111738874A (en) | Method and device for automatically generating operation steps of new power grid equipment based on starting model | |
| CN102760194A (en) | Method and system for combining common information models (CIMs) of transformer substations and master scheduling station | |
| CN108762138B (en) | Method and system for automatically generating anti-error logic of electrical equipment based on equipment number | |
| CN111192159A (en) | Automatic equipment data entry method and terminal for power dispatching automation system |
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 |