Comprehensive optimization scheduling method, device, equipment and storage medium for multiple virtual power plants

Abstract

The present invention relates to the field of electronic technology, and discloses a method, device, equipment and storage medium for comprehensive optimization scheduling of multiple groups of virtual power plants. The method solves the optimization scheduling model by using the information on the amount of electricity and electricity prices interacting between each group of virtual power plants and the power grid, the total amount of electricity sold by wind power stations, and the total amount of electricity sold by photovoltaic power stations to obtain optimization scheduling information for each group of virtual power plants, and performs comprehensive optimization scheduling on multiple virtual power stations based on the optimization scheduling information. The method provided by the present invention treats multiple groups of virtual power plants as a whole for optimization scheduling, obtains an optimization scheduling strategy by solving a pre-constructed optimization scheduling model, and optimizes and schedules multiple virtual power plants based on the optimization scheduling strategy. In the scheduling process, the mutual influence between the virtual power plant and the power grid system and the load is taken into account, thereby improving the operating efficiency and economic benefits of the entire system, and also improving energy utilization efficiency by optimizing the charging and discharging strategy of the energy storage system and the utilization of renewable energy.

Description

Technical Field

[0001] The present invention relates to the field of electronic technology, and in particular to a method, device, equipment and storage medium for comprehensive optimization scheduling of multiple virtual power plants. Background Art

[0002] A virtual power plant is a collection of distributed power sources, energy storage devices, and loads that can operate independently as a system. Virtual power plants can serve as a transition between the power system and consumers, and have the advantages of flexible and controllable power generation resources, market-optimized scheduling, and maintaining power system stability. In order for virtual power plants to maximize their electricity sales revenue, they need to be optimized and scheduled. In related technologies, the initial optimal scheduling strategy for the electricity sales revenue of a single virtual power plant is usually solved, and then the virtual power plant is coordinated and controlled based on the optimal scheduling strategy. However, the implementation of the scheduling strategy requires the cooperation of multiple parties such as the power grid system, other virtual power plants, and loads. A scheduling strategy determined solely based on a single virtual power plant cannot achieve multi-party cooperation, and is difficult to achieve in reality. Summary of the Invention

[0003] In view of this, the present invention provides a method, device, equipment and storage medium for comprehensive optimization scheduling of multiple groups of virtual power plants to solve the problem that the scheduling strategy determined based on a single virtual power plant alone cannot achieve multi-party cooperation and is difficult to achieve in reality.

[0004] In the first aspect, the present invention provides a method for comprehensive optimization scheduling of multiple groups of virtual power plants, the method comprising: obtaining first information and second information of multiple groups of virtual power plants, the first information being used to characterize the amount of electricity and electricity price of the interaction between the corresponding virtual power plant and the power grid, and the second information being used to characterize the total amount of electricity sold by the wind power station and the total amount of electricity sold by the photovoltaic power station corresponding to the virtual power plant; solving a pre-constructed optimization scheduling model using the first information and second information of multiple groups of virtual power plants to obtain optimization scheduling information of each group of virtual power plants, the optimization scheduling information including the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount and charge and discharge electricity price of the energy storage system in the corresponding virtual power plant, and the average sold electricity price corresponding to the wind power station and the photovoltaic power station respectively, and optimizing scheduling. The model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of multiple groups of virtual power plants. The total net profit from electricity sales of multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information, second information, amount of electricity sold to the load side and the electricity price of the corresponding virtual power plant, the charge and discharge amount and charge and discharge electricity price of the energy storage system, and the average sold electricity price corresponding to the wind power station and photovoltaic power station respectively; based on the optimized scheduling information, comprehensive optimized scheduling of multiple groups of virtual power plants is performed.

[0005] The present invention provides a method for comprehensive optimization scheduling of multiple groups of virtual power plants. The optimization scheduling model is solved by using the information on the amount of electricity and electricity price interacting between each group of virtual power plants and the power grid, the total amount of electricity sold by the wind power station, and the total amount of electricity sold by the photovoltaic power station to obtain the optimization scheduling information of each group of virtual power plants. The optimization scheduling model includes a first objective function, a second objective function, and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of multiple groups of virtual power plants. The total net profit from electricity sales of multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side, and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity sold to the load side and the electricity price, the charge and discharge amount and charge and discharge electricity price of the energy storage system, and the average sold electricity price corresponding to the wind power station and the photovoltaic power station respectively. Based on the optimization scheduling information, comprehensive optimization scheduling of multiple virtual power stations is performed. The method provided by the present invention regards multiple groups of virtual power plants as a whole for optimal scheduling. By solving a pre-built optimal scheduling model, an optimal scheduling strategy is obtained. Multiple virtual power plants are optimally scheduled based on the optimal scheduling strategy. During the scheduling process, the mutual influence between the virtual power plants and the power grid system and the load is taken into account, thereby improving the operating efficiency and economic benefits of the entire system. By optimizing the charging and discharging strategy of the energy storage system and the utilization of renewable energy, the optimal configuration of energy resources is achieved and the energy utilization efficiency is improved.

[0006] In an optional embodiment, the first information and second information of multiple groups of virtual power plants are used to solve a pre-constructed optimization scheduling model to obtain the optimization scheduling information of each group of virtual power plants, including: solving the first objective function using constraints and the first information of multiple groups of virtual power plants to obtain the corresponding amount of electricity and electricity price sold to the load side of each virtual power plant; solving the second objective function based on the corresponding amount of electricity and electricity price sold to the load side of the virtual power plant, the first information and the second information, and the constraints to obtain the charge and discharge amount and charge and discharge price of the energy storage system in each group of virtual power plants, the average sold electricity price of the wind power station in each group of virtual power plants, and the average sold electricity price of the photovoltaic power station.

[0007] In an optional embodiment, the first objective function is:

[0008] F1=max(E)

[0009]

[0010] Among them, F1 is the maximization of the total net income from electricity sales of multiple groups of virtual power plants; E is the total net income from electricity sales of multiple groups of virtual power plants; is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the final amount of electricity sold to the load side by the i-th group of virtual power plants; is the price of electricity sold to the grid by the i-th group of virtual power plants; is the amount of electricity sold to the grid by the i-th group of virtual power plants; is the electricity price purchased by the i-th group of virtual power plants from the grid; is the amount of electricity purchased from the grid by the i-th virtual power plant; N is the number of virtual power plants; are the buying and selling status of the i-th group of virtual power plants from the power grid, which are 0 or 1 variables.

[0011] In an optional embodiment, the second objective function is:

[0012] F2=max(W i )

[0013]

[0014] Among them, F2 is the maximum net profit of total electricity sales of the i-th group of virtual power plants; W i is the net revenue from electricity sales of the i-th group of virtual power plants; The electricity price for discharging the energy storage system of the i-th group of virtual power plants; The amount of electricity discharged from the energy storage system of the i-th virtual power plant; The electricity price for charging the energy storage system of the i-th group of virtual power plants; The amount of electricity used to charge the energy storage system of the i-th virtual power plant; is the average electricity price sold by the wind power plants in the i-th group of virtual power plants; is the total electricity sold by the wind power plants in the i-th group of virtual power plants; is the average electricity price sold by the photovoltaic power station of the i-th group of virtual power plants; is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants at time t, which are 0 or 1 variables.

[0015] In an optional embodiment, the constraint conditions include first constraint information, second constraint information, third constraint information and fourth constraint information; the first constraint information is used to characterize the constraint relationship between the function value of the first objective function and the function value of the second objective function; the second constraint information is used to characterize the constraint information of the electricity price and electricity quantity sold by each virtual power plant to the load side, as well as the constraint relationship between the electricity price and electricity quantity; the third constraint information is used to characterize the constraint information of the charging and discharging of the energy storage system of each virtual power plant; the fourth constraint information is used to characterize the constraint information of the discharge and charging status of the energy storage system of each group of virtual power plants, as well as the constraint information of the purchase and sale status from the power grid.

[0016] In a second aspect, the present invention provides a comprehensive optimization scheduling device for multiple groups of virtual power plants, which includes: an acquisition module for acquiring first information and second information of multiple groups of virtual power plants, the first information being used to characterize the amount of electricity and electricity price of the interaction between the corresponding virtual power plant and the power grid, and the second information being used to characterize the total amount of electricity sold by the wind power station and the total amount of electricity sold by the photovoltaic power station of the corresponding virtual power plant; a solution module for solving a pre-constructed optimization scheduling model using the first information and second information of the multiple groups of virtual power plants to obtain optimization scheduling information of each group of virtual power plants, the optimization scheduling information including the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount and charge and discharge electricity price of the energy storage system in the corresponding virtual power plant, and the average sold electricity price corresponding to the wind power station and the photovoltaic power station respectively. The optimization scheduling model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of multiple groups of virtual power plants. The total net profit from electricity sales of multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information, second information, amount of electricity sold to the load side and the electricity price of the corresponding virtual power plant, the charge and discharge amount and charge and discharge electricity price of the energy storage system, and the average sold electricity price corresponding to the wind power station and photovoltaic power station respectively; the scheduling module is used to perform comprehensive optimization scheduling of multiple groups of virtual power plants based on the optimized scheduling information.

[0017] In an optional embodiment, the solution module includes: a first solution sub-module, which is used to solve the first objective function using constraints and first information of multiple groups of virtual power plants to obtain the amount of electricity and electricity price sold to the load side corresponding to each virtual power plant; a second solution sub-module, which is used to solve the second objective function based on the amount of electricity and electricity price sold to the load side corresponding to the virtual power plant, the first information and the second information and constraints to obtain the charge and discharge amount and charge and discharge price of the energy storage system in each group of virtual power plants, the average sold electricity price of the wind power station in each group of virtual power plants, and the average sold electricity price of the photovoltaic power station.

[0018] In a third aspect, the present invention provides a computer device comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, and the processor executing the computer instructions to execute the method for comprehensive optimization and scheduling of multiple groups of virtual power plants according to the first aspect or any corresponding embodiment thereof.

[0019] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the method for comprehensive optimization and scheduling of multiple groups of virtual power plants according to the first aspect or any corresponding embodiment thereof.

[0020] In a fifth aspect, the present invention provides a computer program product comprising computer instructions, which are used to enable a computer to execute the method for comprehensive optimization and scheduling of multiple groups of virtual power plants according to the first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0022] Figure 1 is a flow chart of a method for comprehensive optimization and scheduling of multiple virtual power plants according to an embodiment of the present invention;

[0023] Figure 2 is a flow chart of another method for comprehensive optimization scheduling of multiple virtual power plants according to an embodiment of the present invention;

[0024] Figure 3 is a structural block diagram of a device for comprehensive optimization and scheduling of multiple virtual power plants according to an embodiment of the present invention;

[0025] Figure 4 Schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0026] To make the purpose, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts shall fall within the scope of protection of the present invention.

[0027] In related technologies, an initial optimal scheduling strategy is typically determined for the electricity sales revenue of a single virtual power plant, and then coordinated control of the virtual power plants is performed based on this optimal scheduling strategy. However, implementing this scheduling strategy requires the cooperation of multiple parties, including the power grid system, other virtual power plants, and loads. A scheduling strategy determined solely based on a single virtual power plant cannot achieve this multi-party coordination, making it difficult to implement in reality.

[0028] In view of this, the embodiment of the present application provides a method for comprehensive optimization and scheduling of multiple virtual power plants, which can be applied to a server to achieve comprehensive optimization and scheduling of multiple virtual power plants. The method provided by the present invention treats multiple virtual power plants as a whole for optimization and scheduling, obtains an optimization scheduling strategy by solving a pre-built optimization scheduling model, and optimizes and schedules multiple virtual power plants based on the optimization scheduling strategy. In the scheduling process, the mutual influence between the virtual power plant and the power grid system and the load is taken into account, thereby improving the operating efficiency and economic benefits of the entire system. In addition, by optimizing the charging and discharging strategy of the energy storage system and the utilization of renewable energy, the optimal configuration of energy resources is achieved, and the energy utilization efficiency is improved.

[0029] According to an embodiment of the present invention, an embodiment of a method for comprehensive optimization scheduling of multiple groups of virtual power plants is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0030] In this embodiment, a multi-group virtual power plant comprehensive optimization scheduling method is provided, which can be used for the above-mentioned server. Figure 1 is a flow chart of a method for comprehensive optimization scheduling of multiple virtual power plants according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:

[0031] Step S101: Acquire first information and second information of multiple groups of virtual power plants.

[0032] Exemplarily, the first information is used to characterize the amount of electricity and the price of electricity that the corresponding virtual power plant interacts with the power grid, and the second information is used to characterize the total amount of electricity sold by the wind power station and the total amount of electricity sold by the photovoltaic power station of the corresponding virtual power plant. In the embodiment of the present application, the amount of electricity and the price of electricity that each virtual power plant interacts with the power grid include the amount of electricity sold by the virtual power plant to the power grid and the price of the electricity, as well as the amount of electricity purchased by the virtual power plant from the power grid and the price of the electricity. The total amount of electricity sold by the wind power station is the total amount of electricity sold by the wind power station in the virtual power plant, and the total amount of electricity sold by the photovoltaic power station is the total amount of electricity sold by the photovoltaic power station in the virtual power plant.

[0033] In step S102, the pre-built optimization scheduling model is solved using the first information and the second information of multiple groups of virtual power plants to obtain the optimization scheduling information of each group of virtual power plants. The optimization scheduling information includes the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount and charge and discharge electricity price of the energy storage system in the corresponding virtual power plant, and the average selling price of the wind power station and photovoltaic power station respectively.

[0034] Exemplarily, the optimization scheduling model includes a first objective function, a second objective function, and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of multiple groups of virtual power plants. The total net profit from electricity sales of multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side, and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity sold to the load side and the electricity price, the charge and discharge amount and charge and discharge electricity price of the energy storage system, and the average sold electricity price corresponding to the wind power station and the photovoltaic power station. In the embodiment of the present application, the optimal solution of the model is obtained by solving the optimization scheduling model. Based on the optimal solution, the optimal scheduling strategy for each group of virtual power plants can be obtained.

[0035] Step S103: performing comprehensive optimization scheduling on multiple groups of virtual power plants based on the optimization scheduling information.

[0036] For example, in an embodiment of the present application, the scheduling strategy obtained by solving the optimization scheduling model treats multiple groups of virtual power plants as a whole for optimization scheduling, taking into account the mutual influence between the virtual power plants and the power grid system and loads, thereby improving the operating efficiency and economic benefits of the entire system.

[0037] The comprehensive optimization scheduling method for multiple groups of virtual power plants provided in this embodiment treats multiple groups of virtual power plants as a whole for optimization scheduling. By solving a pre-built optimization scheduling model, an optimization scheduling strategy is obtained, and multiple virtual power plants are optimized and scheduled based on the optimization scheduling strategy. During the scheduling process, the mutual influence between the virtual power plants and the power grid system and the load is taken into account, thereby improving the operating efficiency and economic benefits of the entire system. By optimizing the charging and discharging strategy of the energy storage system and the utilization of renewable energy, the optimal allocation of energy resources is achieved and the energy utilization efficiency is improved.

[0038] In this embodiment, a multi-group virtual power plant comprehensive optimization scheduling method is provided, which can be used for the above-mentioned server. Figure 2 is a flow chart of a method for comprehensive optimization scheduling of multiple virtual power plants according to an embodiment of the present invention. Figure 2 As shown, the process includes the following steps:

[0039] Step S201: Obtain first information and second information of multiple groups of virtual power plants. The first information is used to represent the amount of electricity and electricity prices interacting between the corresponding virtual power plant and the power grid. The second information is used to represent the total amount of electricity sold by the wind power station and the total amount of electricity sold by the photovoltaic power station of the corresponding virtual power plant. Figure 1 Step S101 of the illustrated embodiment will not be described in detail here.

[0040] Step S202, using the first information and second information of multiple groups of virtual power plants to solve the pre-constructed optimization scheduling model, to obtain the optimization scheduling information of each group of virtual power plants, the optimization scheduling information includes the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount of the energy storage system and the charge and discharge electricity price in the corresponding virtual power plant, and the average selling electricity price corresponding to the wind power station and photovoltaic power station respectively. The optimization scheduling model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit of electricity sales of multiple groups of virtual power plants. The total net profit of electricity sales of multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit of electricity sales of each group of virtual power plants. The total net profit of electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity and electricity price sold to the load side, the charge and discharge amount of the energy storage system and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and photovoltaic power station respectively.

[0041] Specifically, the above step S202 includes:

[0042] Step S2021: Solve the first objective function using the constraint conditions and the first information of multiple groups of virtual power plants to obtain the amount of electricity and electricity price sold to the load side corresponding to each virtual power plant.

[0043] Exemplarily, the first objective function is solved by using constraints and first information of multiple groups of virtual power plants to obtain an optimal solution to the first objective function, which maximizes the total net revenue from electricity sales of the multiple groups of virtual power plants.

[0044] In step S2022, the second objective function is solved based on the amount of electricity and electricity price sold to the load side corresponding to the virtual power plant, the first information, the second information, and the constraints, to obtain the charge and discharge amount and charge and discharge electricity price of the energy storage system in each group of virtual power plants, the average sold electricity price of the wind power station in each group of virtual power plants, and the average sold electricity price of the photovoltaic power station.

[0045] Exemplarily, the second objective function is solved based on the first information, the second information and the optimal solution of the first objective function of each group of virtual power plants to obtain the optimal solution of the second objective function, which maximizes the total net profit of electricity sales of the corresponding virtual power plant.

[0046] In some optional implementations, the first objective function is shown in the following formula (1):

[0047]

[0048] Among them, F1 is the maximization of the total net income from electricity sales of multiple groups of virtual power plants; E is the total net income from electricity sales of multiple groups of virtual power plants; is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the final amount of electricity sold to the load side by the i-th group of virtual power plants; is the price of electricity sold to the grid by the i-th group of virtual power plants; is the amount of electricity sold to the grid by the i-th group of virtual power plants; is the electricity price purchased by the i-th group of virtual power plants from the grid; is the amount of electricity purchased from the grid by the i-th virtual power plant; N is the number of virtual power plants; are the buying and selling status of the i-th group of virtual power plants from the power grid, which are 0 or 1 variables. Indicates that the virtual power plant of group i is in the sold state from the grid, It indicates that the virtual power plant of group i is in the buying state from the power grid.

[0049] In some optional implementations, the second objective function is shown in the following formula (2):

[0050]

[0051] Among them, F2 is the maximum net profit of total electricity sales of the i-th group of virtual power plants; W i is the net revenue from electricity sales of the i-th group of virtual power plants; The electricity price for discharging the energy storage system of the i-th group of virtual power plants; The amount of electricity discharged from the energy storage system of the i-th virtual power plant; The electricity price for charging the energy storage system of the i-th group of virtual power plants; The amount of electricity used to charge the energy storage system of the i-th virtual power plant; is the average electricity price sold by the wind power plants in the i-th group of virtual power plants; is the total electricity sold by the wind power plants in the i-th group of virtual power plants; is the average electricity price sold by the photovoltaic power station of the i-th group of virtual power plants; is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants at time t, which are 0 or 1 variables. It means that the energy storage system of the virtual power plant group i at time t is in the discharging state, It indicates that the energy storage system of the i-th group of virtual power plants is in a charging state at time t.

[0052] In some optional implementations, the constraint conditions include first constraint information, second constraint information, third constraint information, and fourth constraint information.

[0053] The first constraint information is used to characterize the constraint relationship between the function value of the first objective function and the function value of the second objective function. For example, the constraint relationship between the first objective function and the second objective function is

[0054] The second constraint information is used to characterize the constraint information of the electricity price and power quantity sold by each virtual power plant to the load side, as well as the constraint relationship between the electricity price and power quantity. For example, in the actual operation of the power market, the electricity demand on the load side often has a certain degree of elasticity. For example, when the electricity selling price increases, part of the transferable load will be transferred to consumption when the electricity selling price is lower. Therefore, changes in the electricity selling price may encourage the load to change its own electricity consumption habits, thereby affecting the final transaction volume. The constraints on the electricity price and power quantity sold by the virtual power plant to the load side are shown in the following equations (3) to (11):

[0055]

[0056] in, is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the price of electricity sold to the grid by the i-th group of virtual power plants; is the electricity price purchased by the i-th group of virtual power plants from the grid; is the predicted electricity price sold by the i-th group of virtual power plants to the load side;

[0057]

[0058] Among them, e i ≥0, is the change in the amount of electricity sold to the load side by the virtual power plant in group i, e i is the load elasticity coefficient of the i-th group of virtual power plants, is the predicted amount of electricity sold to the load side by the virtual power plant in group i,

[0059] is the change in electricity price sold by the i-th group of virtual power plants to the load side;

[0060]

[0061] in, is the change in the amount of electricity sold to the load side by the virtual power plant in group i, is the amount of electricity sold to the load side by the i-th group of virtual power plants;

[0062]

[0063] in, is the change in electricity price sold by the i-th group of virtual power plants to the load side, is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the predicted electricity price sold by the i-th group of virtual power plants to the load side;

[0064]

[0065] in, is the predicted amount of electricity sold to the load side by the virtual power plant in group i, is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the price of electricity sold to the grid by the i-th group of virtual power plants; is the predicted electricity price sold by the i-th group of virtual power plants to the load side, is the amount of electricity sold to the load side by the i-th group of virtual power plants;

[0066]

[0067] Where t represents the time, is the change in the amount of electricity sold to the load side by the i-th group of virtual power plants at time t; T represents the T-th moment;

[0068]

[0069] in, and They represent the lower and upper limits of the change in the amount of electricity sold to the load side by the virtual power plant in group i, is the change in the amount of electricity sold to the load side by the i-th group of virtual power plants at time t;

[0070]

[0071] in, and They represent the lower and upper limits of the price change of electricity sold by the i-th group of virtual power plants to the load side;

[0072]

[0073] in, is the amount of electricity sold to the load by the virtual power plant in group i at time T. The meanings of the remaining variables are not further elaborated. In the embodiment of the present application, by considering the elasticity of the load to the electricity price in the constraints, the scheduling strategy can adapt to the dynamic changes in the market and load, thereby enhancing the flexibility and adaptability of the system.

[0074] The third constraint information is used to characterize the constraint information of charging and discharging of the energy storage system of each virtual power plant. For example, when the energy generated by the virtual power plant is greater than the load demand, the energy storage system should store the energy. Conversely, when the energy generated by the virtual power plant is less than the load demand, the energy storage system should release the stored energy. The model of the energy storage system and the constraint conditions of the charge / discharge amount are as follows (12) to (18):

[0075]

[0076] Among them, SOC i,t The charge of the energy storage system of the i-th virtual power plant at time t; SOC i,t+1 The charge of the energy storage system of the i-th virtual power plant at time t+1; is the charging efficiency of the energy storage system of the i-th group of virtual power plants at time t; is the discharge efficiency of the energy storage system of the i-th group of virtual power plants at time t; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants at time t; is the amount of energy discharged by the energy storage system of the i-th group of virtual power plants at time t; The amount of electricity charged to the energy storage system of the i-th group of virtual power plants at time t;

[0077]

[0078] in, are the lower and upper limits of discharge of the energy storage system of the i-th group of virtual power plants, respectively;

[0079]

[0080] in, are the lower and upper limits of charging for the energy storage system of the i-th group of virtual power plants, respectively;

[0081]

[0082] in, are the upper and lower limits of the energy storage system charge of the i-th group of virtual power plants;

[0083] SOC i,0 =SOC i,T (16)

[0084] Among them, SOC i,t The charge of the energy storage system of the i-th virtual power plant at time 0, SOC i,T The charge of the energy storage system of the i-th virtual power plant at time T;

[0085]

[0086] in, are the buying and selling status of the virtual power plant in group i from the grid, which are 0 or 1 variables, is the total electricity sold by the wind power plants in the i-th group of virtual power plants; is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants respectively;

[0087]

[0088] in, No. i The rated capacity of the virtual power plant, is the total electricity sold by the wind power plants in the i-th group of virtual power plants; is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants respectively; The amount of electricity discharged by the energy storage system of the i-th group of virtual power plants.

[0089] The fourth constraint information is used to characterize the constraint information of the energy storage system discharge and charge status of each group of virtual power plants, as well as the constraint information of the purchase and sale status from the power grid. For example, under normal operation, the energy storage system cannot charge and discharge at the same time. Similarly, under normal operation, the virtual system should not sell electricity to and purchase electricity from the power grid at the same time. The fourth constraint information is as follows (19) to (22):

[0090]

[0091]

[0092]

[0093]

[0094] The meaning of each parameter is described in the above related content and will not be repeated here.

[0095] In the embodiment of the present application, a relaxation factor can be introduced to solve the optimization scheduling. The relaxation factor is used to control the change of each iteration of the variable, which mainly affects the convergence speed and convergence of the iteration. The relaxation factor is between 0-1. The smaller the relaxation factor, the smaller the change between two iterations. In this way, the calculation is more stable, but the calculation speed is slow. In the embodiment of the present application, the relaxation factor can be determined based on actual needs. The embodiment of the present application does not limit the specific content of the preset relaxation factor. The solution process includes the following steps:

[0096] (1) Use relaxation factors to transform each constraint into a corresponding equality constraint;

[0097] (2) Solve the objective function using the transformed equation constraints, the first information and the second information of each virtual power plant, and a preset solution algorithm to obtain a solution result.

[0098] The aforementioned pre-defined solution algorithm may include, but is not limited to, a genetic algorithm, which optimizes the solution to a problem by simulating natural genetic mechanisms (such as selection, crossover, and mutation). It begins with a randomly generated set of initial solutions (a population) and iteratively optimizes the individuals in the population in the hope of finding the optimal or near-optimal solution to the problem. The genetic algorithm primarily includes the following steps:

[0099] (1) Randomly generate populations.

[0100] (2) Determine whether the individual's fitness meets the optimization criteria based on the strategy. If so, output the best individual and its optimal solution, and the process ends. Otherwise, proceed to the next step.

[0101] (3) Parents are selected based on fitness. Individuals with high fitness are more likely to be selected, while individuals with low fitness are eliminated.

[0102] (4) Use the chromosomes of the parents to cross according to a certain method to generate offspring.

[0103] (5) Mutate the chromosomes of the offspring.

[0104] (6) Generate a new generation of population by crossover and mutation, and return to step (2) until the optimal solution is generated.

[0105] Step S203: Perform comprehensive optimization scheduling on multiple groups of virtual power plants based on the optimization scheduling information. Figure 1 Step S103 of the illustrated embodiment will not be described in detail here.

[0106] The comprehensive optimization scheduling method provided by the present invention has the following advantages:

[0107] (1) Systematic optimization: Multiple groups of virtual power plants are optimized and dispatched as a whole, taking into account the mutual influence between virtual power plants and the power grid system and loads, thereby improving the operating efficiency and economic benefits of the entire system.

[0108] (2) Flexibility and adaptability: By considering the elastic changes of load to electricity prices, the dispatching strategy can adapt to the dynamic changes of the market and load, thereby enhancing the flexibility and adaptability of the system.

[0109] (3) Maximization of economic benefits: Through a two-layer nested optimization model, the goal is to maximize the total net revenue from electricity sales of the virtual power plant, thereby improving economic benefits.

[0110] (4) Optimal resource allocation: By optimizing the charging and discharging strategies of the energy storage system and the utilization of renewable energy, the optimal allocation of energy resources is achieved and the energy utilization efficiency is improved.

[0111] (5) Power system stability: The integration and optimized scheduling of virtual power plants help maintain the stability of the power system and reduce fluctuations caused by supply and demand imbalances.

[0112] (6) Improved market competitiveness: Optimizing dispatch strategies helps virtual power plants gain a better competitive position in the electricity market and attract more consumers by providing more cost-effective electricity services.

[0113] (7) Risk management: Through the constraints and parameter estimation of the model, potential market and technical risks can be evaluated and managed to reduce operational risks.

[0114] (8) Market adaptability: The scheme design takes market dynamics into consideration, enabling the virtual power plant to quickly adapt to changes in the external environment.

[0115] (9) Data-driven decision-making: The solution relies on accurate data and parameter estimation, making the decision-making process more scientific and data-driven.

[0116] (10) Scalability: The optimization scheduling method has good scalability and can be applied to virtual power plants of different sizes and types, as well as different market and policy environments.

[0117] In this embodiment, a multi-group virtual power plant comprehensive optimization scheduling device is also provided. The device is used to implement the above-mentioned embodiments and preferred implementation methods. The details that have been described will not be repeated here. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and conceivable.

[0118] This embodiment provides a multi-group virtual power plant comprehensive optimization scheduling device, such as Figure 3 Shown, including:

[0119] An acquisition module 301 is configured to acquire first information and second information of multiple groups of virtual power plants, wherein the first information is used to represent the amount of electricity and electricity prices interacting between the corresponding virtual power plants and the power grid, and the second information is used to represent the total amount of electricity sold by the wind power stations and the total amount of electricity sold by the photovoltaic power stations of the corresponding virtual power plants;

[0120] The solution module 302 is used to solve the pre-constructed optimization scheduling model using the first information and the second information of the multiple groups of virtual power plants to obtain the optimization scheduling information of each group of virtual power plants. The optimization scheduling information includes the amount of electricity and the electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount of the energy storage system in the corresponding virtual power plant and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively. The optimization scheduling model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit of electricity sales of the multiple groups of virtual power plants. The total net profit of electricity sales of the multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit of electricity sales of each group of virtual power plants. The total net profit of electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity sold to the load side and the electricity price, the charge and discharge amount of the energy storage system and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively.

[0121] The scheduling module 303 is used to perform comprehensive optimization scheduling on multiple groups of virtual power plants based on the optimization scheduling information.

[0122] In some optional implementations, the solution module 302 includes:

[0123] A first solving submodule is configured to solve the first objective function using the constraint conditions and the first information of the plurality of virtual power plants to obtain the amount of electricity and the electricity price corresponding to each virtual power plant sold to the load side;

[0124] The second solving submodule is used to solve the second objective function based on the amount of electricity and electricity price sold to the load side corresponding to the virtual power plant, the first information, the second information, and the constraints, to obtain the charging and discharging amount of the energy storage system in each group of virtual power plants and the charging and discharging electricity price, the average selling price of the wind power station in each group of virtual power plants, and the average selling price of the photovoltaic power station.

[0125] In some optional implementations, the first objective function is:

[0126] F1=max(E)

[0127]

[0128] Among them, F1 is the maximization of the total net income from electricity sales of multiple groups of virtual power plants; E is the total net income from electricity sales of multiple groups of virtual power plants; is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; is the final amount of electricity sold to the load side by the i-th group of virtual power plants; is the price of electricity sold to the grid by the i-th group of virtual power plants; is the amount of electricity sold to the grid by the i-th group of virtual power plants; is the electricity price purchased by the i-th group of virtual power plants from the grid; is the amount of electricity purchased from the grid by the i-th virtual power plant; N is the number of virtual power plants; are the buying and selling status of the i-th group of virtual power plants from the power grid, which are 0 or 1 variables.

[0129] In some optional implementations, the second objective function is:

[0130] F2=max(W i )

[0131]

[0132] Among them, F2 is the maximum net profit of total electricity sales of the i-th group of virtual power plants; W i is the net revenue from electricity sales of the i-th group of virtual power plants; The electricity price for discharging the energy storage system of the i-th group of virtual power plants; The amount of electricity discharged from the energy storage system of the i-th virtual power plant; The electricity price for charging the energy storage system of the i-th group of virtual power plants; The amount of electricity used to charge the energy storage system of the i-th virtual power plant; is the average electricity price sold by the wind power plants in the i-th group of virtual power plants; is the total electricity sold by the wind power plants in the i-th group of virtual power plants; is the average electricity price sold by the photovoltaic power station of the i-th group of virtual power plants; is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants at time t, which are 0 or 1 variables.

[0133] In some optional implementations, the constraint condition includes first constraint information, second constraint information, third constraint information, and fourth constraint information;

[0134] The first constraint information is used to represent the constraint relationship between the function value of the first objective function and the function value of the second objective function;

[0135] The second constraint information is used to represent the price and quantity of electricity sold by each virtual power plant to the load side, as well as the constraint relationship between the price and quantity;

[0136] The third constraint information is used to represent the constraint information of charging and discharging of the energy storage system of each virtual power plant;

[0137] The fourth constraint information is used to characterize the constraint information of the discharge and charging status of the energy storage system of each group of virtual power plants and the constraint information of the purchase and sale status from the power grid.

[0138] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0139] In this embodiment, multiple groups of virtual power plant comprehensive optimization scheduling devices are presented in the form of functional units, where the units refer to ASIC (Application Specific Integrated Circuit) circuits, processors and memories that execute one or more software or fixed programs, and / or other devices that can provide the above functions.

[0140] The embodiment of the present invention also provides a computer device having the above Figure 3 Multiple groups of virtual power plant comprehensive optimization scheduling devices are shown.

[0141] See also Figure 4 , Figure 4 is a structural diagram of a computer device provided by an optional embodiment of the present invention, such as Figure 4 As shown, the computer device includes: one or more processors 10, memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components utilize different buses to communicate with each other and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in the memory or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Equally, multiple computer devices can be connected, and each device provides part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 4 A processor 10 is taken as an example.

[0142] The processor 10 may be a central processing unit, a network processor, or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit, a programmable logic device, or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic, or any combination thereof.

[0143] The memory 20 stores instructions that can be executed by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0144] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created based on the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely located relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0145] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0146] The computer device further includes a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0147] The embodiment of the present invention also provides a computer-readable storage medium. The above-mentioned method according to the embodiment of the present invention can be implemented in hardware, firmware, or implemented as a computer code that can be recorded in a storage medium, or implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and downloaded through a network and will be stored in a local storage medium, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state drive, etc.; further, the storage medium can also include a combination of the above-mentioned types of memory. It can be understood that a computer, a processor, a microprocessor controller or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor or hardware, the method shown in the above embodiment is implemented.

[0148] A portion of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the form in which the computer program instruction exists in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc. Accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium that can be accessed by the computer.

[0149] Although the embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention. Such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A comprehensive optimization scheduling method for multiple virtual power plants, characterized in that: The method comprises: Obtaining first information and second information of multiple groups of virtual power plants, wherein the first information is used to represent the amount of electricity and electricity prices interacting between the corresponding virtual power plants and the power grid, and the second information is used to represent the total amount of electricity sold by the wind power stations and the total amount of electricity sold by the photovoltaic power stations of the corresponding virtual power plants; The first information and second information of the multiple groups of virtual power plants are used to solve the pre-constructed optimization scheduling model to obtain the optimization scheduling information of each group of virtual power plants, the optimization scheduling information includes the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount of the energy storage system and the charge and discharge electricity price in the corresponding virtual power plant, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively. The optimization scheduling model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of the multiple groups of virtual power plants. The total net profit from electricity sales of the multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity and electricity price sold to the load side, the charge and discharge amount of the energy storage system and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively. Based on the optimized scheduling information, the multiple groups of virtual power plants are comprehensively optimized and scheduled.

2. The method according to claim 1, characterized in that The step of solving a pre-built optimization scheduling model using the first information and the second information of the multiple groups of virtual power plants to obtain the optimization scheduling information of each group of virtual power plants includes: Solving the first objective function using the constraint conditions and the first information of the multiple groups of virtual power plants to obtain the amount of electricity sold to the load side and the electricity price corresponding to each virtual power plant; The second objective function is solved based on the electricity amount and electricity price sold to the load side corresponding to the virtual power plant, the first information and the second information, and the constraints to obtain the charging and discharging electricity amount and charging and discharging electricity price of the energy storage system in each group of virtual power plants, the average sold electricity price of the wind power station in each group of virtual power plants, and the average sold electricity price of the photovoltaic power station.

3. The method according to claim 1, characterized in that The first objective function is: Among them, F1 is the maximization of the total net income from electricity sales of multiple groups of virtual power plants; E is the total net income from electricity sales of multiple groups of virtual power plants; is the transaction price of electricity sold by the i-th group of virtual power plants to the load side; P i load ' is the final amount of electricity sold to the load side by the i-th group of virtual power plants; i sell is the price of electricity sold by the i-th group of virtual power plants to the grid; P i sell is the amount of electricity sold to the grid by the i-th group of virtual power plants; i buy is the electricity price purchased by the i-th group of virtual power plants from the grid; P i buy is the amount of electricity purchased from the grid by the i-th virtual power plant; N is the number of virtual power plants; are the buying and selling status of the i-th group of virtual power plants from the power grid, which are 0 or 1 variables.

4. The method according to claim 3, characterized in that The second objective function is: F2=max(W i ) Among them, F2 is the maximum net profit of total electricity sales of the i-th group of virtual power plants; W i is the net revenue from electricity sales of the i-th group of virtual power plants; is the electricity price of the energy storage system of the i-th group of virtual power plants; P i d The amount of electricity discharged from the energy storage system of the i-th virtual power plant; The electricity price for charging the energy storage system of the i-th group of virtual power plants; P i c The amount of electricity used to charge the energy storage system of the i-th virtual power plant; i wind is the average electricity price of the wind power station in the i-th group of virtual power plants; P i wind is the total electricity sold by the wind power station of the i-th group of virtual power plants; i pho is the average electricity price of the photovoltaic power station of the i-th group of virtual power plants; P i pho is the total electricity sold by the photovoltaic power station of the i-th group of virtual power plants; are the discharging and charging states of the energy storage system of the i-th group of virtual power plants at time t, which are 0 or 1 variables.

5. The method according to any one of claims 1 to 4, characterized in that The constraint conditions include first constraint information, second constraint information, third constraint information and fourth constraint information; The first constraint information is used to represent a constraint relationship between a function value of the first objective function and a function value of the second objective function; The second constraint information is used to represent the constraint information of the electricity price and quantity sold by each virtual power plant to the load side, as well as the constraint relationship between the electricity price and quantity; The third constraint information is used to represent the constraint information of charging and discharging of the energy storage system of each virtual power plant; The fourth constraint information is used to characterize the constraint information of the discharge and charging status of the energy storage system of each group of virtual power plants and the constraint information of the purchase and sale status from the power grid.

6. A multi-group virtual power plant comprehensive optimization scheduling device, characterized in that: The device comprises: an acquisition module, configured to acquire first information and second information of multiple groups of virtual power plants, wherein the first information is used to represent the amount of electricity and electricity prices interacting between the corresponding virtual power plants and the power grid, and the second information is used to represent the total amount of electricity sold by the wind power stations and the total amount of electricity sold by the photovoltaic power stations of the corresponding virtual power plants; A solution module is used to solve a pre-constructed optimization scheduling model using the first information and second information of the multiple groups of virtual power plants to obtain the optimization scheduling information of each group of virtual power plants, wherein the optimization scheduling information includes the amount of electricity and electricity price sold to the load side by the corresponding virtual power plant, the charge and discharge amount of the energy storage system in the corresponding virtual power plant and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively. The optimization scheduling model includes a first objective function, a second objective function and constraints. The first objective function is constructed with the goal of maximizing the total net profit from electricity sales of the multiple groups of virtual power plants. The total net profit from electricity sales of the multiple groups of virtual power plants is calculated based on the first information of each group of virtual power plants, the amount of electricity sold to the load side and the electricity price. The second objective function is constructed with the goal of maximizing the total net profit from electricity sales of each group of virtual power plants. The total net profit from electricity sales of each group of virtual power plants is calculated based on the first information of the corresponding virtual power plant, the second information, the amount of electricity and electricity price sold to the load side, the charge and discharge amount of the energy storage system and the charge and discharge electricity price, and the average selling electricity price corresponding to the wind power station and the photovoltaic power station respectively. A scheduling module is used to perform comprehensive optimization scheduling on the multiple groups of virtual power plants based on the optimization scheduling information.

7. The device according to claim 6, characterized in that The solution module includes: a first solving submodule, configured to solve the first objective function using the constraint conditions and the first information of the plurality of virtual power plants, to obtain the amount of electricity sold to the load side and the electricity price corresponding to each virtual power plant; The second solving submodule is used to solve the second objective function based on the electricity amount and electricity price sold to the load side corresponding to the virtual power plant, the first information and the second information, and the constraint conditions, to obtain the charging and discharging electricity amount and charging and discharging electricity price of the energy storage system in each group of virtual power plants, the average sold electricity price of the wind power station in each group of virtual power plants, and the average sold electricity price of the photovoltaic power station.

8. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, computer instructions are stored in the memory, and the processor executes the comprehensive optimization scheduling method for multiple groups of virtual power plants according to any one of claims 1 to 5 by executing the computer instructions.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the comprehensive optimization scheduling method for multiple groups of virtual power plants according to any one of claims 1 to 5.

10. A computer program product, characterized in that It includes computer instructions, which are used to enable a computer to execute the comprehensive optimization scheduling method for multiple groups of virtual power plants according to any one of claims 1 to 5.

Images