CN114218900A - Method, system, device and medium for filling operation ticket of 110kV and below transformer substation - Google Patents
Method, system, device and medium for filling operation ticket of 110kV and below transformer substation Download PDFInfo
- Publication number
- CN114218900A CN114218900A CN202111592631.3A CN202111592631A CN114218900A CN 114218900 A CN114218900 A CN 114218900A CN 202111592631 A CN202111592631 A CN 202111592631A CN 114218900 A CN114218900 A CN 114218900A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- binary tree
- scheduling order
- instruction module
- order
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000004590 computer program Methods 0.000 claims description 19
- 238000003860 storage Methods 0.000 claims description 8
- 238000000605 extraction Methods 0.000 claims description 3
- 238000005429 filling process Methods 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction 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
Images
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
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- General Health & Medical Sciences (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Public Health (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Water Supply & Treatment (AREA)
- Quality & Reliability (AREA)
- Primary Health Care (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Engineering & Computer Science (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 in operation tickets of 110kV and below transformer substations, which are used for acquiring scheduling orders to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders; matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to the operation step; and extracting all matched operation steps to form a complete operation ticket. The method simplifies the process of filling the operation order by the operator in a data mode, improves the working efficiency, reduces the error rate caused by missing steps, wrong steps and the like in the filling process of the operation order, and ensures the safety of switching operation.
Description
Technical Field
The invention belongs to the technical field of filling in operation tickets of power systems, and particularly relates to a method, a system, a device and a medium for filling in operation tickets of 110kV and below transformer substations.
Background
The number and scale of the transformer substation construction are increased year by year, and the corresponding switching operation times are increased sharply. The switching operation is always a key point of the power transformation operation work, with the fact that in recent years, new staff are more and more on the front line after entering enterprises, but the operation tickets are not skillful to fill, and sometimes, a plurality of situations such as missing steps, wrong steps and the like easily occur.
The operation ticket filling process is to divide the operation steps into different step modules, combine the operation steps according to the sequence of the dispatching order, the switching operation regulation, the primary and secondary operation sequence and the like, and finally form a complete switching operation ticket. The operation step module comprises automatic switching off, switch on and off, ground wire hanging and the like.
The current filling of the operation order adopts a manual filling mode, and an operator writes operation steps according to a scheduling instruction, so that the trouble of time consumption, low efficiency and high error rate is caused to 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 and below transformer substations, and aims to solve the problem that operation ticket error rate is high due to missing steps, wrong steps and the like in manual filling of the operation tickets in the prior art.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention provides a binary tree algorithm-based method for filling operation tickets of 110kV and the following transformer substations, which comprises the following steps:
acquiring a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders;
matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step;
and extracting all matched operation steps, and combining the operation steps according to the sequence of the scheduling order queue List to form a complete operation ticket.
Optionally, the method for matching the instruction module corresponding to the content for the scheduling instruction specifically includes:
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, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 2, if so, matching: opening or closing the bus coupler switch with the number of 2 beginning and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 10kV outgoing line;
3) judging whether the scheduling number in the scheduling order is '1 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the number of the beginning of 1, if so, matching: opening or closing the corresponding command module for the operation of the bus coupler switch and the disconnecting link with the serial number of 1, and otherwise, matching the 110kV switch and the disconnecting link to process the corresponding command module;
4) judging whether the scheduling number in the scheduling order is '3 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 3, if so, matching: opening or closing the bus coupler switch with the serial number of 3 and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 35kV outgoing line;
5) and according to the steps 1) to 4), integrating the operation steps of the matched instruction modules to form an operation ticket.
Optionally, traversing the binary tree Ty [ i ] includes the following steps:
step 41: making the current node as a root, namely current root;
step 42: judging whether the current node is empty, if so, ending, otherwise, carrying out the next step;
step 43: ty [ i ] ═ current output Ty [ i ];
step 44: the current node points to the left subtree, i.e., current.
Step 45: the current node points to the right subtree, current btree. Optionally, the binary tree obtaining manner is:
step 11: get the scheduling number ch, in. "end; circularly obtaining a complete scheduling number queue List [ i ] ═ ch ";
step 12: traversing a scheduling number queue Tr ═ List [ i ]; and judging whether the scheduling number queue is ' or ' not '. ", if so, then end; otherwise, carrying out the next step;
step 13: establishing root nodes root, and stacking the root nodes;
step 14: reads character Tr and determines whether Tr is "or not. ", if yes, proceed to next step, otherwise, establish node P, P push, loop to Tr is". ";
step 15: let the left sub-tree of a node be "NULL";
step 16: reads character Tr and determines whether Tr is "or not. If not, establishing a node P, and pushing the node P, and returning to the step 14; otherwise, the right subtree of the node is made to be NULL, whether the stack is empty is judged, if yes, the binary tree BTree is output, otherwise, the pop node pre is output, and the step 16 is returned to carry out 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, a code number is assigned to each instruction module, specifically as follows:
step 21: acquiring a scheduling order queue, dividing the scheduling order queue into h sections by characters to obtain mh;
step 22: the current scheduling order endowed with the code is the ith section, i is 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 operation is finished;
step 23: reading a number field list [ i ] in the scheduling order, and reading a Chinese character field word [ i ] in the scheduling order; 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 the number field list [ i ] and the Chinese character field word [ i ] correspond to different symbols and/or numbers respectively to be used as codes.
Optionally, if the Chinese character field is "pull open", the field is made to be A; if the Chinese character field is 'pull out', the field is made to be B; if the Chinese character field is 'push', the field is made to be C; if the Chinese character field is 'closed', the field is made to be D; and by analogy, assigning codes to all Chinese character fields.
In a second aspect of the present invention, a system for the binary tree algorithm based method for filling in the operation tickets of the 110kV and the following substations is provided, which includes:
the scheduling order acquiring module is used for acquiring a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders;
the matching module is used for matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step;
and the extraction module is used for extracting all matched operation steps to form a complete operation order.
In a third aspect of the present invention, a computer device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the binary tree algorithm-based substation operation ticket filling method of 110kV and below 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, and when the computer program is executed by a processor, the method for filling in the operation tickets of the substation of 110kV and below based on the binary tree algorithm is implemented.
The invention has the following beneficial effects:
according to the method for filling the operation tickets of the transformer substation of 110kV or below based on the binary tree algorithm, the scheduling order is obtained to generate the scheduling order queue List; matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step; and extracting all matched operation steps to form a complete operation ticket. The process of filling in the operation order by the operator is simplified in a data mode, and the working efficiency is improved. The error rate caused by missing steps, wrong steps and the like in the filling process of the operation order is reduced, and the safety of switching operation is ensured.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the invention and, together with the description, serve to explain the invention and not to limit the invention. In the drawings:
FIG. 1 is a flow chart of the generation of an operation ticket in an embodiment of the present invention;
FIG. 2 is a flow chart of a graphical digitizing function in an embodiment of the present invention;
FIG. 3 is a flow chart of a dispatch order resolution function in an embodiment of the present invention;
FIG. 4 is a flow diagram of an exemplary ticket function in an embodiment of the present invention;
FIG. 5 is a flowchart of traversing a binary tree function according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the embodiments with reference to the attached drawings. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
The following detailed description is exemplary in nature and is intended to provide further details of the invention. Unless otherwise defined, 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 exemplary embodiments according to the invention.
As shown in fig. 1, an embodiment of the present invention provides a method for filling in an operation ticket of a substation of 110kV and below based on a binary tree algorithm, including the following steps:
s1, obtaining a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders; the scheduling number is input, and a graph digitization function is called to generate a binary tree scheduling number queue BTree.
In this embodiment, BTree is a digital storage structure that converts a primary system diagram of a power grid from a graph into a computer, and the storage structure includes a scheduling number of switches and a relationship between the switches. The switch scheduling number, and the relationship between the switches, can be read by traversing the binary tree.
S2, calling typical ticket functions (List, BTree) based on the content of the scheduling order, traversing the binary tree scheduling number queue BTree by using a binary tree algorithm, judging the content of the scheduling number in the current scheduling order according to the binary tree scheduling number queue BTree, and then judging the content of specific operations in the current scheduling order, such as opening and closing actions. Matching an instruction module corresponding to the content for the scheduling order; the instruction module corresponds to an operation step of specific operation;
and S3, extracting all matched operation steps, and combining the extracted operation steps to form a complete operation ticket according to the sequence of the scheduling order queue List.
As shown in fig. 4, the specific method for matching the instruction module corresponding to the content for the scheduling instruction is as follows:
1) acquiring a scheduling number of a current scheduling order;
as an example, the schedule order is "open a certain way 210 switch", "open a buscouple 245 switch", "open a certain line 111 switch", "open a buscouple 134 switch", "open a certain way 31 switch", "open a buscouple 345 switch", and so on;
2) judging whether the scheduling number in the scheduling order is '2 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 2, if so, matching: opening or closing the bus coupler switch with the number of 2 beginning and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 10kV outgoing line;
by way of example, the first couplet numbered 2 includes the couplets 234,235,245,253 and the like.
3) Judging whether the scheduling number in the scheduling order is '1 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the number of the beginning of 1, if so, matching: opening or closing the command module corresponding to the operation of the bus coupler switch and the disconnecting link with the serial number of 1, and otherwise, matching the command module corresponding to the 110kV switch and the disconnecting link;
by way of example, the first bus tie numbered 1 includes bus ties such as 134,145.
4) Judging whether the scheduling number in the scheduling order is '3 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 3, if so, matching: opening or closing the bus coupler switch with the serial number of 3 and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 35kV outgoing line;
as an example, the first bus connector numbered 3 includes 345 and other bus connectors.
5) And according to the steps 1) to 4), integrating the operation steps of the matched instruction modules to form an operation ticket.
As shown in fig. 5, traversing the binary tree Ty [ i ] includes the steps of:
step 41: making the current node as a root, namely current root;
step 42: judging whether the current node is empty, if so, ending, otherwise, carrying out the next step;
step 43: ty [ i ] ═ current output Ty [ i ];
step 44: the current node points to the left subtree, i.e., current.
Step 45: the current node points to the right subtree, current btree.
As shown in fig. 2, the binary tree is obtained in the following manner:
step 11: the scheduling number ch is acquired in accordance with the voltage class. "end; circularly obtaining a complete scheduling number queue List [ i ] ═ ch ";
step 12: traversing a scheduling number queue Tr ═ List [ i ]; and judging whether the scheduling number queue is ' or ' not '. ", if so, then end; otherwise, carrying out the next step;
step 13: establishing root nodes root, and stacking the root nodes;
step 14: reads character Tr and determines whether Tr is "or not. ", if yes, proceed to next step, otherwise, establish node P, P push, loop to Tr is". ";
step 15: let the left sub-tree of a node be "NULL";
step 16: reads character Tr and determines whether Tr is "or not. If not, establishing a node P, and pushing the node P, and returning to the step 14; otherwise, the right subtree of the node is enabled to be NULL, whether the stack is empty is judged, if yes, a binary tree BTree is output, and all scheduling numbers are included in the binary tree BTree; otherwise, outputting the pop node pre, and returning to the step 16 to circulate.
Applied to the embodiment of the present invention, the instruction module corresponds to operation steps, specifically:
acquiring all known scheduling orders; dividing each scheduling order into a plurality of instruction modules, giving a code number to each instruction module, filling corresponding operation steps for each instruction module, and forming a database.
As an example of the present invention, a known scheduling instruction is divided into several instruction modules, including a self-throw disable, a pull-switch, a hang-ground, etc.
As an example of the present invention, the instruction module "pull a certain way 210 on and off" write operation step "pulls 210 off; check 210 should be pulled apart; "and the like.
As shown in fig. 3, according to the content of the scheduling command, a scheduling command parsing function is called, and a code is assigned to each instruction module, which is specifically as follows:
step 21: acquiring a scheduling order queue, dividing the scheduling order queue into h sections by characters to obtain mh;
step 22: the current scheduling order endowed with the code is the ith section, i is 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 operation is finished;
step 23: reading a number field list [ i ] in the scheduling order, and reading a Chinese character field word [ i ] in the scheduling order; the number field list [ i ] in the scheduling order is a scheduling number, and the Chinese character field word [ i ] is a specific operation; and the number field list [ i ] and the Chinese character field word [ i ] correspond to different symbols and/or numbers respectively to be used as codes.
As an example of the invention, if the Chinese character field is 'unzipped', the field is made to be A, otherwise, the next step is carried out; if the Chinese character field is 'pull out', the field is made to be B, otherwise, the next step is carried out; if the Chinese character field is 'push-in', the field is made to be C, otherwise, the next step is carried out; if the Chinese character field is 'closed', the field is made to be D, otherwise, the next step is carried out; and by analogy, the digital code and/or the character code of the dispatching number and the corresponding operation instruction are obtained finally.
In a second aspect of the present invention, a system for the binary tree algorithm based method for filling in the operation tickets of the 110kV and the following substations is provided, which includes:
the scheduling order acquiring module is used for acquiring a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders;
the matching module is used for matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step;
and the extraction module is used for extracting all matched operation steps to form a complete operation order.
In a third aspect of the present invention, a computer device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the binary tree algorithm-based substation operation ticket filling method of 110kV and below 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, and when the computer program is executed by a processor, the method for filling in the operation tickets of the substation of 110kV and below based on the binary tree algorithm is implemented.
As will be appreciated by one skilled in the art, 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The embodiments disclosed above are therefore to be considered in all respects as illustrative and not restrictive. All changes which come within the scope of or equivalence to the invention are intended to be embraced therein.
Claims (10)
1. A110 kV and following transformer substation operation ticket filling method based on a binary tree algorithm is characterized by comprising the following steps:
acquiring a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders;
matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step;
and extracting all matched operation steps, and combining the operation steps according to the sequence of the scheduling order queue List to form a complete operation ticket.
2. The binary tree algorithm-based 110kV and following substation operation ticket filling method according to claim 1, wherein the specific method for matching the scheduling command with the instruction module corresponding to the content 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, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 2, if so, matching: opening or closing the bus coupler switch with the number of 2 beginning and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 10kV outgoing line;
3) judging whether the scheduling number in the scheduling order is '1 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the number of the beginning of 1, if so, matching: opening or closing the corresponding command module for the operation of the bus coupler switch and the disconnecting link with the serial number of 1, and otherwise, matching the 110kV switch and the disconnecting link to process the corresponding command module;
4) judging whether the scheduling number in the scheduling order is '3 XX'; if not, the next step is carried out; otherwise, traversing the binary tree Ty [ i ], judging whether the scheduling number is the buscouple with the serial number of the beginning of 3, if so, matching: opening or closing the bus coupler switch with the serial number of 3 and the instruction module corresponding to the disconnecting link operation, and otherwise, matching the instruction module corresponding to the 35kV outgoing line;
5) and according to the steps 1) to 4), integrating the operation steps of the matched instruction modules to form an operation ticket.
3. The binary tree algorithm-based 110kV and following substation operation ticket filling method according to claim 2, wherein traversing the binary tree Ty [ i ] comprises the following steps:
step 41: making the current node as a root, namely current root;
step 42: judging whether the current node is empty, if so, ending, otherwise, carrying out the next step;
step 43: ty [ i ] ═ current output Ty [ i ];
step 44: the current node points to the left subtree, i.e., current.
Step 45: the current node points to the right subtree, current btree.
4. The binary tree algorithm-based 110kV and following substation operation ticket filling method according to claim 2, wherein the binary tree is obtained in a manner that:
step 11: get the scheduling number ch, in. "end; circularly obtaining a complete scheduling number queue List [ i ] ═ ch ";
step 12: traversing a scheduling number queue Tr ═ List [ i ]; and judging whether the scheduling number queue is ' or ' not '. ", if so, then end; otherwise, carrying out the next step;
step 13: establishing root nodes root, and stacking the root nodes;
step 14: reads character Tr and determines whether Tr is "or not. ", if yes, proceed to next step, otherwise, establish node P, P push, loop to Tr is". ";
step 15: let the left sub-tree of a node be "NULL";
step 16: reads character Tr and determines whether Tr is "or not. If not, establishing a node P, and pushing the node P, and returning to the step 14; otherwise, the right subtree of the node is made to be NULL, whether the stack is empty is judged, if yes, the binary tree BTree is output, otherwise, the pop node pre is output, and the step 16 is returned to carry out circulation.
5. The binary tree algorithm-based 110kV and following substation operation ticket filling method according to claim 1, wherein the instruction module corresponds to operation steps, 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.
6. The binary tree algorithm-based 110kV and following substation operation ticket filling method according to claim 5, wherein a code number is given to each instruction module, specifically as follows:
step 21: acquiring a scheduling order queue, dividing the scheduling order queue into h sections by characters to obtain mh;
step 22: the current scheduling order endowed with the code is the ith section, i is 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 operation is finished;
step 23: reading a number field list [ i ] in the scheduling order, and reading a Chinese character field word [ i ] in the scheduling order; the number field list [ i ] in the scheduling order is a scheduling number, and the Chinese character field word [ i ] is a specific operation; and the number field list [ i ] and the Chinese character field word [ i ] correspond to different symbols and/or numbers respectively to be used as codes.
7. The binary tree algorithm-based filling method for the operation tickets of 110kV and below transformer substations as claimed in claim 6, wherein if a Chinese character field is "pull open", the field is made to be A; if the Chinese character field is 'pull out', the field is made to be B; if the Chinese character field is 'push', the field is made to be C; if the Chinese character field is 'closed', the field is made to be D; and by analogy, assigning codes to all Chinese character fields.
8. A system for the binary tree algorithm based 110kV and the following substation operation ticket filling method according to claim 1, comprising:
the scheduling order acquiring module is used for acquiring a scheduling order to generate a scheduling order queue List; the scheduling order queue List comprises a plurality of scheduling orders;
the matching module is used for matching an instruction module corresponding to the content for the scheduling order based on the content of the scheduling order; wherein, the instruction module corresponds to an operation step;
and the extraction module is used for extracting all matched operation steps to form a complete operation order.
9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor when executing the computer program implements the binary tree algorithm based 110kV and below substation operation ticket filling method according to any one of claims 1 to 7.
10. 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 7.
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 true CN114218900A (en) | 2022-03-22 |
| CN114218900B 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 |
|---|
| 平安: "二叉树构造算法详解与教学设计", 玉溪师范学院学报, vol. 37, no. 6, pages 17 - 21 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114218900B (en) | 2024-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111985653B (en) | Power grid fault knowledge recommendation and knowledge management system and method based on knowledge graph | |
| CN108549650B (en) | Intelligent substation anti-misoperation lockout logic rule source end configuration method and system | |
| CN105701271B (en) | Method for creating and deleting equipment in graph-model hybrid simulation modeling of power system | |
| CN104820755A (en) | Physical loop extension and automatic virtual-real mapping method based on SCD (System Configuration Description) file | |
| CN109408960B (en) | Method and system for automatically generating intelligent transformer substation main wiring diagram based on SCD | |
| CN106296467A (en) | A kind of method generating operation order | |
| CN103632307A (en) | Method for checking consistency between SCD and virtual loop table of intelligent substation | |
| CN113094932A (en) | Method, device, equipment and storage medium for acquiring construction cost of power transformation project | |
| WO2014012422A1 (en) | Method for building, storing and synchronizing main equipment model of hydroelectric power plant | |
| CN109643100B (en) | Apparatus and method for converting PLC control program into structured data | |
| CN114218900A (en) | Method, system, device and medium for filling operation ticket of 110kV and below transformer substation | |
| CN104749493A (en) | Grid fault equipment analyzing and reasoning method based on rule tree | |
| CN102880988A (en) | Topology comparison-based method and device for importing substation model | |
| CN110377944A (en) | A kind of power distribution network topological construction method and system towards battalion with fusion | |
| CN107748819A (en) | A kind of electrical secondary equipment modeling method and system based on natural language processing | |
| CN102736551A (en) | Software problem solving method for ladder diagram codes of programmable logic controller (PLC) | |
| CN105678637A (en) | Data parsing system and application method thereof for vehicle charging posts | |
| CN102375727A (en) | Graphical maintenance method of hierarchical relation of circuits | |
| CN111830919A (en) | Terminating file generation method and device based on EPLAN platform | |
| CN112054509A (en) | Method, system, equipment and medium for identifying bus topological structure of transformer substation | |
| CN106251010B (en) | Based on Common Information Model power distribution network station house and station equipment simplification and upper drawing method | |
| CN117787422B (en) | Switching operation task extraction method and system | |
| CN112214901B (en) | Distribution network scheduling instruction ticket security checking method and system based on traversal tree | |
| CN101888119B (en) | Generation method of scheduling operating command ticket | |
| CN110148927B (en) | Local area power grid increment dynamic partitioning method applied to fixed value checking 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 |