CN113159443A - Optimal path selection method and system suitable for operation order - Google Patents
Optimal path selection method and system suitable for operation order Download PDFInfo
- Publication number
- CN113159443A CN113159443A CN202110485323.4A CN202110485323A CN113159443A CN 113159443 A CN113159443 A CN 113159443A CN 202110485323 A CN202110485323 A CN 202110485323A CN 113159443 A CN113159443 A CN 113159443A
- Authority
- CN
- China
- Prior art keywords
- optimal path
- module
- optimal
- power
- ticket
- 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
- 238000010187 selection method Methods 0.000 title claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims abstract description 39
- 230000002068 genetic effect Effects 0.000 claims abstract description 25
- 238000009826 distribution Methods 0.000 claims abstract description 20
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 19
- 230000003993 interaction Effects 0.000 claims description 23
- 239000011159 matrix material Substances 0.000 claims description 9
- 238000012795 verification Methods 0.000 claims description 7
- 230000000007 visual effect Effects 0.000 claims description 5
- 230000003044 adaptive effect Effects 0.000 claims description 4
- 230000035772 mutation Effects 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 2
- 230000008901 benefit Effects 0.000 abstract description 4
- 238000000034 method Methods 0.000 description 19
- 230000006870 function Effects 0.000 description 17
- 238000007726 management method Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000003860 storage Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 230000008676 import Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E40/00—Technologies for an efficient electrical power generation, transmission or distribution
- Y02E40/70—Smart grids as climate change mitigation technology in the energy generation sector
-
- 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)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Life Sciences & Earth Sciences (AREA)
- Tourism & Hospitality (AREA)
- Biophysics (AREA)
- General Business, Economics & Management (AREA)
- General Health & Medical Sciences (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Quality & Reliability (AREA)
- Evolutionary Biology (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Bioinformatics & Computational Biology (AREA)
- Game Theory and Decision Science (AREA)
- Genetics & Genomics (AREA)
- Data Mining & Analysis (AREA)
- Water Supply & Treatment (AREA)
- Public Health (AREA)
- Physiology (AREA)
- Educational Administration (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Computational Linguistics (AREA)
- Primary Health Care (AREA)
- Evolutionary Computation (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses an optimal path selection method and system suitable for an operation ticket, which comprises the steps of collecting the billing type and operation task information and selecting the ticket sample type; judging whether an optimal path needs to be calculated, if so, determining an initial topological structure of the power grid according to the power data in the database and the switch state in the knowledge rule base; analyzing the initial topological structure of the power grid by using graph theory and a genetic algorithm, and calculating and selecting an optimal power supply path; performing load flow calculation on the optimal power supply path scheme, and judging whether load flow distribution meets the requirement of system reliability; if not, continuously searching an optimal power supply path; if the optimal path is met, generating an operation ticket according to the operation rule, automatically printing a ticket sample, and completing the selection of the optimal path. The invention can realize minimum switching times, reduce scheduling time and economic loss, and simultaneously can judge whether the power flow distribution of the minimum path meets the reliability requirement, thereby achieving the advantage of combining economy and reliability.
Description
Technical Field
The invention relates to the technical field of power grid operation application systems, in particular to an optimal path selection method and system suitable for an operation order.
Background
The intelligent dispatching management system of the power system is mainly used for organizing, guiding and coordinating the operation of the power system to the operation of the power grid. The intelligent management and operation of the electric power system are a development trend, the dispatching operation ticket system is widely applied to electric power departments and electric power enterprises, the former method that electric power dispatching personnel manually operate to issue tickets is changed, the efficiency of the electric power enterprises is improved, the accuracy of the operation tickets is improved, the electric power operation ticket system is an effective safety measure for preventing the misoperation of dispatching operation management of the electric power system in China, and the dispatching operation ticket system is a basis for completing dispatching tasks with high quality and high efficiency.
With the increase of the total number of users and the continuous expansion of the scale of a power grid, the defects of the conventional scheduling operation ticket system are exposed, mainly because the intelligent reasoning function is not strong, the self-adaptive learning capability is poor, and the operation of the power database is lack of flexibility on the whole; the electric power service and the power grid construction are auxiliary works of urban and rural basic construction, and along with the enlargement of urban scale and the adjustment of development direction, the power grid needs to be regularly reconstructed and expanded, which puts higher requirements on the intelligent level of the power grid dispatching operation ticket generating system.
The most important thing in the electric power system is reliability, and every switching operation generates expenses including equipment depreciation expense, labor expense and the like, and by reducing the switching operation times, the relay protection misoperation caused by multiple switching operations can be avoided, and the service life of the switch can be prolonged. The existing scheduling operation ticket system does not consider the selection of an optimal path, the number of times of actions of switch equipment is large in the actual scheduling process, the action time is increased, the switching loss is increased, and timeliness and economy are not achieved.
Disclosure of Invention
This section is for the purpose of summarizing some aspects of embodiments of the invention and to briefly introduce some preferred embodiments. In this section, as well as in the abstract and the title of the invention of this application, simplifications or omissions may be made to avoid obscuring the purpose of the section, the abstract and the title, and such simplifications or omissions are not intended to limit the scope of the invention.
The present invention has been made in view of the above-mentioned conventional problems.
Therefore, the technical problem solved by the invention is as follows: the prior art has poor reliability, no timeliness and economy and low intelligent level.
In order to solve the technical problems, the invention provides the following technical scheme: collecting the billing type and the operation task information and selecting the ticket sample type; judging whether an optimal path needs to be calculated, if so, determining an initial topological structure of the power grid according to the power data in the database and the switch state in the knowledge rule base; analyzing the initial topological structure of the power grid by using graph theory and a genetic algorithm, and calculating and selecting an optimal power supply path; performing load flow calculation on the optimal power supply path scheme, and judging whether load flow distribution meets the requirement of system reliability; if not, continuously searching an optimal power supply path; if the optimal path is met, generating an operation ticket according to the operation rule, automatically printing a ticket sample, and completing the selection of the optimal path.
As a preferable aspect of the optimal path selection method for an operation ticket according to the present invention, wherein: analyzing the power grid initial topological structure by using a genetic algorithm comprises the steps of obtaining the power grid initial topological structure, forming a node branch incidence matrix A and obtaining the connection relation of the node branches; forming an initial switch state vector according to the real-time switch state, and indicating whether the corresponding switch is closed or open; forming a population by the switching state codes of each individual, comparing the population with the initial switching state vector to obtain switching times S, and determining a selection factor, a cross factor and a variation factor by taking the minimum switching times as an adaptive function to form a new population; obtaining a node admittance matrix Y according to the node branch incidence matrix A and system parameters; selecting individuals in the previous generation population to enter the next generation population according to the selection factors, selecting individuals through the cross factors to perform cross coding to enter a new population, and selecting individuals through the variation factors to perform coding change to enter the new population; and judging whether the number of inheritance times is reached, if so, carrying out the next step, and if not, returning to the previous step.
As a preferable aspect of the optimal path selection method for an operation ticket according to the present invention, wherein: performing load flow calculation on the optimal power supply path scheme comprises the following steps of performing load flow calculation by adopting a Newton-Raphson strategy: and carrying out load flow calculation on the obtained individuals, and judging whether the power, the voltage and the current are out of limit or not.
As a preferable aspect of the optimal path selection method for an operation ticket according to the present invention, wherein: the optimal switch path is judged by setting the genetic times to be 0 again when the power, the voltage and the current are out of limit, carrying out selection, crossing and mutation operations, eliminating individuals with fitness function values equal to the maximum value, namely the individuals which cannot meet the load flow calculation verification, obtaining a new optimal path scheme after the genetic times reach the specified times, and calculating the load flow distribution; and when the power, the voltage and the current are not out of limit, outputting an optimal switching path, and finishing the algorithm.
The invention solves another technical problem that: a fiber network resource digital verification system is provided, and the method is realized by depending on the system.
In order to solve the technical problems, the invention provides the following technical scheme: the human-computer interaction interface is used for inputting a program and an operation instruction for judging the optimal path and updating the contents of the knowledge rule base module and the database module according to the program and the instruction; the database module is used for providing power data and historical operation tickets required by the reasoning module, and the rule base module is used for providing states of all components and operation ticket generation rules; the inference module comprises an optimal path selection module and a power flow calculation module, the optimal path selection module is used for processing the power data provided by the database module to generate an operation order of an optimal path, and the power flow calculation module is connected with the optimal path selection module and used for judging whether the power flow distribution under the optimal path meets the system requirement.
As a preferable aspect of the optimal path selection system for an operation ticket according to the present invention, wherein: the system also comprises an operating system which is used for realizing the comprehensive management of each module.
As a preferable aspect of the optimal path selection system for an operation ticket according to the present invention, wherein: the human-computer interaction interface provides a visual operation interface, an operator can conveniently manage the system and each module, and the human-computer interaction interface indirectly controls each module through the operation system to update the contents of the database module and the knowledge rule base module.
As a preferable aspect of the optimal path selection system for an operation ticket according to the present invention, wherein: the human-computer interaction interface guides a genetic algorithm program which is manually input into the optimal path selection module, guides an operation instruction which needs to be completed into the reasoning module, and displays an optimal path operation ticket obtained by the reasoning module on the interface to realize the automatic ticket issuing function.
As a preferable aspect of the optimal path selection system for an operation ticket according to the present invention, wherein: the knowledge rule base module stores various logic rules required by the state of the equipment and the generation of the operation ticket, and the logic rules are controlled by the program of the operation system and are managed, added and modified as required.
As a preferable aspect of the optimal path selection system for an operation ticket according to the present invention, wherein: the optimal path selection module generates an optimal path operation ticket through a genetic algorithm, the load flow calculation module performs load flow calculation on the power system under the optimal path, judges whether load flow distribution under the optimal path meets system requirements, transmits the generated operation ticket to the operation system if the load flow distribution under the optimal path meets the system requirements, takes the path as a rejected individual of the genetic algorithm if the load flow distribution does not meet the requirements, and returns to the optimal path selection module to recalculate the optimal path.
The invention has the beneficial effects that: the invention combines the automatic ticket issuing function of the traditional operation ticket system, adds the function of optimal path selection, can realize the minimum switching times and reduce the scheduling time and the economic loss, has the function of load flow calculation and verification, realizes the load flow distribution judgment of the minimum path to meet the reliability requirement and achieves the advantage of economic and reliable combination.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise. Wherein:
fig. 1 is a basic flowchart of a method and a system for selecting an optimal path for an operation ticket according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a genetic algorithm and a load flow calculation process of an optimal path selection method and system for operation tickets according to an embodiment of the present invention;
fig. 3 is a schematic block diagram of an optimal path selection method and system for an operation ticket according to an embodiment of the present invention;
fig. 4 is a system structural diagram of an optimal path selection method and system for an operation ticket according to an embodiment of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, specific embodiments accompanied with figures are described in detail below, and it is apparent that the described embodiments are a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making creative efforts based on the embodiments of the present invention, shall fall within the protection scope of the present invention.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced in other ways than those specifically described and will be readily apparent to those of ordinary skill in the art without departing from the spirit of the present invention, and therefore the present invention is not limited to the specific embodiments disclosed below.
Furthermore, reference herein to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one implementation of the invention. The appearances of the phrase "in one embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments.
The present invention will be described in detail with reference to the drawings, wherein the cross-sectional views illustrating the structure of the device are not enlarged partially in general scale for convenience of illustration, and the drawings are only exemplary and should not be construed as limiting the scope of the present invention. In addition, the three-dimensional dimensions of length, width and depth should be included in the actual fabrication.
Meanwhile, in the description of the present invention, it should be noted that the terms "upper, lower, inner and outer" and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of describing the present invention and simplifying the description, but do not indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation and operate, and thus, cannot be construed as limiting the present invention. Furthermore, the terms first, second, or third are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
The terms "mounted, connected and connected" in the present invention are to be understood broadly, unless otherwise explicitly specified or limited, for example: can be fixedly connected, detachably connected or integrally connected; they may be mechanically, electrically, or directly connected, or indirectly connected through intervening media, or may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
Example 1
Referring to fig. 1 to 2, an embodiment of the present invention provides an optimal path selection method for an operation ticket, including:
s1: collecting the billing type and the operation task information and selecting the ticket sample type;
s2: judging whether an optimal path needs to be calculated, if so, determining an initial topological structure of the power grid according to the power data in the database and the switch state in the knowledge rule base;
s3: analyzing the initial topological structure of the power grid by using graph theory and a genetic algorithm, and calculating and selecting an optimal power supply path;
s4: performing load flow calculation on the optimal power supply path scheme, and judging whether load flow distribution meets the requirement of system reliability;
if not, continuously searching an optimal power supply path;
if the optimal path is met, generating an operation ticket according to the operation rule, automatically printing a ticket sample, and completing the selection of the optimal path.
Specifically, as shown in fig. 2, analyzing the initial topology of the power grid by using a genetic algorithm includes: acquiring an initial topological structure of a power grid, forming a node branch incidence matrix A, and acquiring a connection relation of node branches;
forming an initial switch state vector according to the real-time switch state, wherein the initial switch state vector represents whether a corresponding switch is closed or opened, 1 represents closed, and 0 represents opened;
the switching state codes of each individual form a population, the population is compared with the initial switching state vector to obtain switching times S, the minimum switching times is taken as an adaptive function, namely the adaptive function is the sum of the switching times of each switch, and selection factors, cross factors and variation factors are determined to form a new population;
obtaining a node admittance matrix Y according to the node branch incidence matrix A and the system parameters;
selecting individuals in the previous generation population to enter the next generation population according to selection factors, selecting individuals through cross factors to perform cross coding to enter a new population, and selecting individuals through variation factors to perform coding change to enter the new population;
judging whether the number of inheritance times is reached, if so, carrying out the next step, and if not, returning to the previous step, namely returning to the selection, crossing and mutation operations;
further, the performing of the power flow calculation on the optimal power supply path scheme includes:
and (3) carrying out load flow calculation by adopting a Newton Raphson strategy:
carrying out load flow calculation on the obtained individuals (the optimal switch path scheme), and judging whether the power, the voltage and the current are out of limit or not;
further, the determination of the optimal switching path includes,
when the power, the voltage and the current are out of limit, setting the genetic times as 0 again, carrying out selection, crossing and mutation operations, eliminating the individuals of which fitness function values are equal to the maximum value, namely the individuals which cannot meet the power flow calculation verification, immediately eliminating the individuals once the individuals appear, obtaining a new optimal path scheme after the genetic times reach the specified times, calculating the power flow distribution, and executing the program according to the scheme;
and when the power, the voltage and the current are not out of limit, outputting an optimal switching path, and ending the algorithm.
The invention combines the automatic ticket issuing function of the traditional operation ticket system, adds the function of optimal path selection, can realize the minimum switching times and reduce the scheduling time and the economic loss, has the function of load flow calculation and verification, realizes the load flow distribution judgment of the minimum path to meet the reliability requirement and achieves the advantage of economic and reliable combination.
Example 2
Referring to fig. 3 to 4, for the optimal path selection system for the operation ticket provided in this embodiment, the optimal path selection method for the operation ticket provided in the above embodiment can be implemented by depending on the system.
As shown in fig. 3 to 4, the optimal path selection system for operation tickets includes: the human-computer interaction interface 100 is used for inputting a program and an operation instruction for judging the optimal path and updating the contents of the knowledge rule base module 200 and the database module 300 according to the program and the instruction; the database module 300 is used for providing power data and historical operation tickets required by the reasoning module 400, and the knowledge rule base module 200 is used for providing states of all components and operation ticket generation rules; the inference module 400 includes an optimal path selection module 401 and a power flow calculation module 402, where the optimal path selection module 401 is configured to process the power data provided by the database module 200 to generate an operation ticket of an optimal path, and the power flow calculation module 402 is connected to the optimal path selection module 401 to determine whether power flow distribution in the optimal path meets system requirements.
The system further includes an operating system 500, configured to implement comprehensive management of the modules.
Specifically, the human-computer interaction interface 100 provides a visual operation interface, the control management of the operation system 500, the database module 300, the knowledge rule base module 200 and the inference module 400 is presented in a visual form, so that an operator can conveniently manage the system and each module, and the human-computer interaction interface 100 indirectly controls each module through the operation system 500 to update the contents of the database module 300 and the knowledge rule base module 200; the human-computer interaction interface 100 guides a genetic algorithm program input manually into the optimal path selection module 401, guides an operation instruction to be completed into the inference module 400, and displays an optimal path operation ticket obtained by the inference module 400 on the interface to realize an automatic ticket issuing function; in addition, the human-computer interaction interface 100 can also conduct import, export and modification maintenance operations on the power data and the historical operation tickets of the database module 300, conduct import, export and modification maintenance operations on the equipment state information of the knowledge rule base module 200, and input a logic control program to control the generation rule of the operation tickets; the inference module 400 inputs a genetic algorithm and a procedure of load flow calculation to realize selection of an optimal path and load flow calculation verification; and for the operating system 500, displaying the finally obtained optimal path operation ticket on an interface, and automatically printing the operation ticket.
The knowledge rule base module 200 stores various logic rules required by the state of the equipment and the generation of an operation ticket, the logic rules are controlled by an operation system 500 program and are managed, added and modified as required, the management of the knowledge rules needs to verify the identity of an operator on a human-computer interaction interface, the knowledge rule base adopts a management method of hierarchical rules, namely, a plurality of secondary rules are arranged below a primary rule, the secondary rules comprise a plurality of tertiary rules, and when the upper-level rules are changed, all the lower-level rules need to be changed, and the lower-level rules do not need to be changed; the database module 300 stores data and historical operation tickets of the power system, provides power system data for reasoning of the reasoning module 400 and historical operation tickets for the same scheduling situation, realizes importing and exporting of the power system data through operation of an operator on a human-computer interaction interface, and imports and exports the historical operation tickets according to operating system instructions, and the database module 300 has an automatic learning function and can realize a function of automatically updating the historical operation tickets.
The inference module 400 firstly judges whether the optimal path selection is needed according to an operation ticket instruction input by the human-computer interaction interface, directly calls a historical operation ticket in the database module for the operation ticket instruction which is already generated, returns the result to the human-computer interaction interface, generates an operation ticket of the optimal path by combining the power system data in the database and the operation ticket generation rule in the knowledge rule base for the condition that the optimal path selection is needed, and returns the result to the human-computer interaction interface.
The inference module 400 is divided into an optimal path selection module 401 and a power flow calculation module 402, the algorithm program in the optimal path selection module 401 is input by a human-computer interaction interface, the generation of the operation ticket of the optimal path is realized through a genetic algorithm, the load flow calculation module 402 realizes the load flow calculation of the power system under the optimal path, judges whether the load flow distribution under the optimal path meets the system requirements, the result generated by the optimal path selection module 401 is verified to ensure the reliability of the system operation, and can also prevent the system from misoperation, and if the current calculation result meets the requirement, the generated operation ticket is transmitted to the operation system 500, if the current calculation result does not meet the requirement, the path is used as a eliminated individual of the genetic algorithm, the optimal path is returned to the optimal path selection module 401 to recalculate the optimal path, and if the current calculation result meets the requirement, the generated operation ticket is transmitted to the operation system 500.
The operating system 500 directly controls each module, maintains and updates the database module 300 and the knowledge rule base module 400, imports an operation order instruction and exports an optimal path operation order to a human-computer interaction interface, the operating system 500 is used as a communication core of the human-computer interaction interface and each module, and all instructions and results are controlled by the operating system 500.
The working principle is as follows: determining the billing type and the operation task on the human-computer interaction interface 100, selecting the ticket type by an operator, judging whether an optimal path needs to be calculated by the operation system 500, if not, searching a historical operation ticket meeting the requirement in the database, if so, determining the initial topological structure of the power grid by the power data in the database and the switch state in the knowledge rule base, analyzing the topological structure by the inference module 400 by using graph theory and genetic algorithm, calculating the scheme of the optimal path by the optimal path selection module 401, verifying whether the scheme meets the system reliability by the power flow calculation module 402, otherwise, returning to the optimal path calculation module to recalculate the optimal path until the system reliability requirement is met, generating the operation ticket by the operation rule, and returning to the human-computer interaction interface to automatically print the ticket.
It should be recognized that embodiments of the present invention can be realized and implemented by computer hardware, a combination of hardware and software, or by computer instructions stored in a non-transitory computer readable memory. The methods may be implemented in a computer program using standard programming techniques, including a non-transitory computer-readable storage medium configured with the computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner, according to the methods and figures described in the detailed description. Each program may be implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the program(s) can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language. Furthermore, the program can be run on a programmed application specific integrated circuit for this purpose.
Further, the operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The processes described herein (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions, and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) collectively executed on one or more processors, by hardware, or combinations thereof. The computer program includes a plurality of instructions executable by one or more processors.
Further, the method may be implemented in any type of computing platform operatively connected to a suitable interface, including but not limited to a personal computer, mini computer, mainframe, workstation, networked or distributed computing environment, separate or integrated computer platform, or in communication with a charged particle tool or other imaging device, and the like. Aspects of the invention may be embodied in machine-readable code stored on a non-transitory storage medium or device, whether removable or integrated into a computing platform, such as a hard disk, optically read and/or write storage medium, RAM, ROM, or the like, such that it may be read by a programmable computer, which when read by the storage medium or device, is operative to configure and operate the computer to perform the procedures described herein. Further, the machine-readable code, or portions thereof, may be transmitted over a wired or wireless network. The invention described herein includes these and other different types of non-transitory computer-readable storage media when such media include instructions or programs that implement the steps described above in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described herein. A computer program can be applied to input data to perform the functions described herein to transform the input data to generate output data that is stored to non-volatile memory. The output information may also be applied to one or more output devices, such as a display. In a preferred embodiment of the invention, the transformed data represents physical and tangible objects, including particular visual depictions of physical and tangible objects produced on a display.
As used in this application, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being: a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of example, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the internet with other systems by way of the signal).
It should be noted that the above-mentioned embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, which should be covered by the claims of the present invention.
Claims (10)
1. An optimal path selection method suitable for operation tickets, characterized by comprising:
collecting the billing type and the operation task information and selecting the ticket sample type;
judging whether an optimal path needs to be calculated, if so, determining an initial topological structure of the power grid according to the power data in the database and the switch state in the knowledge rule base;
analyzing the initial topological structure of the power grid by using graph theory and a genetic algorithm, and calculating and selecting an optimal power supply path;
performing load flow calculation on the optimal power supply path scheme, and judging whether load flow distribution meets the requirement of system reliability;
if not, continuously searching an optimal power supply path;
if the optimal path is met, generating an operation ticket according to the operation rule, automatically printing a ticket sample, and completing the selection of the optimal path.
2. The optimal path selection method for operation tickets according to claim 1, characterized in that: the analyzing the initial topology of the power grid using a genetic algorithm includes,
acquiring the initial topological structure of the power grid, forming a node branch incidence matrix A, and acquiring the connection relation of the node branches;
forming an initial switch state vector according to the real-time switch state, and indicating whether the corresponding switch is closed or open;
forming a population by the switching state codes of each individual, comparing the population with the initial switching state vector to obtain switching times S, and determining a selection factor, a cross factor and a variation factor by taking the minimum switching times as an adaptive function to form a new population;
obtaining a node admittance matrix Y according to the node branch incidence matrix A and system parameters;
selecting individuals in the previous generation population to enter the next generation population according to the selection factors, selecting individuals through the cross factors to perform cross coding to enter a new population, and selecting individuals through the variation factors to perform coding change to enter the new population;
and judging whether the number of inheritance times is reached, if so, carrying out the next step, and if not, returning to the previous step.
3. The optimal path selection method for operation tickets according to claim 2, characterized in that: performing a power flow calculation on the optimal power supply path plan includes,
and (3) carrying out load flow calculation by adopting a Newton Raphson strategy:
and carrying out load flow calculation on the obtained individuals, and judging whether the power, the voltage and the current are out of limit or not.
4. The optimal path selection method for operation tickets according to any one of claims 1 to 3, characterized in that: the determination of the optimal switching path may include,
when the power, the voltage and the current are out of limit, setting the genetic times as 0 again, carrying out selection, crossing and mutation operations, eliminating individuals with fitness function values equal to the maximum value, namely the individuals which cannot meet the tidal current calculation verification, obtaining a new optimal path scheme after the genetic times reach the specified times, and calculating the tidal current distribution;
and when the power, the voltage and the current are not out of limit, outputting an optimal switching path, and finishing the algorithm.
5. An optimal path selection system for operation tickets, comprising:
the human-computer interaction interface (100) is used for inputting a program and an operation instruction for judging the optimal path and updating the contents of the knowledge rule base module (200) and the database module (300) according to the program and the instruction;
the database module (300) is used for providing power data and historical operation tickets required by the reasoning module (400), and the rule base module (200) is used for providing states of all components and operation ticket generation rules;
the inference module (400) comprises an optimal path selection module (401) and a power flow calculation module (402), wherein the optimal path selection module (401) is used for processing the power data provided by the database module (200) to generate an operation order of an optimal path, and the power flow calculation module (402) is connected with the optimal path selection module (401) to judge whether the power flow distribution under the optimal path meets the system requirements.
6. The optimal path selection system for an operation ticket according to claim 5, wherein: the system also comprises an operating system (500) used for realizing the comprehensive management of each module.
7. The optimal path selection system for an operation ticket according to claim 6, wherein: the human-computer interaction interface (100) provides a visual operation interface, an operator can conveniently manage the system and each module, and the human-computer interaction interface (100) indirectly controls each module through the operation system (500) to update the contents of the database module (300) and the knowledge rule base module (200).
8. The optimal path selection system for an operation ticket according to claim 7, wherein: the human-computer interaction interface (100) guides a genetic algorithm program which is manually input into the optimal path selection module (401), guides an operation instruction which needs to be completed into the reasoning module (400), and displays an optimal path operation ticket obtained by the reasoning module (400) on the interface to realize an automatic ticket drawing function.
9. The optimal path selection system for an operation ticket according to claim 8, wherein: the knowledge rule base module (200) stores various logic rules required by the state of the equipment and the generation of the operation ticket, and the logic rules are controlled by the program of the operating system (500) and are managed, added and modified as required.
10. The optimal path selection system for an operation ticket according to claim 9, wherein: the optimal path selection module (401) generates an optimal path operation ticket through a genetic algorithm, the power flow calculation module (402) performs power flow calculation on the power system under the optimal path, judges whether power flow distribution under the optimal path meets system requirements or not, transmits the generated operation ticket to the operation system (500) if the power flow distribution under the optimal path meets the system requirements, takes the path as a eliminated individual of the genetic algorithm if the power flow distribution under the optimal path does not meet the system requirements, and returns to the optimal path selection module (401) to recalculate the optimal path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110485323.4A CN113159443B (en) | 2021-04-30 | 2021-04-30 | Optimal path selection method and system suitable for operation ticket |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110485323.4A CN113159443B (en) | 2021-04-30 | 2021-04-30 | Optimal path selection method and system suitable for operation ticket |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113159443A true CN113159443A (en) | 2021-07-23 |
| CN113159443B CN113159443B (en) | 2023-10-24 |
Family
ID=76873124
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110485323.4A Active CN113159443B (en) | 2021-04-30 | 2021-04-30 | Optimal path selection method and system suitable for operation ticket |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113159443B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113792538A (en) * | 2021-08-27 | 2021-12-14 | 北京科东电力控制系统有限责任公司 | Method and device for quickly generating operation ticket of power distribution network |
| CN117436703A (en) * | 2023-11-27 | 2024-01-23 | 国网江苏省电力有限公司扬州供电分公司 | Power transmission work ticket safety measure generation method based on genetic algorithm |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003219558A (en) * | 2002-01-24 | 2003-07-31 | Hitachi Ltd | Distribution system controller and distribution system configuration creating device |
| WO2011069061A1 (en) * | 2009-12-04 | 2011-06-09 | Abb Research Ltd | Restoration switching analysis with genetic algorithm |
| CN103368190A (en) * | 2013-07-17 | 2013-10-23 | 国家电网公司 | Method for controlling low-voltage load on-line phasing |
| CN103714491A (en) * | 2013-12-16 | 2014-04-09 | 天津大学 | Power grid dispatching operation order optimum sequence generation method based on risk |
| CN104778632A (en) * | 2015-03-31 | 2015-07-15 | 国网福建省电力有限公司 | Intelligent decision making aiding method and system for transfer power supply |
| CN104809519A (en) * | 2015-04-29 | 2015-07-29 | 国家电网公司 | Power-system economic dispatching method considering power grid topology optimization |
| CN107093928A (en) * | 2017-03-31 | 2017-08-25 | 贵州电网有限责任公司凯里供电局 | Power distribution network scheduling aid decision and trouble analysis system |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
-
2021
- 2021-04-30 CN CN202110485323.4A patent/CN113159443B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003219558A (en) * | 2002-01-24 | 2003-07-31 | Hitachi Ltd | Distribution system controller and distribution system configuration creating device |
| WO2011069061A1 (en) * | 2009-12-04 | 2011-06-09 | Abb Research Ltd | Restoration switching analysis with genetic algorithm |
| CN103368190A (en) * | 2013-07-17 | 2013-10-23 | 国家电网公司 | Method for controlling low-voltage load on-line phasing |
| CN103714491A (en) * | 2013-12-16 | 2014-04-09 | 天津大学 | Power grid dispatching operation order optimum sequence generation method based on risk |
| CN104778632A (en) * | 2015-03-31 | 2015-07-15 | 国网福建省电力有限公司 | Intelligent decision making aiding method and system for transfer power supply |
| CN104809519A (en) * | 2015-04-29 | 2015-07-29 | 国家电网公司 | Power-system economic dispatching method considering power grid topology optimization |
| CN107093928A (en) * | 2017-03-31 | 2017-08-25 | 贵州电网有限责任公司凯里供电局 | Power distribution network scheduling aid decision and trouble analysis system |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
Non-Patent Citations (10)
| Title |
|---|
| 傅军栋;岳靖林;: "智能调度故障操作票生成系统研究", 现代电子技术, no. 13, pages 138 - 142 * |
| 夏媚珠 等: "基于改进遗传算法配电网络重构的研究", 《 科协论坛(下半月)》, pages 97 - 99 * |
| 曾凯: "基于风险理论的电网智能调度操作票系统的研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 曾凯: "基于风险理论的电网智能调度操作票系统的研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》, no. 5, 15 May 2015 (2015-05-15), pages 11 - 20 * |
| 林晓庆 等: "基于网络重构的电网智能调度操作票系统开发研究", 《电力系统保护与控制》 * |
| 林晓庆 等: "基于网络重构的电网智能调度操作票系统开发研究", 《电力系统保护与控制》, vol. 40, no. 7, 1 April 2012 (2012-04-01), pages 144 - 146 * |
| 王敏等: "混沌遗传算法在船舶电力系统供电恢复中的应用研究", 《江苏科技大学学报(自然科学版)》 * |
| 王敏等: "混沌遗传算法在船舶电力系统供电恢复中的应用研究", 《江苏科技大学学报(自然科学版)》, no. 05, 15 October 2008 (2008-10-15), pages 6 - 10 * |
| 郭琳 等: "基于非线性整数规划的配网负荷转供优化建模", 《机电工程技术》 * |
| 郭琳 等: "基于非线性整数规划的配网负荷转供优化建模", 《机电工程技术》, vol. 45, no. 10, 26 October 2016 (2016-10-26), pages 96 - 100 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113792538A (en) * | 2021-08-27 | 2021-12-14 | 北京科东电力控制系统有限责任公司 | Method and device for quickly generating operation ticket of power distribution network |
| CN113792538B (en) * | 2021-08-27 | 2024-05-14 | 北京科东电力控制系统有限责任公司 | Method and device for rapidly generating operation ticket of power distribution network |
| CN117436703A (en) * | 2023-11-27 | 2024-01-23 | 国网江苏省电力有限公司扬州供电分公司 | Power transmission work ticket safety measure generation method based on genetic algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113159443B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Şerban et al. | Artificial intelligence for smart renewable energy sector in europe—smart energy infrastructures for next generation smart cities | |
| Lara et al. | Robust energy management of isolated microgrids | |
| CN108491969B (en) | Big data-based space load prediction model construction method | |
| Jabr et al. | A primal-dual interior point method for optimal power flow dispatching | |
| CN104424512B (en) | Operation planning decision-making technique and operation planning decision system | |
| US6735596B2 (en) | Computer method and user interface for decision analysis and for global system optimization | |
| Wang et al. | An approach for integrated generation and transmission maintenance scheduling considering N-1 contingencies | |
| CN113159443A (en) | Optimal path selection method and system suitable for operation order | |
| Oree et al. | A multi-objective framework for long-term generation expansion planning with variable renewables | |
| CN104252652A (en) | Space load predicting method in electricity system | |
| Sharma et al. | Development of multi-objective scheduling model for construction projects using opposition-based NSGA III | |
| CN111932072A (en) | OS2 architecture-based power grid comprehensive management and control method and system | |
| CN111680452A (en) | Power grid engineering accurate investment decision simulation method based on full-factor data mining | |
| Shendryk et al. | Decision making for energy management in smart grid | |
| Valencia-Calvo et al. | Non-smooth dynamics in energy market models: a complex approximation from system dynamics and dynamical systems approach | |
| CN110378510A (en) | A kind of distribution material requirements prediction technique being polymerize based on time series and level | |
| US20230196292A1 (en) | Planning method and planning apparatus for production capacity allocation | |
| CN105186686A (en) | Full network topology-based power grid dispatching intelligent anti-error strategy system | |
| CN109842121B (en) | Multi-stage multi-region cooperative control load reduction online simulation modeling method and system | |
| CN105741016A (en) | Static reliability probability index acquiring method for medium-term power grid planning | |
| Saric et al. | Two-stage stochastic programming model for market clearing with contingencies | |
| CN103729739B (en) | High-and-low-level grid operation mode network model integration system based on PSD-BPA | |
| CN116128270A (en) | Power grid operation plan management method and device for multi-source data fusion | |
| Farghal et al. | Generation expansion planning: an expert system approach | |
| CN113783179B (en) | Power grid load prediction and optimization method |
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 |