CN113256051A - Heuristic method for compiling and processing maintenance plan of generator set - Google Patents

Heuristic method for compiling and processing maintenance plan of generator set Download PDF

Info

Publication number
CN113256051A
CN113256051A CN202110279858.6A CN202110279858A CN113256051A CN 113256051 A CN113256051 A CN 113256051A CN 202110279858 A CN202110279858 A CN 202110279858A CN 113256051 A CN113256051 A CN 113256051A
Authority
CN
China
Prior art keywords
maintenance
unit
reliability
adjustment
overhaul
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
Application number
CN202110279858.6A
Other languages
Chinese (zh)
Other versions
CN113256051B (en
Inventor
代江
赵翔宇
张涛
王永刚
赵维兴
单克
田年杰
唐建兴
姜有泉
朱思霖
赵倩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guizhou Power Grid Co Ltd
Original Assignee
Guizhou Power Grid Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guizhou Power Grid Co Ltd filed Critical Guizhou Power Grid Co Ltd
Priority to CN202110279858.6A priority Critical patent/CN113256051B/en
Publication of CN113256051A publication Critical patent/CN113256051A/en
Application granted granted Critical
Publication of CN113256051B publication Critical patent/CN113256051B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/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
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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"
    • 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/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • 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/20—Administration of product repair or maintenance
    • 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)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Educational Administration (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Mining & Analysis (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention discloses a heuristic method for compiling a maintenance plan of a generator set, which primarily compiles the maintenance plan by determining the capacity of the maintenance unit and the adjustment cost of the willingness of the maintenance unit; then designing a reliability index based on the loss load electric quantity for measuring the reliability of the system, establishing a loss load calculation model based on the N-1 fault set, calculating the reliability of each time period and verifying the reliability; determining an evaluation index according to the capacity and the willingness adjustment cost of the maintenance unit, and after screening out maintenance time intervals in which the reliability check cannot pass, arranging the units according to the descending order of the evaluation index to form an adjustment set; and traversing the adjustment set in sequence, adjusting each unit in the adjustment set according to the maximum window residual area principle, and performing reliability verification again after each adjustment until the reliability verification of all time periods is passed. The invention applies the idea of filling the window with the same area to the compilation of the maintenance plan of the unit, is easy to implement, and provides a new idea and a method with strong operability for the compilation of the maintenance plan of the unit.

Description

Heuristic method for compiling and processing maintenance plan of generator set
Technical Field
The invention relates to the technical field of generator set maintenance, in particular to a heuristic method for compiling and processing a maintenance plan of a generator set.
Background
With the advance of the electric power marketization process, the traditional sending, transporting and distributing monopoly management mechanism is broken, the plant network is separated, and the original power grid company and the power generation company are gradually separated. For power generation companies, unit maintenance is an important guarantee for stable operation of the system. The good maintenance plan can not only pre-evaluate the potential operation risk of the unit, but also prolong the service life of the unit, reduce the probability of uncertain faults of the unit in the operation process and further improve the operation stability of the system. With the independent operation of the power generation company, the unit maintenance planning arrangement is changed from a mode determined based on the negotiation between the market and the dispatching organization from the leading of the traditional dispatching organization, and the compilation of the unit maintenance plan is confronted with new changes and challenges.
At present, the unit maintenance problem can be regarded as an optimization problem of maintenance technology, and a mathematical model of the unit maintenance problem changes along with changes of planning targets and constraint conditions. At present, the modeling of the generator set maintenance problems at home and abroad is mainly divided into three categories: firstly, the system operation reliability is taken as an optimization target, and conditions such as system operation constraint, maintenance constraint and the like are added to seek a feasible solution of the optimization target; secondly, the system economy is taken as an optimization target, the system reliability is often embedded into an economy objective function as constraint or converted cost, and system constraint and maintenance constraint are considered at the same time; and thirdly, taking the operation reliability and the economy of the system as optimization targets, and converting the maintenance planning model into a single target or multiple targets and nonlinear problems. The three methods belong to a typical mathematical modeling method, when the method is applied to the practical situation, due to the factors of large number of overhaul machine sets, complex operation of a power grid and the like, the result of an overhaul plan has certain deviation, the market fairness of a generator in a competitive overhaul period is mostly ignored during modeling, and the joint coordination constraint of the power grid transmission capacity and the system reserve capacity on the safe operation of the system is not considered when constraint conditions are set, so that the obtained overhaul plan does not completely meet the principle of negotiation and formulation of a market and a scheduling mechanism, and is not suitable for the power market environment.
Disclosure of Invention
In view of this, the invention designs a unit maintenance plan compilation method considering fairness and system stability based on the current large background of electric power marketization and the current situation of unit maintenance research, and the first aspect of the invention aims to provide a compilation processing method of a heuristic unit maintenance plan.
The purpose of the first aspect of the invention is realized by the following technical scheme:
a heuristic method for compiling and processing a maintenance plan of a generator set is characterized in that: the method comprises the following steps:
step S1: determining the capacity of a maintenance unit and the adjustment cost of the maintenance unit willingness;
step S2: primarily compiling a maintenance plan;
step S3, designing a reliability index based on the loss load electric quantity for measuring the reliability of the system, establishing a loss load calculation model based on an N-1 fault set, calculating the reliability of each time period and verifying the reliability;
step S4, determining an evaluation index according to the capacity and the willingness adjustment cost of the maintenance unit, and after screening out the maintenance time interval in which the reliability check fails, arranging the units according to the sequence of the evaluation index from large to small to form an adjustment set;
step S5: and traversing the adjustment set in sequence, adjusting each unit in the adjustment set according to the maximum window residual area principle, and performing reliability verification again after each adjustment until the reliability verification of all time periods is passed.
Further, the specific step of step S2 includes: the unit maintenance problem is regarded as the problem of filling a window according to an equal-area principle, then the area of the maintenance window is corrected based on the available transmission capacity of a power grid and the coordination constraint of system power generation standby, and then the maintenance plan of each unit is arranged by adopting an improved heuristic algorithm.
Further, the flow of the improved heuristic algorithm is as follows:
1) selecting a power generation standby C of a system in a maintenance period imCurve and minimum available transmission capacity CATCThe minimum value of the curve and the value of the lower curve are taken as the area of the access window. Namely the area of the access window:
Si＝min{Cm,CATC},i＝1,2,…T (1)
2) calculating the average area of T windows
Figure BDA0002978329280000025
Namely, it is
Figure BDA0002978329280000021
2) Calculating the area S of each window in turniAnd average area
Figure BDA0002978329280000022
A difference of
Figure BDA0002978329280000023
3) Screening of continuous Si' more than or equal to 0 window, T windows all have an Si' value, traverse all windows, screen out consecutive SiA series of windows of' more than or equal to 0 are arranged according to the continuous number m of the windows from large to small to form a continuous arrangement window set
Figure BDA0002978329280000024
4) Selecting units to be filled into a continuous window set Q
For any place Si'continuous m windows more than or equal to 0, calculating the unit overhaul capacity x' most suitable for being placed in the continuous windows according to a formula which meets the requirement that the residual area of the windows is in a considerable level after the units are filled, namely, the power generation abundant capacity of each time interval after the overhaul units are arranged in the corresponding time interval is nearly equal, and the stable operation of the system can be ensured;
min{|Si1′-x′|+|Si2′-x′|+…|Sim′-x′|} (4)
5) principle of filling windows in equal area
When the window is filled, filling is carried out according to the following principle:
a) sequentially traversing the continuously arranged window set, and firstly carrying out alignment on a series of continuous windows with the maximum m
Figure BDA0002978329280000031
Filling, finding out the maintenance duration period T which is closest to mjAnd the unit with the maintenance capacity x closest to the x', and filling the maintenance unit into m continuous windows QkTo (1);
b) in the subset of contiguous windows with a maximum of m1After unit filling, selecting the subset arrangement sequence in the continuous arrangement window set QSecond subset Q2So as to traverse all subsets Q of Qk；
c) If a certain maintenance unit can be placed in a continuous window set at different positions, determining the positions where the units need to be placed according to the following rules:
Figure BDA0002978329280000032
continuous window set Q for filling overhaul unit to different positionskThen, the sum of the remaining areas is determined
Figure BDA0002978329280000033
Compared with
Figure BDA0002978329280000034
Whether or not to approach 0, and if so, selecting to fill
Figure BDA0002978329280000035
Set of consecutive windows Q having the longest step size experienced in the process of approaching 0k。
Further, the specific steps in step S3 are as follows:
(1) the design reliability index r is:
Figure BDA0002978329280000036
in the formula, LmThe maximum load value in the overhaul period (one week),
Figure BDA0002978329280000041
the expected value of the load loss in the maintenance period (one week);
(2) n-1 fault set-based load loss calculation model
1) Objective function
For any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure BDA0002978329280000042
in the formula, alpha and beta are respectively a power generation cost coefficient and a load loss coefficient in any overhaul period, are determined by the running condition of the system and are used for adjusting the weight of optimization targets in two aspects; gamma is a social benefit coefficient of the loss load electricity, and is generally 20-50 times of the normal electricity price; NG is the number of units in normal operation; ck PThe production cost of the unit k; p (k, t) is the output value of the unit k in the t period; hwIs the number of hours per time interval (in one week, H is the unit of overhaul)w＝168h)；
Figure BDA0002978329280000043
The load loss electric quantity of the first load node is the load loss electric quantity when the fault occurs;
2) the power balance constraint is shown as follows:
Figure BDA0002978329280000044
in the formula, PGi(t) the generator set i outputs power in a time period t; NH is the total number of tie lines; t ish(t) represents the planned power of the tie-line h (positive input, negative output) over time period t;
Figure BDA0002978329280000045
the load electric quantity of the l load node is;
Figure BDA0002978329280000046
the load loss electric quantity of the first load node is the load loss electric quantity when the fault occurs;
3) the unit output constraints are as follows:
for any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure BDA0002978329280000047
in the formula (I), the compound is shown in the specification,
Figure BDA0002978329280000048
the minimum force output value and the maximum force output value of the generator set i are obtained;
4) the loss constraint is shown as follows:
Figure BDA0002978329280000049
5) the line flow constraint is given by:
Figure BDA0002978329280000051
in the formula, Pl maxIs the transmission capacity limit of line l; l is a transmission line set;
6) the cross-sectional flow constraint is shown as follows:
Figure BDA0002978329280000052
in the formula, Ps minAnd Ps maxRespectively the tidal current transmission limit of the section s; s is a section set;
(3) system reliability check during maintenance period
For any maintenance period, if N line faults occur, the load loss model needs to be calculated for N times to obtain a load loss expected value, and the calculation formula is as follows:
Figure BDA0002978329280000053
setting a reliability criterion r0Checking the r value of each time interval, if r is more than or equal to r0Then, thenThe reliability of the time interval meets the requirement; if r is less than r0Then the maintenance schedule for that period needs to be adjusted.
Further, in step S4, the evaluation index is used to indicate a unit overhaul intention degree, and when the unit is to be overhauled, adjustment sets may be formed in an order from a low overhaul intention adjustment value to a high overhaul intention adjustment value, and the specific steps of step S4 are as follows:
(1) defining the adjustment value of the overhaul will of the unit as follows:
Figure BDA0002978329280000054
in the formula, alphaiMaintenance factor, P, set for ISO according to the operating conditions of the system at each time intervalriThe adjustment cost provided for the generator is calculated according to the historical average power generation amount of the unit; t isiThe maintenance duration of the ith generator; cmAnd the unit overhaul capacity is obtained.
(2) The willingness adjustment cost declared by the generator is as follows:
Figure BDA0002978329280000055
in the formula, λri1、λri,2Reporting node electricity prices of the overhaul time interval and the actual overhaul time interval;
Figure BDA0002978329280000056
the average power generation amount of the unit i in the last year is equal to the actual power generation amount of the last year divided by the number of power generation time periods.
(3) Arranging the units in the time interval needing to be adjusted from large to small according to the overhaul intention value to form an overhaul adjustment set { beta }1,β2,…βm}
Further, in the step S5, the desired value is β1And a maintenance capacity of CmWhen the unit is adjusted to the ith time interval, the following conditions are required to be met:
Figure BDA0002978329280000061
and traversing the units in the maintenance adjustment set in sequence, and performing maintenance adjustment on the units until the system reliability of each maintenance period meets the requirement.
It is an object of a second aspect of the invention to provide a computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method as described above when executing the computer program.
It is an object of a third aspect of the invention to provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the method as previously described.
Compared with the prior art, the invention has the beneficial effects that:
(1) and introducing an available transmission capacity concept, and considering the transmission capacity of a power grid and the combined decision of system standby when the maintenance plan is made, so as to ensure the stable operation of the system.
(2) The maintenance planning process is regarded as an equal-area filling window, and a method for simply arranging the maintenance units is designed and is easy to implement.
(3) Introducing a concept of system reliability, establishing a load loss model based on an N-1 fault set, solving the system reliability value of each maintenance period, comparing the reliability value with the system set reliability value, determining the maintenance period needing to be adjusted, and greatly ensuring the reliability;
(4) the units in the adjusting time period are arranged from small to large according to the overhaul intention value to form an adjusting set, and the units in the adjusting set are adjusted in sequence, so that the balance in multiple aspects is realized, and the unity of fairness and effectiveness is reflected.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the present invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings, in which:
FIG. 1 is an overall flow chart of the method of the present invention;
FIG. 2 is a schematic diagram of a power generation backup curve and a minimum available transmission capacity curve for a system over T service periods;
FIG. 3 is a flow chart of an improved heuristic algorithm.
Detailed Description
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. It should be understood that the preferred embodiments are illustrative of the invention only and are not limiting upon the scope of the invention.
It should be noted that the unit maintenance planning refers to making a periodic maintenance plan one or two years ahead of time, so as to ensure that the system still operates stably when a part of the units in the maintenance window are maintained. The design idea of the invention is based on the following considerations:
generally, the index for measuring the stable operation of the system is the spare capacity of the system power generation, namely
Ai＝Csi-Lmi-r0Lmi＝Csi-(1+r0)Lmi (1)
In the formula, AiFor the system generating reserve capacity in the ith overhaul period, CsiIs the total installed capacity, L, of the system in the ith maintenance windowmiIs the peak load (a certain week) of the system, r0For a given reliability requirement, it is typically 7% to 10%.
Defining a power generation abundant capacity for a certain overhaul period i:
A′i＝Csi-Cmi-Lmi-r0Lmi＝Csi-Cmi-(1+r0)Lmi (2)
of formula (II) to'iIs abundant for power generationCapacity, CmiTo schedule the power generation capacity for service (a week). When A'iWhen the time is more than or equal to 0, the maintenance plan in the time period i does not cause the problem of insufficient system standby; when A'iIf the frequency is less than 0, the problem of insufficient system standby is caused, so that the maintenance schedule of the generator set needs to be adjusted.
The maintenance planning needs to ensure the stable operation of the system, and the primary judgment standard is that the power generation abundance capacity of the system is still larger than 0 in the maintenance period. Because the maintenance plan is usually periodic in weeks, that is, when the core content of the maintenance plan is to arrange the unit needing maintenance in T periods (if a maintenance plan of one year is compiled, T is 52), the capacity of the unit needing maintenance is ensured to be less than or equal to the power generation standby a of the system when maintenance is not arranged. Namely, it is
Cm≤A (3)
Therefore, the maintenance plan can be considered as a heuristic problem according to the maintenance window equal-area filling principle, namely: (1) regarding the T overhaul periods as T windows with different areas, the area S of the window iiRepresenting a system power generation standby A when the unit maintenance is not arranged; (2) the n machine sets with different overhaul capacities are regarded as n machine sets with different sizes; (3) because each unit has its maintenance duration period T when in maintenancejThe planning process of the unit maintenance plan can be analogized to arranging n units with different maintenance capacities (different areas) to T windows with different areas, and filling the unit into T when each unit is arrangedjIn a continuous window, there is still some space left in the window after the unit is arranged in the window.
The overall implementation flow of the invention is shown in fig. 1, and the invention provides a heuristic generating set maintenance plan compiling and processing method, which comprises the following steps:
step S1: determining the capacity of a maintenance unit and the adjustment cost of the maintenance unit willingness;
step S2: primarily compiling a maintenance plan;
the available transmission capacity of the power grid can reflect the stable operation condition of the system, and can provide transmission blockage related information for market generators, thereby being beneficial to the generators to make risk economic decisions. Therefore, when the maintenance plan is compiled, the constraint of the unit maintenance and the constraint of the transmission capacity of the power grid side are considered.
(1) Method for calculating window area
Generally, the available transmission capacity of the grid should be greater than the minimum available transmission capacity CATC. Therefore, the area of the window needs to be adjusted before the window filling. FIG. 2 shows a power generation standby C of the system in T maintenance periodsmCurve and minimum available transmission capacity CATCAnd selecting the value of the lower curve as the area of the maintenance window. Namely the area of the access window:
Si＝min{Cm,CATC},i＝1,2,…T (1)
(2) improved heuristic method for filling window according to equal-area principle
In order to fill the units with different n-surface areas into the T windows, the invention designs the following improved heuristic algorithm, wherein a flow chart for realizing the improved heuristic algorithm is shown in fig. 2, and the specific steps comprise:
1) calculating the average area of T windows
Figure BDA0002978329280000081
Namely, it is
Figure BDA0002978329280000082
2) Calculating the area S of each window in turniAnd average area
Figure BDA0002978329280000083
A difference of
Figure BDA0002978329280000084
3) Screening of continuous S'iA window of more than or equal to 0. T windows all have one S'iValue, traversing all windows, and screening out continuous S'iA series of windows not less than 0Arranging the windows according to the continuous number m of the windows from large to small to form a continuous arrangement window set
Figure BDA0002978329280000085
4) Selecting units to be filled into a continuous window set Q
For any one S'iAnd (3) calculating the unit overhaul capacity x' which is most suitable for being placed in the continuous window according to a formula, wherein the formula meets the requirement that the residual area of the window is in a considerable level after the unit is filled, namely the power generation abundant capacity of each time interval after the overhaul unit is arranged in the corresponding time interval is approximately equal, and the stable operation of the system can be ensured.
min{|Si1′-x′|+|Si2′-x′|+…|Sim′-x′|} (4)
5) Principle of filling windows in equal area
When the window is filled, filling is carried out according to the following principle: a) sequentially traversing the continuously arranged window set, and firstly carrying out alignment on a series of continuous windows with the maximum m
Figure BDA0002978329280000091
Filling, finding out the maintenance duration period T which is closest to mjAnd the unit with the maintenance capacity x closest to the x', and filling the maintenance unit into m continuous windows QkAmong them. b) In the subset of contiguous windows with a maximum of m1After unit filling, selecting a second subset Q according to the subset arrangement sequence in the continuous arrangement window set Q2So as to traverse all subsets Q of Qk. c) If a certain maintenance unit can be placed in a continuous window set at different positions, determining the positions where the units need to be placed according to the following rules:
Figure BDA0002978329280000092
continuous window set Q for filling overhaul unit to different positionskThen, the sum of the remaining areas is determined
Figure BDA0002978329280000093
Compared with
Figure BDA0002978329280000094
Whether or not to approach 0, and if so, selecting to fill
Figure BDA0002978329280000095
Set of consecutive windows Q having the longest step size experienced in the process of approaching 0k。
Step S3, designing a reliability index based on the loss load electric quantity for measuring the reliability of the system, establishing a loss load calculation model based on an N-1 fault set, calculating the reliability of each time period and verifying the reliability;
after a unit maintenance plan is preliminarily compiled, the invention provides a reliability index for verifying the stable operation of the system in each maintenance period.
(1) The design reliability index r is:
Figure BDA0002978329280000096
in the formula, LmThe maximum load value in the overhaul period (one week),
Figure BDA0002978329280000097
the expected value of the load loss in the overhaul period (one week) is shown.
(2) N-1 fault set-based load loss calculation model
1) Objective function
For any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure BDA0002978329280000101
in the formula (I), the compound is shown in the specification,alpha and beta are respectively a power generation cost coefficient and a load loss coefficient in any overhaul period, are determined by the running condition of the system and are used for adjusting the weight of optimization targets in two aspects; gamma is a social benefit coefficient of the loss load electricity, and is generally 20-50 times of the normal electricity price; NG is the number of units in normal operation; ck PThe production cost of the unit k; p (k, t) is the output value of the unit k in the t period; hwIs the number of hours per time interval (in one week, H is the unit of overhaul)w＝168h)；
Figure BDA0002978329280000102
The load loss electric quantity of the ith load node when the fault occurs is shown.
2) The power balance constraint is shown as follows:
Figure BDA0002978329280000103
in the formula, PGi(t) the generator set i outputs power in a time period t; NH is the total number of tie lines; t ish(t) represents the planned power of the tie-line h (positive input, negative output) over time period t;
Figure BDA0002978329280000104
the load electric quantity of the l load node is;
Figure BDA0002978329280000105
the load loss electric quantity of the ith load node when the fault occurs is shown.
3) The unit output constraints are as follows:
for any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure BDA0002978329280000106
in the formula (I), the compound is shown in the specification,
Figure BDA0002978329280000107
and the minimum force output value and the maximum force output value of the generator set i are obtained.
4) The loss constraint is shown as follows:
Figure BDA0002978329280000108
5) the line flow constraint is given by:
Figure BDA0002978329280000109
in the formula, Pl maxIs the transmission capacity limit of line l; and L is a transmission line set.
6) The cross-sectional flow constraint is shown as follows:
Figure BDA0002978329280000111
in the formula, Ps minAnd Ps maxRespectively the tidal current transmission limit of the section s; and S is a section set.
(3) System reliability check during maintenance period
For any maintenance period, if N line faults occur, the load loss model needs to be calculated for N times to obtain a load loss expected value, and the calculation formula is as follows:
Figure BDA0002978329280000112
setting a reliability criterion r0Checking the r value of each time interval, if r is more than or equal to r0If so, the reliability of the time interval meets the requirement; if r is less than r0Then the maintenance schedule for that period needs to be adjusted.
Step S4, determining an evaluation index according to the capacity and the willingness adjustment cost of the maintenance unit, and after screening out the maintenance time interval in which the reliability check fails, arranging the units according to the sequence of the evaluation index from large to small to form an adjustment set;
the method specifically comprises the following steps:
when the reliability of the system in a certain overhaul period does not meet the requirement, the overhaul plan in the period needs to be adjusted. The invention provides an index representing the unit maintenance intention degree in the power market environment, and an adjustment set can be formed according to the sequence of the maintenance intention adjustment values from low to high when the unit is adjusted and maintained.
Defining the adjustment value of the overhaul will of the unit as follows:
Figure BDA0002978329280000113
in the formula, alphaiMaintenance factor, P, set for ISO according to the operating conditions of the system at each time intervalriThe adjustment cost provided for the generator is calculated according to the historical average power generation amount of the unit; t isiThe maintenance duration of the ith generator; cmAnd the unit overhaul capacity is obtained.
The willingness adjustment cost declared by the generator is as follows:
Figure BDA0002978329280000114
in the formula, λri1、λri,2Reporting node electricity prices of the overhaul time interval and the actual overhaul time interval;
Figure BDA0002978329280000115
the average power generation amount of the unit i in the last year is equal to the actual power generation amount of the last year divided by the number of power generation time periods.
Arranging the units in the time interval needing to be adjusted from large to small according to the overhaul intention value to form an overhaul adjustment set { beta }1,β2,…βm}。
Step S5: and traversing the adjustment set in sequence, adjusting each unit in the adjustment set according to the maximum window residual area principle, and performing reliability verification again after each adjustment until the reliability verification of all time periods is passed. The method specifically comprises the following steps:
for a desired value of β1And a maintenance capacity of CmWhen the unit is adjusted to the ith time interval, the following conditions are required to be met:
Figure BDA0002978329280000121
and traversing the units in the maintenance adjustment set in sequence, and performing maintenance adjustment on the units until the system reliability of each maintenance period meets the requirement.
The invention has the following pioneering advantages:
(1) the idea of filling the window with the same area is applied to the establishment of the maintenance plan of the unit, an improved heuristic method for the maintenance establishment of the unit is designed, the method is simple and easy to implement, and a new idea and a new method are provided for the establishment of the maintenance plan of the unit;
(2) the design of reliable operation indexes of a measurement system and the establishment of a calculation model of related indexes provide theoretical basis and judgment basis for the adjustment of a maintenance plan;
(3) an evaluation index considering the maintenance willingness degree of a generator to a declaration unit and considering fairness can form an adjustment unit set based on the evaluation index;
(4) providing a method for coordinating available transmission capacity constraint and power generation standby constraint to ensure stable operation of a power grid;
(5) an advanced maintenance planning and adjusting process is provided, and fairness and stable operation of the system are considered.
It should be noted that any process or method descriptions in flow charts of the present invention or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and that the scope of the preferred embodiments of the present invention includes additional implementations in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, and the program may be stored in a computer readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the embodiments, it will 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, and all of them should be covered in the claims of the present invention.

Claims (8)

1. A heuristic method for compiling and processing a maintenance plan of a generator set is characterized in that: the method comprises the following steps:
step S1: determining the capacity of a maintenance unit and the adjustment cost of the maintenance unit willingness;
step S2: primarily compiling a maintenance plan;
step S3, designing a reliability index based on the loss load electric quantity for measuring the reliability of the system, establishing a loss load calculation model based on an N-1 fault set, calculating the reliability of each time period and verifying the reliability;
step S4, determining an evaluation index according to the capacity and the willingness adjustment cost of the maintenance unit, and after screening out the maintenance time interval in which the reliability check fails, arranging the units according to the sequence of the evaluation index from large to small to form an adjustment set;
step S5: and traversing the adjustment set in sequence, adjusting each unit in the adjustment set according to the maximum window residual area principle, and performing reliability verification again after each adjustment until the reliability verification of all time periods is passed.
2. A heuristic generating set maintenance scheduling compilation processing method according to claim 1, characterized in that: the specific steps of step S2 include: the unit maintenance problem is regarded as the problem of filling a window according to an equal-area principle, then the area of the maintenance window is corrected based on the available transmission capacity of a power grid and the coordination constraint of system power generation standby, and then the maintenance plan of each unit is arranged by adopting an improved heuristic algorithm.
3. A heuristic generating set maintenance scheduling compilation processing method according to claim 2, characterized in that: the flow of the improved heuristic algorithm is as follows:
1) selecting a power generation standby C of a system in a maintenance period imCurve and minimum available transmission capacity CATCThe minimum value of the curve and the value of the lower curve are taken as the area of the inspection window(ii) a Namely the area of the access window:
Si＝min{Cm,CATC},i＝1,2,…T (1)
2) calculating the average area of T windows
Figure FDA0002978329270000011
Namely, it is
Figure FDA0002978329270000012
3) Calculating the area S of each window in turniAnd average area
Figure FDA0002978329270000013
A difference of
Figure FDA0002978329270000014
4) Screening of continuous Si' more than or equal to 0 window, T windows all have an Si' value, traverse all windows, screen out consecutive SiA series of windows of' more than or equal to 0 are arranged according to the continuous number m of the windows from large to small to form a continuous arrangement window set
Figure FDA0002978329270000015
5) Selecting units to be filled into a continuous window set Q
For any place Si'continuous m windows more than or equal to 0, and the unit overhaul capacity x' most suitable for being placed in the continuous windows is calculated according to the following formula, wherein the formula meets the condition that the residual areas of the windows are in the approximately equal level after the units are filled, namely the power generation abundant capacity of each time period is approximately equal after the overhaul units are arranged in the corresponding time period, and the stable operation of the system can be ensured;
min{|Si1′-x′|+|Si2′-x′|+…|Sim′-x′|} (4)
5) principle of filling windows in equal area
When the window is filled, filling is carried out according to the following principle:
a) sequentially traversing the continuously arranged window set, and firstly carrying out alignment on a series of continuous windows with the maximum m
Figure FDA0002978329270000021
Filling, finding out the maintenance duration period T which is closest to mjAnd the unit with the maintenance capacity x closest to the x', and filling the maintenance unit into m continuous windows QkTo (1);
b) in the subset of contiguous windows with a maximum of m1After unit filling, selecting a second subset Q according to the subset arrangement sequence in the continuous arrangement window set Q2So as to traverse all subsets Q of Qk；
c) If a certain maintenance unit can be placed in a continuous window set at different positions, determining the positions where the units need to be placed according to the following rules:
Figure FDA0002978329270000022
continuous window set Q for filling overhaul unit to different positionskThen, the sum of the remaining areas is determined
Figure FDA0002978329270000023
Compared with
Figure FDA0002978329270000024
Whether or not to approach 0, and if so, selecting to fill
Figure FDA0002978329270000025
Set of consecutive windows Q having the longest step size experienced in the process of approaching 0k。
4. A heuristic generating set maintenance scheduling compilation processing method according to claim 1, characterized in that: the specific steps in step S3 are as follows:
(1) the design reliability index r is:
Figure FDA0002978329270000031
in the formula, LmThe maximum load value in the overhaul period (one week),
Figure FDA0002978329270000032
the expected value of the load loss in the maintenance period (one week);
(2) n-1 fault set-based load loss calculation model
1) Objective function
For any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure FDA0002978329270000033
in the formula, alpha and beta are respectively a power generation cost coefficient and a load loss coefficient in any overhaul period, are determined by the running condition of the system and are used for adjusting the weight of optimization targets in two aspects; gamma is a social benefit coefficient of the loss load electricity, and is generally 20-50 times of the normal electricity price; NG is the number of units in normal operation; ck PThe production cost of the unit k; p (k, t) is the output value of the unit k in the t period; hwIs the number of hours per time interval (in one week, H is the unit of overhaul)w＝168h)；ΔLnlThe load loss electric quantity of the first load node is the load loss electric quantity when the fault occurs;
2) the power balance constraint is shown as follows:
Figure FDA0002978329270000034
in the formula, PGi(t) the generator set i outputs power in a time period t; NH is the total number of tie lines; t ish(t) represents the planned power of the tie-line h (positive input, negative output) over time period t;
Figure FDA0002978329270000035
the load electric quantity of the l load node is;
Figure FDA0002978329270000036
the load loss electric quantity of the first load node is the load loss electric quantity when the fault occurs;
3) the unit output constraints are as follows:
for any fault in the system, the optimization target of the load loss calculation model is that the power generation cost and the load loss amount are minimum, and the specific formula is as follows:
Figure FDA0002978329270000037
in the formula (I), the compound is shown in the specification,
Figure FDA0002978329270000038
the minimum force output value and the maximum force output value of the generator set i are obtained;
4) the loss constraint is shown as follows:
Figure FDA0002978329270000041
5) the line flow constraint is given by:
Figure FDA0002978329270000042
in the formula, Pl maxIs the transmission capacity limit of line l; l is a transmission line set;
6) the cross-sectional flow constraint is shown as follows:
Figure FDA0002978329270000043
in the formula (I), the compound is shown in the specification,
Figure FDA0002978329270000044
and
Figure FDA0002978329270000045
respectively the tidal current transmission limit of the section s; s is a section set;
(3) system reliability check during maintenance period
For any maintenance period, if N line faults occur, the load loss model needs to be calculated for N times to obtain a load loss expected value, and the calculation formula is as follows:
Figure FDA0002978329270000046
setting a reliability criterion r0Checking the r value of each time interval, if r is more than or equal to r0If so, the reliability of the time interval meets the requirement; if r is less than r0Then the maintenance schedule for that period needs to be adjusted.
5. A heuristic generating set maintenance scheduling compilation processing method according to claim 1, characterized in that: in step S4, the evaluation index is used to indicate a unit overhaul intention degree, and an adjustment set may be formed in the order from low to high of overhaul intention adjustment values when the unit is adjusted, where the specific steps in step S4 are as follows:
(1) defining the adjustment value of the overhaul will of the unit as follows:
Figure FDA0002978329270000047
in the formula, alphaiMaintenance factor, P, set for ISO according to the operating conditions of the system at each time intervalriThe adjustment cost provided for the generator is calculated according to the historical average power generation amount of the unit; t isiThe maintenance duration of the ith generator; cmThe unit overhaul capacity;
(2) the willingness adjustment cost declared by the generator is as follows:
Figure FDA0002978329270000048
in the formula, λri1、λri,2Reporting node electricity prices of the overhaul time interval and the actual overhaul time interval;
Figure FDA0002978329270000049
the average generating capacity of the unit i in the last year is equal to the actual generating capacity of the last year divided by the number of generating time periods;
(3) arranging the units in the time interval needing to be adjusted from large to small according to the overhaul intention value to form an overhaul adjustment set { beta }1,β2,…βm}。
6. A heuristic generating set maintenance scheduling compilation processing method according to claim 5, characterized in that: in the step S5, the desired value is β1And a maintenance capacity of CmWhen the unit is adjusted to the ith time interval, the following conditions are required to be met:
Figure FDA0002978329270000051
and traversing the units in the maintenance adjustment set in sequence, and performing maintenance adjustment on the units until the system reliability of each maintenance period meets the requirement.
7. A computer apparatus comprising a memory, a processor, and a computer program stored on the memory and capable of running on the processor, wherein: the processor, when executing the computer program, implements the method of any of claims 1-6.
8. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program, when executed by a processor, implements the method of any one of claims 1-6.
CN202110279858.6A 2021-03-16 2021-03-16 Heuristic method for compiling and processing maintenance plan of generator set Active CN113256051B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110279858.6A CN113256051B (en) 2021-03-16 2021-03-16 Heuristic method for compiling and processing maintenance plan of generator set

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110279858.6A CN113256051B (en) 2021-03-16 2021-03-16 Heuristic method for compiling and processing maintenance plan of generator set

Publications (2)

Publication Number Publication Date
CN113256051A true CN113256051A (en) 2021-08-13
CN113256051B CN113256051B (en) 2023-01-20

Family

ID=77181016

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110279858.6A Active CN113256051B (en) 2021-03-16 2021-03-16 Heuristic method for compiling and processing maintenance plan of generator set

Country Status (1)

Country Link
CN (1) CN113256051B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003058419A (en) * 2001-08-07 2003-02-28 ▲金▼創科技股▲ふん▼有限公司 Window-based flash memory storage system, and its managing method and access method
CN102754105A (en) * 2010-02-12 2012-10-24 埃克森美孚上游研究公司 Method and system for creating history-matched simulation models
CN104392282A (en) * 2014-11-24 2015-03-04 国家电网公司 Generator unit maintenance schedule minimum lost load expecting method considering large-scale wind power integration
CN105305444A (en) * 2015-11-30 2016-02-03 国网浙江省电力公司绍兴供电公司 Distribution network intelligent alarm and processing method based on integrated allocation
CN107491823A (en) * 2017-09-29 2017-12-19 贵州电网有限责任公司 A kind of monthly GENERATOR MAINTENANCE SCHEDULING IN optimization method based on bi-level programming
CN108985467A (en) * 2018-06-22 2018-12-11 贵州电网有限责任公司 Secondary device lean management-control method based on artificial intelligence
CN109190777A (en) * 2018-09-28 2019-01-11 国家电网公司西北分部 A kind of Maintenance Schedule Optimization method that Multiple Time Scales are coordinated
US20200015318A1 (en) * 2013-10-08 2020-01-09 Parallel Wireless, Inc. Parameter Optimization and Event Prediction Based on Cell Heuristics

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003058419A (en) * 2001-08-07 2003-02-28 ▲金▼創科技股▲ふん▼有限公司 Window-based flash memory storage system, and its managing method and access method
CN102754105A (en) * 2010-02-12 2012-10-24 埃克森美孚上游研究公司 Method and system for creating history-matched simulation models
US20200015318A1 (en) * 2013-10-08 2020-01-09 Parallel Wireless, Inc. Parameter Optimization and Event Prediction Based on Cell Heuristics
CN104392282A (en) * 2014-11-24 2015-03-04 国家电网公司 Generator unit maintenance schedule minimum lost load expecting method considering large-scale wind power integration
CN105305444A (en) * 2015-11-30 2016-02-03 国网浙江省电力公司绍兴供电公司 Distribution network intelligent alarm and processing method based on integrated allocation
CN107491823A (en) * 2017-09-29 2017-12-19 贵州电网有限责任公司 A kind of monthly GENERATOR MAINTENANCE SCHEDULING IN optimization method based on bi-level programming
CN108985467A (en) * 2018-06-22 2018-12-11 贵州电网有限责任公司 Secondary device lean management-control method based on artificial intelligence
CN109190777A (en) * 2018-09-28 2019-01-11 国家电网公司西北分部 A kind of Maintenance Schedule Optimization method that Multiple Time Scales are coordinated

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
FAHIM MOHAMMAD 等: "A Heuristic Algorithm for Detecting Intercellular Interactions", 《2011 IEEE 11TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOENGINEERING》 *
冯长有: "电力市场环境下发电机组检修规划策略研究", 《中国优秀博硕士学位论文全文数据库（博士） 工程科技辑II辑》 *
李成博: "机组检修计划多目标的优化模型及仿真", 《江南大学学报（自然科学版）》 *

Also Published As

Publication number Publication date
CN113256051B (en) 2023-01-20

Similar Documents

Publication Publication Date Title
Karimi et al. Energy storage allocation in wind integrated distribution networks: An MILP-Based approach
Bhattacharjee et al. Benefits of strategically sizing wind-integrated energy storage and transmission
CN110034572B (en) Energy storage configuration method for alternating current-direct current hybrid system containing multi-port power electronic transformer
Aghaei et al. Exploring the reliability effects on the short term AC security-constrained unit commitment: A stochastic evaluation
Mehrtash et al. Risk-based dynamic generation and transmission expansion planning with propagating effects of contingencies
CN110137955A (en) A kind of decision-making technique counted and the robust Unit Combination of CVaR is dispatched
Roukerd et al. Probabilistic-possibilistic flexibility-based unit commitment with uncertain negawatt demand response resources considering Z-number method
CN111950800A (en) Method, system, equipment and readable storage medium for market clearing before electric power spot goods day
Hassan et al. Developing chaotic Bonobo optimizer for optimal power flow analysis considering stochastic renewable energy resources
Raouf Mohamed et al. Distributed battery energy storage systems operation framework for grid power levelling in the distribution networks
Nykamp Integrating renewables in distribution grids
CN116821660A (en) Power management method, system, terminal equipment and storage medium
Alobaidi et al. Stochastic expansion planning of battery energy storage for the interconnected distribution and data networks
Mokhtari et al. Optimal coordination of thyristor controlled series compensation and transmission expansion planning: Distributionally robust optimization approach
Yi et al. Dispatch-aware planning of energy storage systems in active distribution network
CN115496603A (en) Artificial intelligence technology-based new energy day-ahead transaction decision method for power market
Yilmaz Real measure of a transmission line data with load fore-cast model for the future
CN115660412A (en) Scheduling risk quantitative evaluation method and device considering source load fluctuation and rescheduling
CN111582744A (en) Fault disposal plan on-line checking parallel computing method and system
CN113850481B (en) Power system scheduling service assistant decision method, system, device and storage medium
Zare-Bahramabadi et al. A risk-based dispatchable distributed generation unit and tie line planning framework to improve the resilience of distribution systems
CN113256051B (en) Heuristic method for compiling and processing maintenance plan of generator set
Wallnerström et al. Incentive scheme for efficient grid utilization in the Swedish revenue cap regulation from 2020
CN112436542A (en) Steady-state safety emergency control online pre-decision method considering stability control strategy
Jiang et al. Monthly electricity purchase and decomposition optimization considering wind power accommodation and day-ahead schedule

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