CN113190963A - Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market - Google Patents

Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market Download PDF

Info

Publication number
CN113190963A
CN113190963A CN202110338629.7A CN202110338629A CN113190963A CN 113190963 A CN113190963 A CN 113190963A CN 202110338629 A CN202110338629 A CN 202110338629A CN 113190963 A CN113190963 A CN 113190963A
Authority
CN
China
Prior art keywords
power plant
power
virtual
virtual power
time period
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.)
Pending
Application number
CN202110338629.7A
Other languages
Chinese (zh)
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.)
Beijing Kedong Electric Power Control System Co Ltd
State Grid Shanghai Electric Power Co Ltd
State Grid Electric Power Research Institute
Original Assignee
Beijing Kedong Electric Power Control System Co Ltd
State Grid Shanghai Electric Power Co Ltd
State Grid Electric Power Research Institute
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 Beijing Kedong Electric Power Control System Co Ltd, State Grid Shanghai Electric Power Co Ltd, State Grid Electric Power Research Institute filed Critical Beijing Kedong Electric Power Control System Co Ltd
Priority to CN202110338629.7A priority Critical patent/CN113190963A/en
Publication of CN113190963A publication Critical patent/CN113190963A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data
    • G06Q30/0206—Price or cost determination based on market factors
    • 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Electricity, gas or water supply
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2113/00—Details relating to the application field
    • G06F2113/04—Power grid distribution networks
    • 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
    • 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
    • Y04S50/00—Market activities related to the operation of systems integrating technologies related to power network operation or related to communication or information technologies
    • Y04S50/14—Marketing, i.e. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Tourism & Hospitality (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Geometry (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Primary Health Care (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a clearing method for a virtual power plant participating in a power peak regulation auxiliary service market, which comprises the following steps: establishing a constraint condition for the virtual power plant to participate in power auxiliary peak shaving according to the topological data information and the declaration data of the power grid; constructing an optimization target of the virtual power plant participating in the electric power auxiliary peak regulation; and solving the adjustment power of the power distribution market under the constraint condition according to the optimization target and the constraint condition, and further obtaining a clearing result. According to the method, a mathematical model is established for the problem on the premise that the virtual power plant participating in the electric power auxiliary peak regulation market meets feasibility, safety, efficiency and reliability, the peak regulation service cost is established as a target function at least through analysis of the model, the optimal clear electricity output and electricity price are obtained through solving, and the clear problem that the virtual power plant participates in the peak regulation auxiliary service market is solved.

Description

Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market
Technical Field
The invention belongs to the field of power system analysis, and particularly relates to a clearing method for a virtual power plant participating in a power peak regulation auxiliary service market.
Background
Renewable energy sources such as wind power, photovoltaic and the like in China are rapidly developed in recent years, large-scale grid connection is urgently needed, but the new energy sources have the characteristics of intermittency and volatility, and the peak load regulation pressure of a power grid is undoubtedly and greatly increased. In order to meet the large-scale grid connection and preferential consumption of renewable energy, a power grid has huge requirements on deep peak shaving, and the existing thermal power generating unit cannot completely meet the requirements on the power grid with low water-electricity and gas power generation ratio. In addition, the thermal power generating unit operates at low power to provide deep peak shaving auxiliary service at high cost. In order to relieve peak regulation pressure and reduce peak regulation cost, resources on the demand side are fully explored to participate in peak regulation. The virtual power plant can integrate and schedule the peak shaving resources on the demand side, and participate in the peak shaving market in a form similar to that of the traditional power plant. And if the virtual power plant participates in the electric power auxiliary peak shaving market transaction, a clearing method for the virtual power plant participating in the auxiliary peak shaving market is required to be provided according to market rules.
Disclosure of Invention
The purpose of the invention is as follows: aiming at the problems, the invention provides a clearing method for a virtual power plant participating in a power peak regulation auxiliary service market.
The technical scheme is as follows: in order to realize the purpose of the invention, the technical scheme adopted by the invention is as follows: a clearing method for a virtual power plant participating in a power peak regulation auxiliary service market specifically comprises the following steps:
(1) establishing a virtual power plant participating power auxiliary peak regulation constraint condition according to the power grid topological data information and the declaration data;
(2) constructing an optimization target of the participation of the virtual power plant in the electric power auxiliary peak shaving cost;
(3) and solving the adjustment power of the power distribution market under the constraint condition according to the optimization target and the constraint condition, and further obtaining a clearing result.
Further, the step (1) comprises:
(1.1) establishing a node power flow balance constraint condition according to the power grid topological data information;
(1.2) establishing a branch flow limit constraint condition according to the virtual power plant branch power information;
(1.3) establishing a limit condition of output according to the output information of the virtual power plant;
(1.4) establishing output climbing constraint conditions according to the output information of the virtual power plant;
and (1.5) establishing a peak shaving demand balance constraint condition according to the peak shaving demand total amount information.
Further, step (1.1) establishes a node power flow balance constraint condition according to the power grid topology data information, and the specific method is as follows:
(1.11) setting the adjustment power variable of each virtual power plant in each gear for each virtual power plant according to the topological data information of the power grid, and calculating the adjustment variable of the virtual power plant g in the period t of the node i
Figure BDA0002998554710000021
In the formula, K is a gear number, and K is the total number of gears; deltag,i,tAdjusting power variables of the virtual power plant g in a node i time period t; deltag,k,tAdjusting power variables of the virtual power plant g in a node i gear k time period t;
(1.12) establishing a node power flow balance constraint condition formula for each node of the virtual power plant, which specifically comprises the following steps:
Δ'g,i,t-Δg,i,t-fg,i,t＝0
in formula (II), delta'g,i,tAdjusting the power variable, Delta, for the plant g' at node i time tg,i,tFor virtual power plant g at node i time period tAdjusting the power variable, fg,i,tThe output power of the virtual power plant g in the period t of the node i is shown.
Further, step (1.2) establishes a branch power flow limit constraint condition according to the virtual power plant branch power information, and the specific method is as follows:
(1.21) acquiring the upper limit power F of each branch plan according to the branch declaration data informationl,t,maxAnd a planned lower limit power Fl,t,min(ii) a Wherein, Fl,t,maxRepresents the planned upper limit power of branch l at time period t; f,l,t,minRepresents the planned lower limit power of branch l during time period t;
(1.22) planning an upper limit power F for the branch according to step (1.21)l,t,maxEstablishing a planned power upper limit information matrix F (t) of each branch in a time period tmaxSpecifically, the following is shown:
F(t)max＝(Fl,t,max…FL,t,max),l∈[1,L]
in the formula, l represents a branch number; l represents the total number of branches; fl,t,maxThe planned upper limit power of the branch circuit l time period t; fL,t,maxA planned upper limit power for branch L at time period t;
likewise, according to the planned lower limit power Fl,t,minObtaining a planned power lower limit information matrix F (t) of each branch in a time period tminSpecifically, the following is shown:
F(t)min＝(Fl,t,min…FL,t,min),l∈[1,L]
in the formula, Fl,t,minPlanned lower limit power for branch l at time period t; fL,t,minA planned lower limit power for branch L at time period t;
(1.23) setting an actual power information matrix F (t) of the branch in a time period t to obtain a branch tide limit constraint condition, specifically a planned power upper limit information matrix F (t)minNone of the elements in (a) is smaller than the elements at the same position in the actual power information matrix F (t), and the planned power lower limit information matrix F (t)minNone of the elements in (a) is larger than the elements at the same position in the actual power information matrix f (t);
wherein the branch is in the real of time period tThe power information matrix F (t) ═ Fl,t…FL,t),l∈[1,L](ii) a In the formula, Fl,tActual power for branch l at time period t; fL,tThe actual power of branch L during time period t.
Further, step (1.3) establishes an output limit constraint condition according to the output information of the virtual power plant, and the specific method is as follows:
(1.31) obtaining the output lower limit value P 'of each virtual power plant according to the declaration information of the virtual power plants'g,t,minAnd upper limit of output P'g,t,max(ii) a Wherein, P'g,t,minRepresenting the lower limit value of the output of the virtual power plant g in the time t; p'g,t,maxRepresenting the output upper limit value of the virtual power plant g in the time t;
(1.32) lower limit value of output P 'of each virtual power plant according to the step (1.31)'g,t,minAnd obtaining a lower output limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)min＝(P'g,t,min…P'G,t,min),g∈[1,G]；
in the formula, g is a virtual power plant number; g is the total number of the virtual power plant; p'g,t,minThe output lower limit value of the virtual power plant g in the time period t is obtained; p'G,t,minThe output lower limit value of the virtual power plant G in the time period t is obtained;
similarly, according to the output upper limit power P 'of each virtual power plant'g,t,maxAnd obtaining an output upper limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)max＝(P'g,t,max...P'G,t,max),g∈[1,G]
of formula (II) to (III)'g,t,maxThe output upper limit value of the virtual power plant g in the time period t is obtained; p'G,t,maxThe output upper limit value of the virtual power plant G in the time period t is obtained;
(1.33) setting an actual output matrix P '(t) of the virtual power plant in a time period t to obtain a constraint condition of the output limit value of the virtual power plant, specifically, a lower output limit matrix P' (t)minIs not smaller than the element at the same position in the actual output matrix P '(t), and the upper output limit matrix P' (t)maxNone of the elements in (A) is greater than the actual output momentElements at the same position in the array P' (t);
wherein, the actual output matrix P ' (t) ═ P ' of the virtual power plant in the period t 'g,t...P'G,t),g∈[1,G](ii) a Of formula (II) to (III)'g,tThe actual force output value of the virtual power plant g in the time period t is obtained; p'G,tThe actual output value of the virtual power plant G in the time period t is obtained.
Further, step (1.4) establishes output climbing constraint conditions according to the output information of the virtual power plant, and the specific method is as follows:
(1.41) obtaining the descending and climbing rate of the virtual power plant according to the reported data information
Figure BDA0002998554710000041
And rate of uphill climb
Figure BDA0002998554710000042
Wherein the content of the first and second substances,
Figure BDA0002998554710000043
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA0002998554710000044
representing the climbing rate of the virtual power plant g in the time period t;
(1.42) ramp-up rate according to virtual power plant
Figure BDA0002998554710000045
Establishing a climbing matrix Rd (t) of the virtual power plant in a time period t, specifically:
Figure BDA0002998554710000046
wherein the content of the first and second substances,
Figure BDA0002998554710000047
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA0002998554710000048
to representThe climbing rate of the virtual power plant G in the time period t;
similarly, according to the uphill rate of the virtual power plant
Figure BDA0002998554710000049
Establishing an uphill matrix Ru (t) of the virtual power plant in a time period t, specifically:
Figure BDA00029985547100000410
wherein the content of the first and second substances,
Figure BDA00029985547100000411
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA00029985547100000412
representing the rate of ascent of the virtual plant G over time period t;
(1.43) setting an actual output matrix P '(t +1) of the virtual power plant in a time period t +1, and according to the actual output matrix P' (t) of the virtual power plant in the time period t in the step (1.33), obtaining an output climbing constraint condition of the virtual power plant, wherein elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not smaller than elements in the same position in a lower climbing matrix Rd (t), and elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not larger than elements in the same position in an upper climbing matrix Ru (t).
Further, step (1.5) establishes a peak shaving demand balance constraint condition according to the peak shaving demand total amount information, and the specific method is as follows:
(1.51) adjusting the power variable Delta according to the shift k period t of the virtual power plant gg,k,tAnd calculating the adjustment power sum delta (t) of all gears of all virtual power plants in a time period t, and calculating a formula:
Figure BDA0002998554710000051
in the formula, k is a gear number; k is the total number of gears; Δ (t) represents the sum of the regulated power for all gears of the virtual plant over time period t;
(1.52) it is provided that a new power plant v exists, the power plant v adjusting the power Δ during the period t of the gear kv,k,tCalculating the adjusted electric power sum Delta of all gears of the power plant v in the period tv(t), the calculation formula:
Figure BDA0002998554710000052
(1.53) according to the parameters Δ (t) and Δv(t), calculating to obtain a peak regulation demand balance constraint condition, specifically, delta (t) + deltav(t)≥D(t)；
Wherein D (t) adjusts the power for the total demand of time period t.
Further, an optimization target of the virtual power plant participating in the electric power auxiliary peak shaving is established in the step (2), and the specific method is as follows:
(2.1) obtaining the quotation beta of each virtual power plant in the gear k period t according to the declaration informationg,k,tAnd establishing and obtaining a quotation information matrix beta (t) of the virtual power plant in the time period t, specifically expressing:
Figure BDA0002998554710000053
the method comprises the following steps that a matrix row represents the quotation of the same virtual power plant at different gears, and a matrix column represents the quotation of different virtual power plants at the same gear; in particular, betaG,K,tRepresenting the quotation of the virtual power plant G in the gear K period t;
likewise, the power variable Δ is adjusted according to the virtual power plant during the period t of the gear kg,k,tEstablishing an adjustment power matrix delta' (t) of the virtual power plant in a time period t, specifically representing:
Figure BDA0002998554710000054
the rows of the matrix represent adjustment power variables of different virtual power plants at the same gear; the columns of the matrix represent the adjustment power variables of the same virtual power plant at different gears; deltaG,k,tRepresenting virtual electricityAdjusting power of a plant G in a gear k time period t;
(2.2) setting the quote of the power plant v in the gear k period t as betav,k,tAnd satisfy betav,k,t＞βg,k,t、βv,k,t＞βg+1,k,t、...、βv,k,t＞βG,k,t(ii) a Establishing a quotation information matrix beta of the power plant v in the time t according to the quotation of the power plant v in the gear k time tv(t), which specifically represents: beta is av(t)＝(βv,k,t...βv,K,t)T,k∈[1,K]；
In the formula, betav,K,tRepresenting the quoted price of the power plant v in the gear K period t;
similarly, according to the adjusting power of the power plant v in the period t of the gear k, an adjusting power matrix delta of the power plant v in the period t is establishedv(t), which specifically represents: deltav(t)＝(Δv,k,t...Δv,K,t),k∈[1,K]；
In the formula,. DELTA.v,K,tRepresents the regulated power of the plant v during the period t of gear K;
(2.3) according to the parameters beta (t), betav(t)、Δv(t) and Δ' (t), establishing a minimization objective function with respect to the overhead peak shaver cost:
Figure BDA0002998554710000061
wherein z is the total cost of the T time periods; t represents a period number; t denotes the total number of periods.
Further, step (3) is to solve the adjustment power of the distribution market under the constraint condition according to the optimization objective and the constraint condition, and the specific method is as follows:
and (4) solving the minimum value of the minimized target function expression in the step (2.3) under the constraint condition expression, and obtaining an adjustment power matrix delta' (t) so as to obtain a clear result.
The invention also provides a clearing device for the virtual power plant to participate in the electric power peak regulation auxiliary service market, which comprises the following components:
the acquisition device is used for acquiring topological data information and declaration data of the power grid and establishing an optimization target for obtaining a constraint condition of participation of the virtual power plant in electric power auxiliary peak shaving and cost of participation of the virtual power plant in electric power auxiliary peak shaving;
and the execution device is used for solving the adjustment power of the power distribution market under the constraint condition according to the constraint condition and the optimization target to obtain a clearing result.
The invention further provides computer equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the steps of the clearing method of the virtual power plant participating in the electric power peak regulation auxiliary service market when executing the computer program.
The invention also proposes a computer-readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of a method for a virtual power plant to participate in the clearing of a power peak shaving assistance service market.
Has the advantages that: compared with the prior art, the technical scheme of the invention has the following beneficial technical effects:
the technical scheme of the invention establishes a mathematical model of the virtual power plant power auxiliary service market and provides a calculation step of the virtual power plant power auxiliary service market clearing method. The method comprises the steps of establishing a mathematical model for a problem on the premise that a virtual power plant participates in a power-assisted peak regulation market and meets feasibility, safety, efficiency and reliability, establishing a constraint condition and a target function of peak regulation service cost through analysis of the model, and solving to obtain a minimum target function value under the constraint condition, so that the optimal clear electricity output and electricity price are obtained; the method solves the clearing problem of the virtual power plant participating in the peak shaving auxiliary service market, and enables the calculation efficiency to be higher and the calculation speed to be higher.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention.
Detailed Description
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
The invention relates to a clearing method for a virtual power plant participating in a power peak regulation auxiliary service market, which specifically comprises the following steps:
(1) establishing a virtual power plant participating power auxiliary peak regulation constraint condition according to the power grid topological data information and the declaration data;
(2) constructing an optimization target of the participation of the virtual power plant in the electric power auxiliary peak shaving cost;
(3) and solving the adjustment power of the power distribution market under the constraint condition according to the optimization target and the constraint condition, and further obtaining a clearing result.
Further, the step (1) comprises:
(1.1) establishing a node power flow balance constraint condition according to the power grid topological data information;
(1.2) establishing a branch flow limit constraint condition according to the virtual power plant branch power information;
(1.3) establishing a limit condition of output according to the output information of the virtual power plant;
(1.4) establishing output climbing constraint conditions according to the output information of the virtual power plant;
and (1.5) establishing a peak shaving demand balance constraint condition according to the peak shaving demand total amount information.
Further, step (1.1) establishes a node power flow balance constraint condition according to the power grid topology data information, and the specific method is as follows:
(1.11) setting the adjustment power variable of each virtual power plant in each gear for each virtual power plant according to the topological data information of the power grid, and calculating the adjustment variable of the virtual power plant g in the period t of the node i
Figure BDA0002998554710000081
In the formula, K is a gear number, and K is the total number of gears; deltag,i,tAdjusting power variables of the virtual power plant g in a node i time period t; deltag,k,tAdjusting power variables of the virtual power plant g in a node i gear k time period t;
(1.12) establishing a node power flow balance constraint condition formula for each node of the virtual power plant, which specifically comprises the following steps:
Δ'g,i,t-Δg,i,t-fg,i,t＝0
in formula (II), delta'g,i,tAdjusting the power variable, Delta, for the plant g' at node i time tg,i,tAdjusting the power variable, f, for the virtual plant g at a node i time period tg,i,tThe output power of the virtual power plant g in the period t of the node i is shown.
Further, step (1.2) establishes a branch power flow limit constraint condition according to the virtual power plant branch power information, and the specific method is as follows:
(1.21) acquiring the upper limit power F of each branch plan according to the branch declaration data informationl,t,maxAnd a planned lower limit power Fl,t,min(ii) a Wherein, Fl,t,maxRepresents the planned upper limit power of branch l at time period t; f,l,t,minRepresents the planned lower limit power of branch l during time period t;
(1.22) planning an upper limit power F for the branch according to step (1.21)l,t,maxEstablishing a planned power upper limit information matrix F (t) of each branch in a time period tmaxSpecifically, the following is shown:
F(t)max＝(Fl,t,max…FL,t,max),l∈[1,L]
in the formula, l represents a branch number; l represents the total number of branches; fl,t,maxThe planned upper limit power of the branch circuit l time period t; fL,t,maxA planned upper limit power for branch L at time period t;
likewise, according to the planned lower limit power Fl,t,minObtaining a planned power lower limit information matrix F (t) of each branch in a time period tminSpecifically, the following is shown:
F(t)min＝(Fl,t,min…FL,t,min),l∈[1,L]
in the formula, Fl,t,minPlanned lower limit power for branch l at time period t; fL,t,minA planned lower limit power for branch L at time period t;
(1.23) setting an actual power information matrix F (t) of the branch in a time period t to obtain a branch tide limit constraint condition, specifically a planned power upper limit information matrix F (t)minNone of the elements in (1) is smaller than the actual power information matrixF (t) elements of the same position, and the planned power floor information matrix F (t)minNone of the elements in (a) is larger than the elements at the same position in the actual power information matrix f (t);
wherein, the actual power information matrix F (t) of the branch in the time period t is (F)l,t…FL,t),l∈[1,L](ii) a In the formula, Fl,tActual power for branch l at time period t; fL,tThe actual power of branch L during time period t.
Further, step (1.3) establishes an output limit constraint condition according to the output information of the virtual power plant, and the specific method is as follows:
(1.31) obtaining the output lower limit value P 'of each virtual power plant according to the declaration information of the virtual power plants'g,t,minAnd upper limit of output P'g,t,max(ii) a Wherein, P'g,t,minRepresenting the lower limit value of the output of the virtual power plant g in the time t; p'g,t,maxRepresenting the output upper limit value of the virtual power plant g in the time t;
(1.32) lower limit value of output P 'of each virtual power plant according to the step (1.31)'g,t,minAnd obtaining a lower output limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)min＝(P'g,t,min…P'G,t,min),g∈[1,G]；
in the formula, g is a virtual power plant number; g is the total number of the virtual power plant; p'g,t,minThe output lower limit value of the virtual power plant g in the time period t is obtained; p'G,t,minThe output lower limit value of the virtual power plant G in the time period t is obtained;
similarly, according to the output upper limit power P 'of each virtual power plant'g,t,maxAnd obtaining an output upper limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)max＝(P'g,t,max...P'G,t,max),g∈[1,G]
of formula (II) to (III)'g,t,maxThe output upper limit value of the virtual power plant g in the time period t is obtained; p'G,t,maxThe output upper limit value of the virtual power plant G in the time period t is obtained;
(1.33) setting an actual output matrix P' (t) of the virtual power plant in the time period t to obtain virtual electricityConstraint condition of factory output limit, in particular lower output limit matrix P' (t)minIs not smaller than the element at the same position in the actual output matrix P '(t), and the upper output limit matrix P' (t)maxNone of the elements in (a) is larger than the elements at the same position in the actual force matrix P' (t);
wherein, the actual output matrix P ' (t) ═ P ' of the virtual power plant in the period t 'g,t...P'G,t),g∈[1,G](ii) a Of formula (II) to (III)'g,tThe actual force output value of the virtual power plant g in the time period t is obtained; p'G,tThe actual output value of the virtual power plant G in the time period t is obtained.
Further, step (1.4) establishes output climbing constraint conditions according to the output information of the virtual power plant, and the specific method is as follows:
(1.41) obtaining the descending and climbing rate of the virtual power plant according to the reported data information
Figure BDA0002998554710000101
And rate of uphill climb
Figure BDA0002998554710000102
Wherein the content of the first and second substances,
Figure BDA0002998554710000103
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA0002998554710000104
representing the climbing rate of the virtual power plant g in the time period t;
(1.42) ramp-up rate according to virtual power plant
Figure BDA0002998554710000105
Establishing a climbing matrix Rd (t) of the virtual power plant in a time period t, specifically:
Figure BDA0002998554710000106
wherein the content of the first and second substances,
Figure BDA0002998554710000107
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA0002998554710000108
representing the climbing rate of the virtual power plant G in the time period t;
similarly, according to the uphill rate of the virtual power plant
Figure BDA0002998554710000109
Establishing an uphill matrix Ru (t) of the virtual power plant in a time period t, specifically:
Figure BDA00029985547100001010
wherein the content of the first and second substances,
Figure BDA00029985547100001011
representing the climbing rate of the virtual power plant g in the time period t;
Figure BDA00029985547100001012
representing the rate of ascent of the virtual plant G over time period t;
(1.43) setting an actual output matrix P '(t +1) of the virtual power plant in a time period t +1, and according to the actual output matrix P' (t) of the virtual power plant in the time period t in the step (1.33), obtaining an output climbing constraint condition of the virtual power plant, wherein elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not smaller than elements in the same position in a lower climbing matrix Rd (t), and elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not larger than elements in the same position in an upper climbing matrix Ru (t).
Further, step (1.5) establishes a peak shaving demand balance constraint condition according to the peak shaving demand total amount information, and the specific method is as follows:
(1.51) adjusting the power variable Delta according to the shift k period t of the virtual power plant gg,k,tAnd calculating the adjustment power sum delta (t) of all gears of all virtual power plants in a time period t, and calculating a formula:
Figure BDA0002998554710000111
in the formula, k is a gear number; k is the total number of gears; Δ (t) represents the sum of the regulated power for all gears of the virtual plant over time period t;
(1.52) it is provided that a new power plant v exists, the power plant v adjusting the power Δ during the period t of the gear kv,k,tCalculating the adjusted electric power sum Delta of all gears of the power plant v in the period tv(t), the calculation formula:
Figure BDA0002998554710000112
(1.53) according to the parameters Δ (t) and Δv(t), calculating to obtain a peak regulation demand balance constraint condition, specifically, delta (t) + deltav(t)≥D(t)；
Wherein D (t) adjusts the power for the total demand of time period t.
Further, an optimization target of the virtual power plant participating in the electric power auxiliary peak shaving is established in the step (2), and the specific method is as follows:
(2.1) obtaining the quotation beta of each virtual power plant in the gear k period t according to the declaration informationg,k,tAnd establishing and obtaining a quotation information matrix beta (t) of the virtual power plant in the time period t, specifically expressing:
Figure BDA0002998554710000113
the method comprises the following steps that a matrix row represents the quotation of the same virtual power plant at different gears, and a matrix column represents the quotation of different virtual power plants at the same gear; in particular, betaG,K,tRepresenting the quotation of the virtual power plant G in the gear K period t;
likewise, the power variable Δ is adjusted according to the virtual power plant during the period t of the gear kg,k,tEstablishing an adjustment power matrix delta' (t) of the virtual power plant in a time period t, specifically representing:
Figure BDA0002998554710000114
the rows of the matrix represent adjustment power variables of different virtual power plants at the same gear; the columns of the matrix represent the adjustment power variables of the same virtual power plant at different gears; deltaG,k,tRepresents the regulated power of the virtual plant G during the gear k period t;
(2.2) setting the quote of the power plant v in the gear k period t as betav,k,tAnd satisfy betav,k,t＞βg,k,t、βv,k,t＞βg+1,k,t、...、βv,k,t＞βG,k,t(ii) a Establishing a quotation information matrix beta of the power plant v in the time t according to the quotation of the power plant v in the gear k time tv(t), which specifically represents: beta is av(t)＝(βv,k,t...βv,K,t)T,k∈[1,K]；
In the formula, betav,K,tRepresenting the quoted price of the power plant v in the gear K period t;
similarly, according to the adjusting power of the power plant v in the period t of the gear k, an adjusting power matrix delta of the power plant v in the period t is establishedv(t), which specifically represents: deltav(t)＝(Δv,k,t...Δv,K,t),k∈[1,K]；
In the formula,. DELTA.v,K,tRepresents the regulated power of the plant v during the period t of gear K;
(2.3) according to the parameters beta (t), betav(t)、Δv(t) and Δ' (t), establishing a minimization objective function with respect to the overhead peak shaver cost:
Figure BDA0002998554710000121
wherein z is the total cost of the T time periods; t represents a period number; t denotes the total number of periods.
Further, step (3) is to solve the adjustment power of the distribution market under the constraint condition according to the optimization objective and the constraint condition, and the specific method is as follows:
and (4) solving the minimum value of the minimized target function expression in the step (2.3) under the constraint condition expression, and obtaining an adjustment power matrix delta' (t) so as to obtain a clear result.
The invention also provides a clearing device for the virtual power plant to participate in the electric power peak regulation auxiliary service market, which comprises the following components:
the acquisition device is used for acquiring topological data information and declaration data of the power grid and establishing an optimization target for obtaining a constraint condition of participation of the virtual power plant in electric power auxiliary peak shaving and cost of participation of the virtual power plant in electric power auxiliary peak shaving;
and the execution device is used for solving the adjustment power of the power distribution market under the constraint condition according to the constraint condition and the optimization target to obtain a clearing result.
The invention further provides computer equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the steps of the clearing method of the virtual power plant participating in the electric power peak regulation auxiliary service market when executing the computer program.
The invention also proposes a computer-readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of a method for a virtual power plant to participate in the clearing of a power peak shaving assistance service market.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the same, and although the present invention is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications and equivalents may be made to the embodiments of the invention without departing from the spirit and scope of the invention, which is to be covered by the claims.

Claims (12)

1. A clearing method for a virtual power plant participating in a power peak regulation auxiliary service market is characterized by comprising the following steps:
establishing a virtual power plant participating power auxiliary peak regulation constraint condition according to the power grid topological data information and the declaration data; constructing an optimization target of the virtual power plant participating in the electric power auxiliary peak regulation cost;
and solving the adjustment power of the power distribution market under the constraint condition according to the optimization target and the constraint condition to obtain a clearing result.
2. The clearing method of the virtual power plant participating in the power peak regulation auxiliary service market as claimed in claim 1, wherein the establishment of the virtual power plant participating in the power peak regulation constraint condition according to the power grid topology data information and the declaration data specifically comprises:
(1.1) establishing a node power flow balance constraint condition according to the power grid topological data information;
(1.2) establishing a branch flow limit constraint condition according to the virtual power plant branch power information;
(1.3) establishing a limit condition of output according to the output information of the virtual power plant;
(1.4) establishing output climbing constraint conditions according to the output information of the virtual power plant;
and (1.5) establishing a peak shaving demand balance constraint condition according to the peak shaving demand total amount information.
3. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 2, characterized in that the step (1.1) of establishing the node load flow balance constraint condition according to the power grid topology data information comprises the following specific steps:
(1.11) setting the adjustment power variable of each virtual power plant in each gear for each virtual power plant according to the topological data information of the power grid, and calculating the adjustment variable of the virtual power plant g in the period t of the node i
Figure FDA0002998554700000011
In the formula, k is a gear number; k is the total number of gears; deltag,i,tAdjusting power variables of the virtual power plant g in a node i time period t; deltag,k,tAdjusting power variables of the virtual power plant g in a node i gear k time period t;
(1.12) establishing a node power flow balance constraint condition formula for each node of the virtual power plant, which specifically comprises the following steps:
Δ'g,i,t-Δg,i,t-fg,i,t＝0
in formula (II), delta'g,i,tAdjusting the power variable, Delta, for the plant g' at node i time tg,i,tAdjusting the power variable, f, for the virtual plant g at a node i time period tg,i,tThe output power of the virtual power plant g in the period t of the node i is shown.
4. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 3, wherein the step (1.2) of establishing the branch power flow limit constraint condition according to the virtual power plant branch power information comprises the following specific steps:
(1.21) acquiring the upper limit power F of each branch plan according to the branch declaration data informationl,t,maxAnd a planned lower limit power Fl,t,min(ii) a Wherein, Fl,t,maxRepresents the planned upper limit power of branch l at time period t; f,l,t,minRepresents the planned lower limit power of branch l during time period t;
(1.22) planning an upper limit power F for the branch according to step (1.21)l,t,maxEstablishing a planned power upper limit information matrix F (t) of each branch in a time period tmaxSpecifically, the following is shown:
F(t)max＝(Fl,t,max…FL,t,max),l∈[1,L]
in the formula, l represents a branch number; l represents the total number of branches; fl,t,maxThe planned upper limit power of the branch circuit l time period t; fL,t,maxA planned upper limit power for branch L at time period t;
likewise, according to the planned lower limit power Fl,t,minObtaining a planned power lower limit information matrix F (t) of each branch in a time period tminSpecifically, the following is shown:
F(t)min＝(Fl,t,min…FL,t,min),l∈[1,L]
in the formula, Fl,t,minPlanned lower limit power for branch l at time period t; fL,t,minA planned lower limit power for branch L at time period t;
(1.23) setting the actual branch at time tA power information matrix F (t) for obtaining a branch tide limit constraint condition, in particular a planning power upper limit information matrix F (t)minNone of the elements in (a) is smaller than the elements at the same position in the actual power information matrix F (t), and the planned power lower limit information matrix F (t)minNone of the elements in (a) is larger than the elements at the same position in the actual power information matrix f (t);
wherein, the actual power information matrix F (t) of the branch in the time period t is (F)l,t…FL,t),l∈[1,L](ii) a In the formula, Fl,tActual power for branch l at time period t; fL,tThe actual power of branch L during time period t.
5. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 4, wherein the step (1.3) of establishing the output limit constraint condition according to the output information of the virtual power plant comprises the following specific steps:
(1.31) obtaining the output lower limit value P 'of each virtual power plant according to the declaration information of the virtual power plants'g,t,minAnd upper limit of output P'g,t,max(ii) a Wherein, P'g,t,minRepresenting the lower limit value of the output of the virtual power plant g in the time t; p'g,t,maxRepresenting the output upper limit value of the virtual power plant g in the time t;
(1.32) lower limit value of output P 'of each virtual power plant according to the step (1.31)'g,t,minAnd obtaining a lower output limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)min＝(P'g,t,min…P'G,t,min),g∈[1,G]；
in the formula, g is a virtual power plant number; g is the total number of the virtual power plant; p'g,t,minThe output lower limit value of the virtual power plant g in the time period t is obtained; p'G,t,minThe output lower limit value of the virtual power plant G in the time period t is obtained;
similarly, according to the output upper limit power P 'of each virtual power plant'g,t,maxAnd obtaining an output upper limit matrix of the virtual power plant in the time period t, specifically representing:
P'(t)max＝(P'g,t,max...P'G,t,max),g∈[1,G]
of formula (II) to (III)'g,t,maxThe output upper limit value of the virtual power plant g in the time period t is obtained; p'G,t,maxThe output upper limit value of the virtual power plant G in the time period t is obtained;
(1.33) setting an actual output matrix P '(t) of the virtual power plant in a time period t to obtain a constraint condition of the output limit value of the virtual power plant, specifically, a lower output limit matrix P' (t)minIs not smaller than the element at the same position in the actual output matrix P '(t), and the upper output limit matrix P' (t)maxNone of the elements in (a) is larger than the elements at the same position in the actual force matrix P' (t);
wherein, the actual output matrix P ' (t) ═ P ' of the virtual power plant in the period t 'g,t...P'G,t),g∈[1,G](ii) a Of formula (II) to (III)'g,tThe actual force output value of the virtual power plant g in the time period t is obtained; p'G,tThe actual output value of the virtual power plant G in the time period t is obtained.
6. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 5, wherein the step (1.4) of establishing the output climbing constraint condition according to the output information of the virtual power plant comprises the following specific steps:
(1.41) obtaining the descending and climbing rate of the virtual power plant according to the reported data information
Figure FDA0002998554700000031
And rate of uphill climb
Figure FDA0002998554700000032
Wherein the content of the first and second substances,
Figure FDA0002998554700000033
representing the climbing rate of the virtual power plant g in the time period t;
Figure FDA0002998554700000034
representing the climbing rate of the virtual power plant g in the time period t;
(1.42) ramp-up rate according to virtual power plant
Figure FDA0002998554700000041
Establishing a climbing matrix Rd (t) of the virtual power plant in a time period t, specifically:
Figure FDA0002998554700000042
wherein the content of the first and second substances,
Figure FDA0002998554700000043
representing the climbing rate of the virtual power plant g in the time period t;
Figure FDA0002998554700000044
representing the climbing rate of the virtual power plant G in the time period t;
similarly, according to the uphill rate of the virtual power plant
Figure FDA0002998554700000045
Establishing an uphill matrix Ru (t) of the virtual power plant in a time period t, specifically:
Figure FDA0002998554700000046
wherein the content of the first and second substances,
Figure FDA0002998554700000047
representing the climbing rate of the virtual power plant g in the time period t;
Figure FDA0002998554700000048
representing the rate of ascent of the virtual plant G over time period t;
(1.43) setting an actual output matrix P '(t +1) of the virtual power plant in a time period t +1, and according to the actual output matrix P' (t) of the virtual power plant in the time period t in the step (1.33), obtaining an output climbing constraint condition of the virtual power plant, wherein elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not smaller than elements in the same position in a lower climbing matrix Rd (t), and elements in a result matrix P '(t +1) -P' (t) of a difference of the actual output matrix are not larger than elements in the same position in an upper climbing matrix Ru (t).
7. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 6, wherein step (1.5) establishes peak shaving demand balance constraint conditions according to peak shaving demand total information, and the specific method is as follows:
(1.51) adjusting the power variable Delta according to the shift k period t of the virtual power plant gg,k,tAnd calculating the adjustment power sum delta (t) of all gears of all virtual power plants in a time period t, and calculating a formula:
Figure FDA0002998554700000049
in the formula, k is a gear number; k is the total number of gears; Δ (t) represents the sum of the regulated power for all gears of the virtual plant over time period t;
(1.52) it is provided that a new power plant v exists, the power plant v adjusting the power Δ during the period t of the gear kv,k,tCalculating the adjusted electric power sum Delta of all gears of the power plant v in the period tv(t), the calculation formula:
Figure FDA0002998554700000051
(1.53) according to the parameters Δ (t) and Δv(t), calculating to obtain a peak regulation demand balance constraint condition, specifically, delta (t) + deltav(t)≥D(t)；
Wherein D (t) adjusts the power for the total demand of time period t.
8. The clearing method of the virtual power plant participating in the power peak shaving auxiliary service market according to claim 7, wherein the step (2) is to construct an optimization target of the virtual power plant participating in the power peak shaving auxiliary service market, and the specific method is as follows:
(2.1) obtaining the gear k of each virtual power plant according to the declaration informationOffer beta for segment tg,k,tAnd establishing and obtaining a quotation information matrix beta (t) of the virtual power plant in the time period t, specifically expressing:
Figure FDA0002998554700000052
the method comprises the following steps that a matrix row represents the quotation of the same virtual power plant at different gears, and a matrix column represents the quotation of different virtual power plants at the same gear; in particular, betaG,K,tRepresenting the quotation of the virtual power plant G in the gear K period t;
likewise, the power variable Δ is adjusted according to the virtual power plant during the period t of the gear kg,k,tEstablishing an adjustment power matrix delta' (t) of the virtual power plant in a time period t, specifically representing:
Figure FDA0002998554700000053
the rows of the matrix represent adjustment power variables of different virtual power plants at the same gear; the columns of the matrix represent the adjustment power variables of the same virtual power plant at different gears; deltaG,k,tRepresents the regulated power of the virtual plant G during the gear k period t;
(2.2) setting the quote of the power plant v in the gear k period t as betav,k,tAnd satisfy betav,k,t＞βg,k,t、βv,k,t＞βg+1,k,t、...、βv,k,t＞βG,k,t(ii) a Establishing a quotation information matrix beta of the power plant v in the time t according to the quotation of the power plant v in the gear k time tv(t), which specifically represents: beta is av(t)＝(βv,k,t...βv,K,t)T,k∈[1,K]；
In the formula, betav,K,tRepresenting the quoted price of the power plant v in the gear K period t;
similarly, according to the adjusting power of the power plant v in the period t of the gear k, an adjusting power matrix delta of the power plant v in the period t is establishedv(t), which specifically represents: deltav(t)＝(Δv,k,t...Δv,K,t),k∈[1,K]；
In the formula,. DELTA.v,K,tRepresents the regulated power of the plant v during the period t of gear K;
(2.3) according to the parameters beta (t), betav(t)、Δv(t) and Δ' (t), establishing a minimization objective function with respect to the overhead peak shaver cost:
Figure FDA0002998554700000061
wherein z is the total cost of the T time periods; t represents a period number; t denotes the total number of periods.
9. The clearing method of the power peak shaving auxiliary service market participated by the virtual power plant according to claim 8, characterized in that the adjustment power of the power distribution market under the constraint condition is solved according to the optimization goal and the constraint condition, and the specific method is as follows:
and (4) solving the minimum value of the minimized target function expression in the step (2.3) under the constraint condition expression, and obtaining an adjustment power matrix delta' (t) so as to obtain a clear result.
10. The utility model provides a virtual power plant participates in play clear device in electric power peak shaving auxiliary service market which characterized in that includes:
the acquisition device is used for acquiring topological data information and declaration data of the power grid and establishing an optimization target for obtaining a constraint condition of participation of the virtual power plant in electric power auxiliary peak shaving and cost of participation of the virtual power plant in electric power auxiliary peak shaving;
and the execution device is used for solving the adjustment power of the power distribution market under the constraint condition according to the constraint condition and the optimization target to obtain a clearing result.
11. A computer arrangement, characterized in that the computer arrangement comprises a memory storing a computer program and a processor implementing the steps of a method for participating in the power peak shaving aid service market of a virtual power plant according to claims 1-9 when the computer program is executed.
12. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of a method for a virtual power plant to participate in the clearing of a power peak shaving assistance service market according to claims 1-9.
CN202110338629.7A 2021-03-30 2021-03-30 Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market Pending CN113190963A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110338629.7A CN113190963A (en) 2021-03-30 2021-03-30 Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110338629.7A CN113190963A (en) 2021-03-30 2021-03-30 Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market

Publications (1)

Publication Number Publication Date
CN113190963A true CN113190963A (en) 2021-07-30

Family

ID=76974650

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110338629.7A Pending CN113190963A (en) 2021-03-30 2021-03-30 Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market

Country Status (1)

Country Link
CN (1) CN113190963A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113541140A (en) * 2021-09-13 2021-10-22 广东电网有限责任公司中山供电局 Virtual power plant peak regulation control method and system for distributed charging pile
CN113610435A (en) * 2021-08-24 2021-11-05 内蒙古电力(集团)有限责任公司电力调度控制分公司 Peak regulation method and device for power system based on thermal power, self-contained power plant and energy storage
CN113837444A (en) * 2021-08-26 2021-12-24 国网河南省电力公司经济技术研究院 Trading clearing optimization method for virtual power plant participating in multiple markets
CN114069613A (en) * 2021-11-03 2022-02-18 国网山东省电力公司东营供电公司 Method and system for regulating and controlling participation of self-contained power plant in peak regulation based on enterprise energy utilization characteristics
CN115438521A (en) * 2022-11-08 2022-12-06 中国电力科学研究院有限公司 Electric power market clearing method, device, equipment and medium participated by virtual power plant

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018059096A1 (en) * 2016-09-30 2018-04-05 国电南瑞科技股份有限公司 Combined decision method for power generation plans of multiple power sources, and storage medium
CN108599157A (en) * 2018-05-17 2018-09-28 东北电力大学 A kind of alternating current-direct current cooperation optimal dispatch method considering electricity price type demand response
CN109508853A (en) * 2018-09-20 2019-03-22 国电南瑞科技股份有限公司 Peak regulation ancillary service method of commerce and system between a kind of province
CN111222917A (en) * 2020-01-03 2020-06-02 广东电网有限责任公司电力调度控制中心 Virtual power plant bidding strategy interacting with power distribution side multi-element retail market

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018059096A1 (en) * 2016-09-30 2018-04-05 国电南瑞科技股份有限公司 Combined decision method for power generation plans of multiple power sources, and storage medium
CN108599157A (en) * 2018-05-17 2018-09-28 东北电力大学 A kind of alternating current-direct current cooperation optimal dispatch method considering electricity price type demand response
CN109508853A (en) * 2018-09-20 2019-03-22 国电南瑞科技股份有限公司 Peak regulation ancillary service method of commerce and system between a kind of province
CN111222917A (en) * 2020-01-03 2020-06-02 广东电网有限责任公司电力调度控制中心 Virtual power plant bidding strategy interacting with power distribution side multi-element retail market

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赵晋泉 等: "考虑虚拟电厂参与的深度调峰市场机制与出清模型", 《全球能源互联网》, vol. 3, no. 5, pages 469 - 476 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113610435A (en) * 2021-08-24 2021-11-05 内蒙古电力(集团)有限责任公司电力调度控制分公司 Peak regulation method and device for power system based on thermal power, self-contained power plant and energy storage
CN113837444A (en) * 2021-08-26 2021-12-24 国网河南省电力公司经济技术研究院 Trading clearing optimization method for virtual power plant participating in multiple markets
CN113837444B (en) * 2021-08-26 2023-12-26 国网河南省电力公司经济技术研究院 Transaction clearing optimization method for virtual power plant participating in multiple markets
CN113541140A (en) * 2021-09-13 2021-10-22 广东电网有限责任公司中山供电局 Virtual power plant peak regulation control method and system for distributed charging pile
CN114069613A (en) * 2021-11-03 2022-02-18 国网山东省电力公司东营供电公司 Method and system for regulating and controlling participation of self-contained power plant in peak regulation based on enterprise energy utilization characteristics
CN114069613B (en) * 2021-11-03 2024-03-12 国网山东省电力公司东营供电公司 Method and system for regulating and controlling participation peak shaving of self-contained power plant based on enterprise energy consumption characteristics
CN115438521A (en) * 2022-11-08 2022-12-06 中国电力科学研究院有限公司 Electric power market clearing method, device, equipment and medium participated by virtual power plant
CN115438521B (en) * 2022-11-08 2023-01-31 中国电力科学研究院有限公司 Electric power market clearing method, device, equipment and medium participated by virtual power plant

Similar Documents

Publication Publication Date Title
CN113190963A (en) Clearing method for virtual power plant participating in electric power peak regulation auxiliary service market
CN105046395B (en) Method for compiling day-by-day rolling plan of power system containing multiple types of new energy
CN103296682B (en) A kind of multiple space and time scales progressive become excellent load scheduling Model Design method
CN112803494B (en) Multi-target AGC coordinated optimization method and system containing wind, light, water and fire
CN112909933B (en) Intraday rolling optimization scheduling method containing pumped storage unit under spot market environment
CN104809545B (en) A kind of virtual plant runs modeling method
CN106602613A (en) Provincial and local two-level dispatching section coordination and control method
CN102543232A (en) Combined method for controlling water level and pressure of voltage stabilizer for nuclear power plant of pressurized water reactor
CN114336592B (en) Wind power plant AGC control method based on model predictive control
CN112581310A (en) Cascade hydropower station group power generation index distribution method
CN105610200A (en) Synchronous coordinated control based full-power control method for thermal power plant
CN109193805B (en) Non-iterative decomposition coordination dynamic scheduling method for transmission and distribution network
CN108062606B (en) Virtual power plant scheduling optimization method based on Riemann integral
CN111476474A (en) Scheduling method for reducing water abandonment amount of cascade hydropower station
CN110867907A (en) Power system scheduling method based on multi-type power generation resource homogenization
CN107947246B (en) Wind power generation index distribution and increased power evaluation method considering frequency modulation and increased power
CN109726894A (en) Ensure the new energy active command calculation method of spot exchange and medium-term and long-term electricity
CN107844652A (en) A kind of power system production analogy method of the regulating course containing electricity
CN113241780A (en) Power grid secondary frequency modulation control technology based on bald eagle search algorithm
CN115347583A (en) Energy internet power instruction distribution method and system based on multiple intelligent agents
He et al. Research on intraday rolling optimal dispatch including pumped storage power station
CN104037815A (en) Photovoltaic plant active power automatic-control method capable of eliminating grid transmission power out of limit
CN110717694B (en) Energy storage configuration random decision method and device based on new energy consumption expected value
CN105305933B (en) Photovoltaic plant control system and photoelectricity send control method and peak regulation control method outside
CN111754076A (en) Method and equipment suitable for electric power wholesale market mode evaluation

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