CN113595080B - Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm - Google Patents
Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm Download PDFInfo
- Publication number
- CN113595080B CN113595080B CN202111139215.8A CN202111139215A CN113595080B CN 113595080 B CN113595080 B CN 113595080B CN 202111139215 A CN202111139215 A CN 202111139215A CN 113595080 B CN113595080 B CN 113595080B
- Authority
- CN
- China
- Prior art keywords
- distribution network
- power distribution
- gardener
- algorithm
- active power
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 60
- 238000005457 optimization Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000004044 response Effects 0.000 claims abstract description 52
- 230000005611 electricity Effects 0.000 claims abstract description 38
- 230000007246 mechanism Effects 0.000 claims abstract description 11
- 238000013178 mathematical model Methods 0.000 claims abstract description 7
- 230000003044 adaptive effect Effects 0.000 claims description 46
- 230000008569 process Effects 0.000 claims description 17
- 238000010248 power generation Methods 0.000 claims description 14
- 150000001875 compounds Chemical class 0.000 claims description 6
- 230000008878 coupling Effects 0.000 claims description 6
- 238000010168 coupling process Methods 0.000 claims description 6
- 238000005859 coupling reaction Methods 0.000 claims description 6
- 230000006872 improvement Effects 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 claims description 6
- 230000035772 mutation Effects 0.000 claims description 6
- 230000009194 climbing Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 230000008030 elimination Effects 0.000 description 3
- 238000003379 elimination reaction Methods 0.000 description 3
- 230000005622 photoelectricity Effects 0.000 description 3
- 239000000463 material Substances 0.000 description 2
- 230000004083 survival effect Effects 0.000 description 2
- 101100293180 Arabidopsis thaliana MYB28 gene Proteins 0.000 description 1
- 101100293181 Arabidopsis thaliana MYB29 gene Proteins 0.000 description 1
- 101100020366 Mus musculus Krtap14 gene Proteins 0.000 description 1
- 101100510386 Mus musculus Krtap15-1 gene Proteins 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/007—Arrangements for selectively connecting the load or loads to one or several among a plurality of power lines or power sources
- H02J3/0075—Arrangements for selectively connecting the load or loads to one or several among a plurality of power lines or power sources for providing alternative feeding paths between load and source according to economic or energy efficiency considerations, e.g. economic dispatch
-
- 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/06315—Needs-based resource requirements planning or analysis
-
- 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
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/12—Circuit arrangements for ac mains or ac distribution networks for adjusting voltage in ac networks by changing a characteristic of the network load
- H02J3/14—Circuit arrangements for ac mains or ac distribution networks for adjusting voltage in ac networks by changing a characteristic of the network load by switching loads on to, or off from, network, e.g. progressively balanced loading
- H02J3/144—Demand-response operation of the power transmission or distribution network
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/381—Dispersed generators
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/46—Controlling of the sharing of output between the generators, converters, or transformers
- H02J3/466—Scheduling the operation of the generators, e.g. connecting or disconnecting generators to meet a given demand
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/10—Power transmission or distribution systems management focussing at grid-level, e.g. load flow analysis, node profile computation, meshed network optimisation, active network management or spinning reserve management
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
- H02J2300/20—The dispersed energy generation being of renewable origin
- H02J2300/22—The renewable source being solar energy
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
- H02J2300/20—The dispersed energy generation being of renewable origin
- H02J2300/28—The renewable source being wind energy
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2300/00—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation
- H02J2300/40—Systems for supplying or distributing electric power characterised by decentralized, dispersed, or local generation wherein a plurality of decentralised, dispersed or local energy generation technologies are operated simultaneously
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2310/00—The network for supplying or distributing electric power characterised by its spatial reach or by the load
- H02J2310/50—The network for supplying or distributing electric power characterised by its spatial reach or by the load for selectively controlling the operation of the loads
- H02J2310/56—The network for supplying or distributing electric power characterised by its spatial reach or by the load for selectively controlling the operation of the loads characterised by the condition upon which the selective controlling is based
- H02J2310/62—The condition being non-electrical, e.g. temperature
- H02J2310/64—The condition being economic, e.g. tariff based load management
-
- 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
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B70/00—Technologies for an efficient end-user side electric power management and consumption
- Y02B70/30—Systems integrating technologies related to power network operation and communication or information technologies for improving the carbon footprint of the management of residential or tertiary loads, i.e. smart grids as climate change mitigation technology in the buildings sector, including also the last stages of power distribution and the control, monitoring or operating management systems at local level
- Y02B70/3225—Demand response systems, e.g. load shedding, peak shaving
-
- 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
- Y04S20/00—Management or operation of end-user stationary applications or the last stages of power distribution; Controlling, monitoring or operating thereof
- Y04S20/20—End-user application control systems
- Y04S20/222—Demand response systems, e.g. load shedding, peak shaving
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Power Engineering (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides an active power distribution network double-layer optimization scheduling method based on an improved satin blue gardener algorithm, which comprises the following steps of: and establishing a double-layer optimization scheduling model considering the overall economy of the active power distribution network under the condition of demand response, wherein the model is a double-layer nonlinear programming mathematical model aiming at the lowest operation cost of the power distribution network system. The upper layer takes the time-of-use electricity price of the power distribution network as a variable and the objective function as the total operation cost, and the lower layer takes the output of the schedulable distributed power generator set of the active power distribution network as a variable and the objective function as the scheduling operation cost. The invention improves the global optimization capability of the satin blue gardener algorithm to the complicated double-layer nonlinear programming problem by introducing a nonlinear self-adaptive mechanism, can effectively improve the economical efficiency of the active power distribution network operation, and has practical value.
Description
Technical Field
The invention relates to the technical field of economic operation of an active power distribution network, in particular to a double-layer optimized scheduling method of the active power distribution network based on an improved satin blue gardener algorithm.
Background
Compared with the traditional power Distribution Network (ADN), an Active Distribution Network (ADN) having a schedulable unit has the capability of Active control and management, and is considered as a development direction of a future power Distribution Network. With the advance of the electricity change policy, the user side can also participate in the distribution network scheduling, so that the effect of demand response in the active distribution network is gradually highlighted. Meanwhile, Distributed energy (DG) such as Wind Turbine (WT), Photovoltaic Power Generation (PV) and gas Turbine (MGT) are added to the Power distribution network, so that the electricity purchasing cost of the system can be effectively reduced, and meanwhile, the day-ahead scheduling of the output of the schedulable unit is of great significance for reducing the network loss, improving the Power supply reliability of the system and reducing the operation cost of the Power distribution network.
Demand responses are currently divided into two categories, one being incentive type responses and the other being price type responses. The price type demand response borrows the price elasticity of the power demand, adjusts the electricity price, and enables the user side to actively participate in the scheduling process.
The Satin blue gardener algorithm (SBO) is a novel swarm intelligence algorithm which is provided by Seyyed H.S.M. equal to 2017 and simulates the doll behavior of adult male Satin blue gardeners in nature, is inspired by the nesting habit of the Satin blue gardener, and finds the optimal solution of the Optimization problem through the mechanisms of competition, variation and elimination. Compared with other optimization algorithms, the optimization effect of the SBO optimization algorithm is good, but the problems of low convergence speed, low convergence precision and the like exist.
Disclosure of Invention
The invention aims to provide a double-layer optimized dispatching method for an active power distribution network based on an improved satin blue gardener algorithm. Aiming at the problems of low overall search speed and low convergence precision of the original satin blue gardener optimization algorithm, the nonlinear adaptive search and variation idea is introduced for improvement, the search speed of the algorithm is improved, the optimization capability of the algorithm in different search stages is enhanced, and the optimal solution with higher precision is sought.
In order to achieve the purpose, the invention provides the following technical scheme: an active power distribution network double-layer optimization scheduling method based on an improved satin blue gardener algorithm comprises the following steps:
step 1: initializing parameters and establishing an improved power distribution network node system;
step 2: constructing a mathematical model of double-layer optimization scheduling of the active power distribution network containing demand response, wherein the upper layer is demand response optimization, the lower layer is active power distribution network operation optimization scheduling, and a target function with the minimum sum of the total cost of the upper layer of the active power distribution network optimization scheduling and the minimum cost of the lower layer of the active power distribution network scheduling operation is given, and corresponding constraint conditions of the upper layer and the lower layer are given;
and step 3: and (2) performing optimization solution on the model of the active power distribution network double-layer optimization scheduling in the step (2) by adopting a satin blue gardener algorithm based on nonlinear self-adaption improvement, inputting variables generated by an upper layer into a lower layer, inputting optimal adaptive values generated by a lower layer into the upper layer, updating the variables generated by iteration after the upper layer calculates the optimal values, inputting the variables into the lower layer, and outputting the optimal solution of time-of-use electricity price and schedulable unit output and corresponding objective function values if the upper layer meets the iteration termination condition.
Further, the step 1 specifically comprises: initializing parameters, establishing an active power distribution network topological structure containing various distributed power supplies, numbering nodes and branches, and adding loads and distributed data at designated nodes to realize grid connection of the active power distribution network distributed power supplies.
Further, the mathematical model of the active power distribution network double-layer optimization scheduling established in the step 2 is as follows:
an objective function:
in the formula (I), the compound is shown in the specification,for the sake of the total cost,in order to schedule the cost of the operation,cost for demand response; wherein:
in the formula:andrespectively the electricity prices and loads before the demand response,andrespectively the price of electricity and the load after response; simultaneously, the constraint conditions are met: (a) the method comprises the following steps of (a) user total electric quantity constraint, (b) user average electricity price constraint, (c) user demand response constraint, and (d) user participation constraint.
Wherein the user demand response constraint is:
in the formula:andthe loads before and after the demand response at time t,for user engagement, T is the total number of scheduled time periods,in order to obtain a high elastic coefficient of price,andrespectively the electricity prices before and after the demand response at the moment j.
The user engagement constraint is:
in the formula:for demand response user engagement, a value range of [0,1 ]],The upper limit of the participation degree is,for the purpose of the intensity of the price information,andrespectively, the upper and lower limits of the intensity of the price information.
Scheduling operation cost:
in the formula:、、、respectively calculating the power generation cost of the gas turbine, the wind power generation cost, the photovoltaic power generation cost and the power grid electricity purchasing cost;、andrespectively the number of the gas turbines, the wind power stations and the photovoltaic power stations which participate in scheduling, a, b and c are the power generation cost coefficients of the gas turbines,、、、、respectively wind power maintenance, wind power compensation, photoelectric maintenance, photoelectric compensation and main network electricity purchasing cost parameters,、、are respectively asThe generated energy of the gas turbine, the wind power station and the photovoltaic power station at any moment,and purchasing electric quantity from the main network for the distribution network.
Simultaneously, the constraint conditions are met: (a) power balance constraint, (b) distributed power supply output constraint, (c) climbing constraint, and (d) power distribution network power flow constraint.
Further, in the step 3, an optimized solution of the optimized scheduling of the active power distribution network is optimized by adopting an improved satin blue gardener optimization algorithm, and the steps are as follows:
s1: setting the total number of population individuals as N and the maximum iteration number as maximum;
s2: randomly generating initial satin blue gardener individuals, wherein the position information of each individual represents a time-sharing electricity price information set or a scheduling unit output set;
s3, calculating the adaptive value of the initial population, and calculating the proportion of the adaptive value of each individual in the total of the adaptive values of the population; the competition of the satin blue gardener takes the advantages and disadvantages of the puppet pavilion as a standard, and the individual adaptive value, namely the advantages and disadvantages of the puppet pavilion, is taken as the probability of the individual being selected in the natural selection process, so that the objective function value of each iteration can be ensured to be reduced or unchanged;
s4: updating the satin blue garden cub population; the male birds continuously adjust the parameters of the coupling pavilion by means of experience and information sharing, namely continuously updating individual position information, representing that time-of-use electricity price information or dispatching unit output is continuously adjusted, and an updating formula is as follows:
in the formula (I), the compound is shown in the specification,is the kth dimension variable of the ith generation of ith individuals,for the purpose of the step-size factor,is the k-dimension variable of the selected j-th individual,a k-dimension variable which is a global optimal individual; whereinSelecting through a roulette mechanism;
s5: introducing a self-adaptive mechanism into a satin blue gardener algorithm; changing the original fixed step size factor into a nonlinear adaptive factor:
in the formula: a is the step size maximum threshold value and,to select the probability, the probability is obtained by roulette,itin order to be able to perform the number of iterations,is the maximum value of the iteration times;、respectively, an adaptive upper and lower limiting factor.
S6: individual variation; the algorithm has certain probability variation, and the variation process follows normal distribution; the closer the fitness is to the global optimal solution, the greater the mutation probability is, and then the mutation probability under self-adaptation is:
in the formula:based on the probability of the variation,is the adapted value of the individual i,is the maximum adaptation value of the population.
S7: calculating the updated adaptive value of the satin blue gardener population, combining the new population with the old population, rearranging all individuals in the combined population according to the adaptive value, reserving a part of individuals with smaller adaptive values, eliminating the rest of individuals, and updating the global optimal adaptive value and the optimal individuals; judging whether a termination condition is met, if so, terminating iteration, and outputting an optimal adaptive value and a corresponding optimal individual, otherwise, continuing the next cycle from S4; the operation optimization scheduling process is nested in the demand response optimization process, and the optimal value calculated each time at the operation optimization scheduling layer is used as a part of the adaptive value of the demand response optimization to participate in the demand response optimization process.
Further, in the improved satin blue gardener algorithm, each dimension variable of each satin blue gardener represents power price information at one time or schedulable unit output at one time of a unit, each satin blue gardener represents power price information of one day or output state of all units of one day, and the improved satin blue gardener algorithm is to find a time-of-use power price and schedule unit output set under the optimal demand response meeting constraint conditions.
Compared with the prior art, the invention has the beneficial effects that:
the method of the invention adopts a double-layer optimization scheduling mode by introducing demand response, namely, the demand response is used for adjusting the load demand of the user, and meanwhile, the output of the schedulable unit is adjusted, thereby reducing the total operation cost of the active power distribution network. And an adaptive mechanism is adopted to improve the original satin blue gardener algorithm so as to enhance the global search capability of the algorithm, and the improved satin blue gardener algorithm is used for double-layer optimized scheduling of the active power distribution network, so that the convergence speed of the original problem is improved, the obtained optimal solution adaptive value is better, and the economic operation problem of the active power distribution network is effectively solved.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a flow chart of a modified satin blue gardener algorithm;
FIG. 3 is a modified power distribution network;
FIG. 4 is a daily load curve;
FIG. 5 is a wind and light power generation prediction curve;
FIG. 6 is a total cost convergence curve for the satin blue gardener algorithm;
FIG. 7 is a total cost convergence curve for the modified satin blue gardener algorithm;
FIG. 8 is the time of use electricity price under the satin blue gardener algorithm;
FIG. 9 is a time of use electricity price under the modified satin blue gardener algorithm;
FIG. 10 is a dispatch effort under the satin blue gardener algorithm;
fig. 11 is a scheduling effort under the improved satin blue gardener algorithm.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings and embodiments. The embodiments described herein are only for explaining the technical solution of the present invention and are not limited to the present invention.
According to the active power distribution network double-layer optimization scheduling method based on the improved satin blue gardener algorithm, after a photovoltaic generator set, a wind turbine generator set and a gas turbine are added into a 30-node power distribution network system, active power and reactive power of nodes change, the structure of the power distribution network changes from passive to active, the power transmission direction changes, and challenges are brought to the economy and reliability of the power distribution network. In addition, considering the effect of demand response on load can reduce the operating cost of the active power distribution network, but also increases the complexity of the problem. The dynamic adaptive capacity of the step factor is increased by depending on a self-adaptive mechanism, so that the dynamic adaptive capacity of the step factor can follow the change of a search stage, the characteristics of high convergence speed and strong optimization capability are achieved, the search strength near the optimal solution is increased, and the operation of the active power distribution network is more economic and reliable. As shown in fig. 1, the method comprises the following steps:
step 1: initializing parameters and establishing an improved power distribution network node system;
initializing parameters, establishing an active power distribution network topological structure containing various distributed power supplies, numbering nodes and branches, and adding loads and distributed data at designated nodes to realize grid connection of the active power distribution network distributed power supplies.
Step 2: and constructing a mathematical model of double-layer optimization scheduling of the active power distribution network containing demand response, wherein the upper layer is demand response optimization, the lower layer is active power distribution network operation optimization scheduling, and a target function with the minimum sum of the total cost of the upper layer active power distribution network optimization scheduling and the minimum cost of the lower layer active power distribution network scheduling operation is given, and corresponding constraint conditions of the upper layer and the lower layer are given.
The established mathematical model of the double-layer optimized scheduling of the active power distribution network is as follows:
an objective function:
in the formula (I), the compound is shown in the specification,for the sake of the total cost,in order to schedule the cost of the operation,cost for demand response; wherein:
in the formula:andrespectively the electricity prices and loads before the demand response,andrespectively the price of electricity and the load after response; simultaneously, the constraint conditions are met: (a) the method comprises the following steps of (a) user total electric quantity constraint, (b) user average electricity price constraint, (c) user demand response constraint, and (d) user participation constraint.
Wherein the user demand response constraint is:
in the formula:andthe loads before and after the demand response are respectively,for user engagement, T is the total number of scheduled time periods,in order to obtain the coefficient of mutual elasticity,andrespectively the electricity prices before and after the demand response at the moment j.
The user engagement constraint is:
in the formula:for demand response user engagement, a value range of [0,1 ]],The upper limit of the participation degree is,for the purpose of the intensity of the price information,andrespectively, the upper and lower limits of the intensity of the price information.
Scheduling operation cost:
in the formula:、、、respectively calculating the power generation cost of the gas turbine, the wind power generation cost, the photovoltaic power generation cost and the power grid electricity purchasing cost;、andrespectively the number of the gas turbines, the wind power stations and the photovoltaic power stations which participate in scheduling, a, b and c are the power generation cost coefficients of the gas turbines,、、、、respectively wind power maintenance, wind power compensation, photoelectric maintenance, photoelectric compensation and main network electricity purchasing cost parameters,、、are respectively asThe generated energy of the gas turbine, the wind power station and the photovoltaic power station at any moment,and purchasing electric quantity from the main network for the distribution network.
Simultaneously, the constraint conditions are met: (a) power balance constraint, (b) distributed power supply output constraint, (c) climbing constraint, and (d) power distribution network power flow constraint.
And step 3: and (2) performing optimization solution on the model of the active power distribution network double-layer optimization scheduling in the step (2) by adopting a satin blue gardener algorithm based on nonlinear self-adaption improvement, inputting variables generated by an upper layer into a lower layer, inputting optimal adaptive values generated by a lower layer into the upper layer, updating the variables generated by iteration after the upper layer calculates the optimal values, inputting the variables into the lower layer, and outputting the optimal solution of time-of-use electricity price and schedulable unit output and corresponding objective function values if the upper layer meets the iteration termination condition.
A flow chart of the improved satin blue gardener algorithm is illustrated in connection with fig. 2.
S1: setting the total number of population individuals as N and the maximum iteration number as maximum;
s2: randomly generating initial satin blue gardener individuals, wherein the position information of each individual represents a time-sharing electricity price information set or a scheduling unit output set;
s3: calculating the adaptive value of the initial population, and calculating the proportion of the adaptive value of each individual in the total of the adaptive values of the population; the competition of the satin blue gardener takes the advantages and disadvantages of the puppet pavilion as a standard, and the individual adaptive value, namely the advantages and disadvantages of the puppet pavilion, is taken as the probability of the individual being selected in the natural selection process, so that the objective function value of each iteration can be ensured to be reduced or unchanged;
s4: updating the satin blue garden cub population; the male birds continuously adjust the parameters of the coupling pavilion by means of experience and information sharing, namely continuously updating individual position information, representing that time-of-use electricity price information or dispatching unit output is continuously adjusted, and an updating formula is as follows:
in the formula (I), the compound is shown in the specification,is the kth dimension variable of the ith generation of ith individuals,for the purpose of the step-size factor,is the k-dimension variable of the selected j-th individual,a k-dimension variable which is a global optimal individual; whereinSelecting through a roulette mechanism;
s5: introducing a self-adaptive mechanism into a satin blue gardener algorithm; because the convergence rate of the original algorithm is low, the convergence precision is not high, the application of the original algorithm in the active power distribution network double-layer optimization scheduling under the demand response is not facilitated, the convergence rate of the algorithm can be improved by the self-adaptive improvement, and the algorithm has a good elastic optimization range, so that the original fixed step size factor is changed into a nonlinear self-adaptive factor:
in the formula: a is the step size maximum threshold value and,to select the probability, the probability is obtained by roulette,itin order to be able to perform the number of iterations,is the maximum value of the iteration times;、respectively are self-adaptive upper and lower limit factors;
s6: individual variation; in nature, part of the males steal materials from the coupling kiosks of other males, so that the algorithm has a certain probability variation, and the variation process follows normal distribution. The survival of suitable persons, the elimination of uncomfortable persons and the death are rules of the nature, the probability that the even pavilion of a stronger male bird is damaged is smaller, namely the closer the fitness is to the global optimal solution, the higher the mutation probability is, and the mutation probability under self-adaptation is as follows:
in the formula:based on the probability of the variation,is the adapted value of the individual i,the maximum adaptive value of the population;
s7: calculating the updated adaptive value of the satin blue gardener population, combining the new population with the old population, rearranging all individuals in the combined population according to the adaptive value, reserving a part of individuals with smaller adaptive values, eliminating the rest of individuals, and updating the global optimal adaptive value and the optimal individuals; judging whether a termination condition is met, if so, terminating iteration, and outputting an optimal adaptive value and a corresponding optimal individual, otherwise, continuing the next cycle from S4; it should be noted that the operation optimization scheduling process is nested in the demand response optimization process, and the optimal value calculated each time at the operation optimization scheduling layer is used as a part of the adaptive value of the demand response optimization to participate in the demand response optimization process.
In the improved satin blue gardener algorithm, each dimension variable of each satin blue gardener represents power price information at one moment or schedulable unit output at one moment of a unit, each satin blue gardener represents power price information of one day or output state of all units of one day, and the improved satin blue gardener algorithm is to search a time-sharing power price and schedule unit output set under the optimal demand response meeting constraint conditions.
Example (b): in order to verify the effectiveness of the improved satin blue gardener algorithm in the double-layer optimization scheduling, a photovoltaic generator, a wind driven generator and a gas turbine are configured in an IEEE30 node power distribution network system to serve as distributed energy, so that an original power distribution network is changed into an active power distribution network, as shown in figure 3, wherein the numbers 1-30 are node numbers. Wherein G is a main network connected to the distribution network, and the access positions, i.e., information, of other DGs are as follows in table 1:
TABLE 1 Power Access location and parameters of each DG
And taking 24 as the total scheduling time period number T, wherein a load power prediction curve is shown in figure 4, and the output prediction of the wind and light within 24 hours is shown in figure 5. The scheduling strategy is to preferentially consume wind power and photoelectricity, when the wind power and the photoelectricity cannot meet the system requirements, the small gas turbine is scheduled to generate electricity, and when the output of the gas turbine reaches the limit, electricity is purchased from the main network; when the wind power and the photoelectricity are too much, wind and light are abandoned.
The optimization method of the improved satin blue gardener optimization algorithm comprises the following steps:
s1: the total number N of the upper layer population is 30, the total number N of the lower layer population is 30, the maximum iteration time Maxiter of the upper layer is 100, and the lower layer is 20.
S2: initial satin blue bouillon individuals were randomly generated.
S3: calculating the adaptive value of the initial population, and calculating the proportion of the adaptive value of each individual in the total adaptive value of the population.
S4: and updating the satin blue gardener population. The male birds rely on experience and information sharing modes to continuously adjust parameters of the coupling kiosk, namely, continuously update individual vectors to achieve the optimal effect.
S5: introducing a self-adaptive mechanism into a satin blue gardener algorithm, setting a step factor into a non-linear self-adaptive factor, and changing an original updating formula (7) into:
wherein g isuAnd g d2 and 0.5 respectively, and alpha is 1.
S6: and (5) individual variation. In nature, part of the males steal materials from the coupling kiosks of other males, so that the algorithm has a certain probability variation, and the variation process follows normal distribution.
Survival of suitable persons, elimination of unsuitable persons and death are rules of the nature, the probability that the even pavilion of a stronger male bird is damaged is smaller, namely the fitness is closer to the global optimal solution variation probability, and the variation probability is shown in an expression (9), wherein the variation probability under self-adaptive improvement is as follows:
wherein p ismBased on the probability of variation, let pm=0.05。
The above steps were programmed and simulated with matlab2016a platform. In the invention, the active power distribution network reaches the optimal economic operation state by formulating reasonable time-of-use electricity price and scheduling the output of the gas turbine set in the active power distribution network. Fig. 6 is a graph of the convergence of the optimal total operating cost of the original satin blue gardener algorithm, and fig. 7 is a graph of the convergence of the optimal total operating cost of the improved satin blue gardener algorithm. The result proves that the improved satin blue gardener algorithm can find the optimal time-of-use electricity price and the optimal unit output, the convergence speed is high, and the effect is expected.
The calculation results are shown in Table 2
TABLE 2 simulation results
Compared with the original satin blue gardener algorithm, as shown in fig. 8 and fig. 10, the PMG1, the PMG2 and the PMG3 in the improved satin blue gardener algorithm are respectively the output power of the schedulable gas turbine generator sets MT1, MT2 and MT3, and the Pgrid is the input power of the main grid G, so that the electricity purchasing quantity of the main grid is reduced after optimization, the operation cost is reduced, the grid loss is reduced, and the operation of the power distribution network is more economic.
The foregoing merely represents preferred embodiments of the invention, which are described in some detail and detail, and therefore should not be construed as limiting the scope of the invention. It should be noted that, for those skilled in the art, various changes, modifications and substitutions can be made without departing from the spirit of the present invention, and these are all within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (4)
1. An active power distribution network double-layer optimization scheduling method based on an improved satin blue gardener algorithm is characterized by comprising the following steps: the method comprises the following steps:
step 1: initializing parameters and establishing an improved power distribution network node system;
step 2: constructing a mathematical model of double-layer optimization scheduling of the active power distribution network containing demand response; the upper layer is optimized by demand response, the lower layer is optimized by operation of the active power distribution network, and a target function with the minimum sum of the total cost of the optimized scheduling of the active power distribution network on the upper layer and the minimum scheduling operation cost of the active power distribution network on the lower layer are given, and corresponding constraint conditions of the upper layer and the lower layer are given;
the mathematical model of the active power distribution network double-layer optimization scheduling established in the step 2 is as follows:
an objective function:
in the formula (I), the compound is shown in the specification,for the sake of the total cost,in order to schedule the cost of the operation,cost for demand response; wherein:
in the formula:andrespectively the electricity prices and loads before the demand response,andrespectively the price of electricity and the load after response; simultaneously, the constraint conditions are met: the method comprises the following steps of (1) user total electric quantity constraint, user average electricity price constraint, user demand response constraint and user participation constraint;
wherein the user demand response constraint is:
in the formula:andthe loads before and after the demand response at time t,for user engagement, T is the total number of scheduled time periods,in order to obtain a high elastic coefficient of price,andrespectively are the electricity prices before and after the demand response at the moment j;
the user engagement constraint is:
in the formula:for demand response user engagement, a value range of [0,1 ]],The upper limit of the participation degree is,for the purpose of the intensity of the price information,andrespectively an upper limit and a lower limit of the intensity of the price information;
scheduling operation cost:
in the formula:、、、respectively calculating the power generation cost of the gas turbine, the wind power generation cost, the photovoltaic power generation cost and the power grid electricity purchasing cost;、andrespectively the number of the gas turbines, the wind power stations and the photovoltaic power stations which participate in scheduling, a, b and c are the power generation cost coefficients of the gas turbines,、、、、respectively wind power maintenance, wind power compensation, photoelectric maintenance, photoelectric compensation and main network electricity purchasing cost parameters,、、respectively the generated energy of the gas turbine, the wind power station and the photovoltaic power station at the moment,purchasing electric quantity from the main network for the distribution network;
simultaneously, the constraint conditions are met: a power balance constraint; output constraints of the distributed power supply; climbing restraint; power flow constraint of the power distribution network;
and step 3: optimizing and solving the model of the active power distribution network double-layer optimization scheduling in the step 2 by adopting a satin blue gardener algorithm based on nonlinear adaptive improvement; and if the upper layer meets the iteration termination condition, outputting the optimal solution of the time-of-use electricity price and the output of the schedulable unit and a corresponding objective function value.
2. The active power distribution network double-layer optimization scheduling method based on the improved satin blue gardener algorithm according to claim 1, characterized in that: the step 1 specifically comprises the following steps: initializing parameters, establishing an active power distribution network topological structure containing various distributed power supplies, numbering nodes and branches, and adding loads and distributed data at designated nodes to realize grid connection of the active power distribution network distributed power supplies.
3. The active power distribution network double-layer optimization scheduling method based on the improved satin blue gardener algorithm according to claim 1, characterized in that: and 3, optimizing the optimal solution of the optimal scheduling of the active power distribution network by adopting an improved satin blue gardener optimization algorithm, and comprising the following steps of:
s1: setting the total number of population individuals as N and the maximum iteration number as maximum;
s2: randomly generating initial satin blue gardener individuals, wherein the position information of each individual represents a time-sharing electricity price information set or a scheduling unit output set;
s3, calculating the adaptive value of the initial population, and calculating the proportion of the adaptive value of each individual in the total of the adaptive values of the population; the competition of the satin blue gardener takes the advantages and disadvantages of the puppet pavilion as a standard, and the individual adaptive value, namely the advantages and disadvantages of the puppet pavilion, is taken as the probability of the individual being selected in the natural selection process, so that the objective function value of each iteration can be ensured to be reduced or unchanged;
s4: updating the satin blue garden cub population; the male birds continuously adjust the parameters of the coupling pavilion by means of experience and information sharing, namely continuously updating individual position information, representing that time-of-use electricity price information or dispatching unit output is continuously adjusted, and an updating formula is as follows:
in the formula (I), the compound is shown in the specification,is the kth dimension variable of the ith generation of ith individuals,for the purpose of the step-size factor,is the k-dimension variable of the selected j-th individual,a k-dimension variable which is a global optimal individual; whereinSelecting through a roulette mechanism;
s5: introducing a self-adaptive mechanism into a satin blue gardener algorithm; changing the original fixed step size factor into a nonlinear adaptive factor:
in the formula: a is the step size maximum threshold value and,the probability of being selected, obtained by means of roulette,itin order to be able to perform the number of iterations,is the maximum value of the iteration times;、respectively are self-adaptive upper and lower limit factors;
s6: individual variation; the algorithm has certain probability variation, and the variation process follows normal distribution; the closer the fitness is to the global optimal solution, the greater the mutation probability is, and then the mutation probability under self-adaptation is:
in the formula:based on the probability of the variation,is the adapted value of the individual i,the maximum adaptive value of the population;
s7: calculating the updated adaptive value of the satin blue gardener population, combining the new population with the old population, rearranging all individuals in the combined population according to the adaptive value, reserving a part of individuals with smaller adaptive values, eliminating the rest of individuals, and updating the global optimal adaptive value and the optimal individuals; judging whether a termination condition is met, if so, terminating iteration, and outputting an optimal adaptive value and a corresponding optimal individual, otherwise, continuing the next cycle from S4; the operation optimization scheduling process is nested in the demand response optimization process, and the optimal value calculated each time at the operation optimization scheduling layer is used as a part of the adaptive value of the demand response to participate in the demand response optimization process.
4. The active power distribution network double-layer optimization scheduling method based on the improved satin blue gardener algorithm according to claim 3, characterized in that: in the improved satin blue gardener algorithm, each dimension variable of each satin blue gardener represents power price information at one moment or schedulable unit output at one moment of a unit, each satin blue gardener represents power price information of one day or output state of all units of one day, and the improved satin blue gardener algorithm is to search a time-sharing power price and schedule unit output set under the optimal demand response meeting constraint conditions.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111139215.8A CN113595080B (en) | 2021-09-28 | 2021-09-28 | Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111139215.8A CN113595080B (en) | 2021-09-28 | 2021-09-28 | Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113595080A CN113595080A (en) | 2021-11-02 |
CN113595080B true CN113595080B (en) | 2022-01-11 |
Family
ID=78242128
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202111139215.8A Active CN113595080B (en) | 2021-09-28 | 2021-09-28 | Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113595080B (en) |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9058443B2 (en) * | 2012-07-17 | 2015-06-16 | International Business Machines Corporation | Planning economic energy dispatch in electrical grid under uncertainty |
CN110956324B (en) * | 2019-11-29 | 2022-06-14 | 厦门大学 | Day-ahead high-dimensional target optimization scheduling method for active power distribution network based on improved MOEA/D |
CN112561273B (en) * | 2020-12-08 | 2022-04-05 | 上海电机学院 | Active power distribution network renewable DG planning method based on improved PSO |
-
2021
- 2021-09-28 CN CN202111139215.8A patent/CN113595080B/en active Active
Also Published As
Publication number | Publication date |
---|---|
CN113595080A (en) | 2021-11-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2022048127A1 (en) | Optimization and regulation method and system for thermoelectric heat pump-thermoelectricity combined system | |
CN110571863B (en) | Distributed power supply maximum acceptance capacity evaluation method considering flexibility of power distribution network | |
CN105207253B (en) | Consider wind-powered electricity generation and the probabilistic AGC stochastic and dynamics Optimization Scheduling of frequency | |
CN111242443A (en) | Deep reinforcement learning-based economic dispatching method for virtual power plant in energy internet | |
CN111934360B (en) | Virtual power plant-energy storage system energy collaborative optimization regulation and control method based on model predictive control | |
CN114374232B (en) | Two-stage optimization scheduling method of comprehensive energy system considering demand response | |
CN106712075A (en) | Peaking strategy optimization method considering safety constraints of wind power integration system | |
CN103580020A (en) | Method for multi-target dynamic optimal dispatching of power system with wind farm based on NSGA-II and Look-ahead | |
CN112803494B (en) | Multi-target AGC coordinated optimization method and system containing wind, light, water and fire | |
CN113378100B (en) | Power distribution network source network load storage collaborative optimization scheduling model and method considering carbon emission | |
CN112202206A (en) | Multi-energy micro-grid distributed scheduling method based on potential game | |
CN116667325B (en) | Micro-grid-connected operation optimization scheduling method based on improved cuckoo algorithm | |
CN113241780B (en) | Power grid secondary frequency modulation control method and system based on bald eagle search algorithm | |
CN115907232B (en) | Regional comprehensive energy system cluster collaborative optimization method, system, equipment and medium | |
Wang et al. | Peer-to-peer electricity transaction decisions of the user-side smart energy system based on the SARSA reinforcement learning | |
Abarghooee et al. | Stochastic dynamic economic emission dispatch considering wind power | |
CN115313520A (en) | Distributed energy system game optimization scheduling method, system, equipment and medium | |
Zhang et al. | Physical-model-free intelligent energy management for a grid-connected hybrid wind-microturbine-PV-EV energy system via deep reinforcement learning approach | |
CN115795992A (en) | Park energy Internet online scheduling method based on virtual deduction of operation situation | |
CN114977180A (en) | Microgrid low-carbon optimal scheduling method based on load side flexible resources | |
CN109474015A (en) | Active distribution network energy-storage system Optimal Configuration Method and system based on bilevel optimization | |
CN113595080B (en) | Active power distribution network double-layer optimization scheduling method based on improved satin blue gardener algorithm | |
Jadhav et al. | Economic load dispatch including wind power using plant growth simulation algorithm | |
CN117151308A (en) | Comprehensive energy system optimal scheduling method and system based on federal reinforcement learning | |
CN117291390A (en) | Scheduling decision model establishment method based on SumPree-TD 3 algorithm |
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 |