Distributed collaborative dispatching method and device for multiple virtual power plants in county energy internet
By building twins in the county energy Internet environment and adopting data distribution services, distributed collaborative interactions between virtual power plants are realized, and multi-objective optimization technology is used to solve the problem of maximizing the interests of multiple virtual power plants, achieving optimization benefits Fair distribution.
Patent Information
- Application Number
- CN202311562829.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-11-22
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2043-11-22
AI Technical Summary
In the county-level energy Internet environment, the existing scheduling methods cannot maximize the interests of multiple virtual power plants, mainly due to information asymmetry and uncertainty and time-varying of the power generation capacity and cost of virtual power plants.
By building twins, using data distribution services to achieve distributed collaborative interactions between virtual power plants, and using multi-objective optimization technology to build the objective functions of county-level regulation centers and virtual power plants to solve the scheduling method that maximizes the interests of multiple subjects.
The interests of multiple virtual power plants have been maximized, and the benefits are distributed fairly among different entities, meeting the economic benefits expectations of different entities.
Smart Images

Figure CN117371758B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the fields of energy, electricity and information technology, and in particular to a distributed collaborative scheduling method and device for multiple virtual power plants in a county energy Internet. Background Art
[0002] In terms of virtual power plants participating in the day-ahead dispatch of the power system, according to the dispatch operation mode, it can be divided into centralized dispatch mode and centralized bidding mode. The centralized dispatch mode is based on the complete physical model and data of each market player, and the exchange power curve of the next day of each market player is obtained by establishing and solving the global optimal dispatch model, while the centralized bidding mode is based on the clearing calculation of the quantity-price curve reported by each market player, and the market clearing electricity price and the exchange power curve of each market player the next day are obtained.
[0003] In a market-oriented competition environment, due to the different investment entities, the internal models and data of each market entity are often not fully disclosed as private information. There is information asymmetry between market entities and between them and market operators. Therefore, the technical route of global optimization scheduling calculation based on complete physical models and data is no longer applicable.
[0004] If a centralized bidding model is adopted, since the market clearing electricity price is highly coupled with the quantity-price curves reported by each market player, and the power generation capacity and cost of virtual power plants have prominent uncertainty and time-varying characteristics compared to conventional power sources, the quotations of various virtual power plants are often inconsistent or even conflicting, resulting in the clearing results failing to maximize the interests of multiple players. Summary of the invention
[0005] In view of this, the present invention provides a distributed collaborative scheduling method and device for multiple virtual power plants in a county energy Internet, so as to solve the problem that the current scheduling method cannot maximize the interests of multiple virtual power plants in a county energy Internet environment.
[0006] In the first aspect, the present invention provides a distributed collaborative scheduling method for multiple virtual power plants in a county energy Internet, the method comprising: constructing twins for the equipment, virtual power plants, upper-level virtual power plants and county control centers in the county energy Internet; solving the pre-constructed multi-objective and multi-agent objective function based on the data obtained by the data distribution service between the twins to obtain a scheduling method when the interests of multiple agents are maximized.
[0007] The distributed collaborative scheduling method for multiple virtual power plants in the county energy Internet provided by the embodiment of the present invention adopts data distribution service technology to support distributed collaborative interaction between virtual power plants, and adopts multi-objective optimization technology to achieve multi-subject and multi-objective distributed collaborative scheduling optimization, thereby maximizing the interests of multiple subjects, achieving fair distribution of optimization benefits among different subjects, and meeting the economic benefit expectations of different subjects.
[0008] In an optional embodiment, the twins include device-level twins, power plant-level twins, upper-level twins and county twins. After constructing twins for the equipment, virtual power plants, upper-level virtual power plants and county control centers in the county energy Internet, the method also includes: hierarchically dividing the device-level twins, power plant-level twins, upper-level twins and county twins to obtain multiple levels; establishing a communication plane for twins belonging to the same level, and the communication plane is used for communication between twins at the same level.
[0009] In this embodiment, the constructed twins are divided into levels and a communication plane is established for the twins in the same level. Thus, the twins in the same communication plane can share communication, thereby solving the authentication problem between twins and avoiding intrusion by twins that are not in the communication plane.
[0010] In an optional implementation, based on the data obtained by using the data distribution service between the twins, the pre-constructed multi-objective and multi-agent objective function is solved to obtain a scheduling method when the interests of the multiple subjects are maximized, including: based on the communication plane, using the data distribution service to interact and share data between the twins; constructing the first objective function of the county control center and the second objective function of the virtual power plant, determining the constraints of the first objective function and the constraints of the second objective function; based on the interactive and shared data and constraints, solving the first objective function and the second objective function to obtain a scheduling method when the interests of the multiple subjects are maximized.
[0011] In this embodiment, data distribution services are used to achieve data interaction and sharing, which can ensure real-time, efficient and flexible data distribution and meet the needs of distributed real-time communication scenarios between twins. Multi-objective optimization is achieved by constructing the first objective function of the county control center and the second objective function of the virtual power plant, and solving the two objective functions.
[0012] In an optional implementation, based on interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain a scheduling method for maximizing the interests of multiple subjects, including: based on the constraints, using a non-dominated sorting genetic algorithm with an elite strategy to solve the first objective function and the second objective function to obtain a solution result; based on interactive and shared data, calculating the information entropy of each solution in the solution result to obtain a multi-objective optimal solution; and using the multi-objective optimal solution as the scheduling method for maximizing the interests of multiple subjects.
[0013] In this embodiment, a non-dominated sorting genetic algorithm with an elite strategy is first used to solve the two objective functions to obtain solution results, and then the multi-objective optimal solution is determined by calculating the information entropy of the solution, which reflects the principle of equitable sharing of benefits according to costs.
[0014] In an optional embodiment, the information entropy of each solution in the solution result is calculated to obtain a multi-objective optimal solution, including: determining the information entropy discreteness of the multi-objective optimization solution according to the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; minimizing the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution.
[0015] In this embodiment, by respectively calculating the proportion of the first objective function value and the second objective function value in the total objective function value, the benefit proportion of the two objectives is reflected respectively. At the same time, the information entropy discreteness is determined by comprehensively considering the benefit proportion of the two objectives. By minimizing the discreteness, the optimization benefits can be evenly distributed among the virtual power plants and power grid systems.
[0016] In an optional embodiment, a first objective function of the county control center and a second objective function of the virtual power plant are constructed, including: constructing the first objective function by minimizing the total dispatching cost when the virtual power plant participates in dispatching according to the power of the generator sets when the virtual power plant participates in the operation of the power grid and when the virtual power plant does not participate in the operation of the power grid; constructing the second objective function by minimizing the power generation cost when the virtual power plant participates in dispatching.
[0017] In this embodiment, the first objective function and the second objective function are respectively constructed by the total dispatching cost and the power generation cost when the virtual power plant participates in the dispatching, so that the virtual power plant can be included in the global resource optimization configuration to maximize the interests of multiple subjects.
[0018] In an optional embodiment, the interactive and shared data include real-time active power, adjustable limits, dispatch power and dispatch cost; the constraints include satisfying the adjustable limits and rates of the generator sets and virtual power plants and satisfying the system power balance constraints.
[0019] In the second aspect, the present invention provides a distributed collaborative scheduling device for multiple virtual power plants in a county energy Internet, the device comprising: a twin construction module, used to construct twins for equipment, virtual power plants, upper-level virtual power plants and county control centers in the county energy Internet; a scheduling module, used to solve the pre-constructed multi-objective and multi-agent objective function based on the data obtained by the data distribution service between the twins, and obtain the scheduling method when the interests of multiple subjects are maximized.
[0020] In an optional embodiment, the twins include equipment-level twins, power plant-level twins, upper-level twins and county twins, and the device also includes: a hierarchical division module, used to divide the equipment-level twins, power plant-level twins, upper-level twins and county twins into multiple levels; a communication plane establishment module, used to establish a communication plane for twins belonging to the same level, and the communication plane is used for communication between twins at the same level.
[0021] In an optional embodiment, the scheduling module includes: a data sharing module, which is used to use data distribution services to interact and share data between twins based on the communication plane; a function construction module, which is used to construct the first objective function of the county control center and the second objective function of the virtual power plant, and determine the constraints of the first objective function and the constraints of the second objective function; a solution module, which is used to solve the first objective function and the second objective function based on the interactive and shared data and constraints, and obtain the scheduling method when the interests of multiple subjects are maximized.
[0022] In an optional embodiment, the solution module includes: a first solution module, which is used to solve the first objective function and the second objective function based on constraints and adopt a non-dominated sorting genetic algorithm with an elite strategy to obtain a solution result; a second solution module, which is used to calculate the information entropy of each solution in the solution result based on interactive and shared data to obtain a multi-objective optimal solution; a scheduling submodule, which is used to adopt the multi-objective optimal solution as a scheduling method when maximizing the interests of multiple subjects.
[0023] In an optional embodiment, the second solution module is specifically used to: determine the information entropy discreteness of the multi-objective optimization solution based on the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; minimize the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution.
[0024] In an optional embodiment, the function construction module is specifically used to: construct a first objective function by minimizing the total dispatching cost when the virtual power plant participates in scheduling based on the power of the generator sets when the virtual power plant participates in the operation of the power grid and when the virtual power plant does not participate in the operation of the power grid; construct a second objective function by minimizing the power generation cost when the virtual power plant participates in scheduling.
[0025] In an optional embodiment, the interactive and shared data include real-time active power, adjustable limits, dispatch power and dispatch cost; the constraints include satisfying the adjustable limits and rates of the generator sets and virtual power plants and satisfying the system power balance constraints.
[0026] In the third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the distributed collaborative scheduling method of multiple virtual power plants in the county energy Internet according to the above-mentioned first aspect or any corresponding embodiment thereof by executing the computer instructions.
[0027] 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 distributed collaborative scheduling method for multiple virtual power plants in a county energy Internet according to the first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0029] Figure 1 It is a flowchart of a distributed collaborative scheduling method for multiple virtual power plants in a county energy internet according to an embodiment of the present invention;
[0030] Figure 2 It is a flowchart of another distributed collaborative scheduling method for multiple virtual power plants in the county energy Internet according to an embodiment of the present invention;
[0031] Figure 3 It is a flowchart of another distributed collaborative scheduling method for multiple virtual power plants in the county energy Internet according to an embodiment of the present invention;
[0032] Figure 4 Schematic diagram of the management framework of the whole process of discovery, authentication and sharing of each layer according to an embodiment of the present invention;
[0033] Figure 5 is a schematic diagram of a distributed collaborative interactive communication sharing mechanism based on DDS according to an embodiment of the present invention;
[0034] Figure 6 is a structural block diagram of a distributed collaborative dispatching device for multiple virtual power plants in a county energy internet according to an embodiment of the present invention;
[0035] Figure 7 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0036] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the 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 creative work are within the scope of protection of the present invention.
[0037] According to an embodiment of the present invention, an embodiment of a distributed collaborative scheduling method for multiple virtual power plants in a county energy Internet is provided. It should be noted that the steps shown in the flowchart in 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 may be executed in an order different from that shown here.
[0038] In this embodiment, a distributed collaborative scheduling method for multiple virtual power plants in a county energy internet is provided, which can be used for electronic devices such as computers, mobile phones, tablet computers, etc. Figure 1 is a flow chart of a distributed collaborative scheduling method for multiple virtual power plants in a county energy internet according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:
[0039] Step S101, construct a twin for the equipment, virtual power plant, upper-level virtual power plant and county control center in the county energy Internet. Among them, the equipment mainly includes source-load-storage equipment. A virtual power plant is a power coordination management system that uses advanced information and communication technology and software systems to achieve the aggregation and coordinated optimization of distributed energy such as distributed power generation, energy storage systems, controllable loads, electric vehicles, etc., so as to participate in the power market and power grid operation as a special power plant. A virtual power plant is composed of multiple different source-load-storage devices, and multiple virtual power plants can also further construct an upper-level virtual power plant, that is, the virtual power plant includes multiple levels. The county control center is used to realize the control of equipment and virtual power plants in the entire county Internet.
[0040] Therefore, when constructing a twin, a twin is constructed for the source-load-storage device to obtain a device-level twin, a twin is constructed for the virtual power plant to obtain a power plant-level twin, a twin is constructed for the upper-level virtual power plant to obtain an upper-level twin, and a twin is constructed for the county dispatching center to obtain a county twin. Among them, the constructed twin is a digital twin, which is a conceptual system of interaction between the physical world and the digital space. It is both a new technology and a new paradigm. It makes full use of physical models, sensor updates, operation history and other data, integrates multi-disciplinary, multi-physical quantity, multi-scale, and multi-probability simulation processes, and completes mapping in the virtual space, thereby reflecting the entire life cycle process of the corresponding physical equipment. It should be noted that this embodiment can refer to the construction method of the twin in the related technology when constructing the twin, and the present invention is not limited to this.
[0041] In addition, after the device-level twins, power plant-level twins, upper-level twins and county twins are constructed, the constructed twins are sent to the upper-level virtual power plant or the county control center for optimization and control.
[0042] Step S102, based on the data obtained by the data distribution service between the twins, the pre-constructed multi-objective multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized. Specifically, this embodiment uses the data distribution service to realize data sharing between twins. The data distribution service is a new generation of distributed real-time communication middleware protocol. It adopts a publish / subscribe system architecture, emphasizes data-centricity, and provides a rich service quality strategy to ensure that data is distributed in real time, efficiently, and flexibly, which can meet the needs of various distributed real-time communication applications. In addition, in this embodiment, a multi-objective multi-agent objective function is constructed, wherein the multi-objective means that the scheduling method of the present invention includes multiple objectives, such as the objectives of the county control center, the objectives of the virtual power plant, etc. Multi-agent means that the constructed objective function involves multiple subjects participating in the scheduling, such as equipment, virtual power plants, etc. By using the acquired data, the objective function of the multi-objective multi-agent is solved, and the optimization of multiple objectives is realized, thereby maximizing the interests of multiple subjects, realizing the fair distribution of optimization benefits among different subjects, and meeting the economic benefit expectations of different subjects.
[0043] The distributed collaborative scheduling method for multiple virtual power plants in the county energy Internet provided by the embodiment of the present invention adopts data distribution service technology to support distributed collaborative interaction between virtual power plants, and adopts multi-objective optimization technology to achieve multi-subject and multi-objective distributed collaborative scheduling optimization, thereby maximizing the interests of multiple subjects, achieving fair distribution of optimization benefits among different subjects, and meeting the economic benefit expectations of different subjects.
[0044] In this embodiment, a distributed collaborative scheduling method for multiple virtual power plants in a county energy internet is provided. Figure 3As shown, the process includes the following steps:
[0045] Step S201: construct twins for the equipment, virtual power plants, upper-level virtual power plants, and county control centers in the county energy internet. Figure 1 Step S101 of the illustrated embodiment will not be described in detail here.
[0046] Step S202, hierarchical division of the equipment-level twins, power plant-level twins, upper-level twins and county-level twins to obtain multiple levels; specifically, in order to achieve collaborative interaction between twins, the constructed twins are divided into levels, thereby realizing the whole process of distributed collaborative interaction, discovery, authentication and sharing within the layer. Among them, the levels divided in this embodiment include the level where the equipment-level twins and the power plant-level twins are located, the level where the power plant-level twins and the upper-level twins are located, and the county-level twins are respectively at the level where the equipment-level twins, the power plant-level twins and the upper-level twins are located, totaling three levels.
[0047] Step S203, establish a communication plane for twins belonging to the same level, and the communication plane is used for communication between twins at the same level. Specifically, by establishing a domain communication plane for twins belonging to the same level, based on the data distribution service (DDS) mechanism, twins in the same domain can share communication, thereby solving the authentication problem between twins and avoiding intrusion of twins outside the domain.
[0048] Step S204: Based on the data obtained by the data distribution service between twins, the pre-built multi-objective multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized. Figure 1 Step S102 of the illustrated embodiment will not be described in detail here.
[0049] In this embodiment, a distributed collaborative scheduling method for multiple virtual power plants in a county energy internet is provided. Figure 3 As shown, the method comprises the following steps:
[0050] Step S301: construct twins for the equipment, virtual power plants, upper-level virtual power plants, and county control centers in the county energy internet; see Figure 1 Step S101 of the illustrated embodiment will not be described in detail here.
[0051] Step S302: hierarchically divide the equipment-level twins, power plant-level twins, upper-level twins, and county-level twins into multiple levels. Figure 2 Step S202 of the illustrated embodiment will not be described in detail here.
[0052] Step S303: establish a communication plane for twins belonging to the same level, and the communication plane is used for communication between twins at the same level. Figure 2 Step S203 of the illustrated embodiment will not be described in detail here.
[0053] Step S304, based on the data obtained by the data distribution service between the twins, the pre-built multi-objective and multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized.
[0054] Specifically, the above step S304 includes:
[0055] Step S3041, based on the communication plane, data distribution service is used to interact and share data between twins. Specifically, each twin in the same domain, i.e., domain participant, can publish or subscribe to data as a publisher or subscriber, thereby enabling efficient subject discovery and data sharing in the same domain. Data interaction between multiple twins in the same domain can achieve efficient subject discovery and data sharing.
[0056] As attached Figure 5 As shown, each twin in the same domain first publishes real-time active power, adjustable limit, adjustment rate, dispatch power, dispatch cost and other data to the DDS global data space as a publisher, and other twins in the same domain read the data they need from the DDS global data space as subscribers, thereby realizing the interaction and sharing of data between twins, avoiding the problem of information asymmetry between the subjects in the related technology. It should be noted that the specific interactive and shared data can be determined according to actual needs, and the embodiment of the present invention does not make specific limitations on this.
[0057] Step S3042, construct the first objective function of the county control center and the second objective function of the virtual power plant, and determine the constraints of the first objective function and the second objective function; specifically, the goal of the county control center is to minimize the total dispatch cost of the entire system by incorporating the virtual power plant into the system dispatch relative to when the virtual power plant does not participate in the dispatch optimization. The goal of the virtual power plant is to minimize the power generation cost relative to independent operation by participating in the system dispatch optimization.
[0058] The above step S3042 includes:
[0059] Step a1, according to the power of the generator set when the virtual power plant participates in the grid operation and when the virtual power plant does not participate in the grid operation, the first objective function is constructed by minimizing the total dispatching cost when the virtual power plant participates in the dispatching; specifically, the first objective function can be expressed as:
[0060]
[0061] In the formula, λ F It is the penalty cost coefficient for the infeasibility of the interactive power curve of the virtual power plant, which is usually much larger than the maximum possible dispatch cost; Is the virtual power plant i responding to the interactive power P i The decision variable P j (t) is the power of conventional generator set j when the virtual power plant does not participate in grid interaction; P j '(t) is the power of conventional generator set j when the virtual power plant participates in grid interaction operation; i (t) is the electricity price of the virtual power plant; j (t) is the unit power generation cost of conventional generator set j; N TPP is the number of conventional generating units; N VPP is the number of virtual power plants, and T is the period of system scheduling optimization.
[0062] Step a2, constructing a second objective function based on minimizing the power generation cost when the virtual power plant participates in scheduling. Specifically, the second objective function can be expressed as:
[0063]
[0064] In the formula, is the virtual power plant i with interactive power P i The scheduling cost at time P i0 is the exchange power curve of virtual power plant i operating as a non-dispatchable load. i is the variable that needs to be solved here.
[0065] Step S3043, based on the interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain a scheduling method when the benefits of multiple agents are maximized.
[0066] Specifically, the above step S3043 includes:
[0067] Step b1, based on the constraints, a non-dominated sorting genetic algorithm with an elite strategy is used to solve the first objective function and the second objective function to obtain a solution result. The constraints include satisfying the physical operation constraints such as the adjustable limits and rates of conventional generators and virtual power plants; and also satisfying the system power balance constraints.
[0068] The non-dominated sorting genetic algorithm (NSGA) is a multi-objective optimization algorithm. The main idea of the NSGA algorithm is to sort the individuals in the population according to the non-dominated relationship, and then perform selection, crossover and mutation operations based on the sorting results. The non-dominated sorting genetic algorithm with elite strategy (NSGAII) introduces the elite strategy on the basis of the NSGA algorithm, that is, retaining the best individuals in each generation of the population. Specifically, the process of the NSGAII algorithm is as follows:
[0069] 1. Initialize the population, including the genotype and fitness value of the individuals.
[0070] 2. Perform non-dominated sorting on the individuals in the population to obtain the rank and crowding degree of each individual.
[0071] 3. Perform selection operations based on level and crowding degree to select a portion of individuals as the next generation of population, and retain the best individuals in each generation of population.
[0072] 4. Perform crossover and mutation operations on the selected individuals to generate new individuals.
[0073] 5. Add new individuals to the next generation population.
[0074] 6. Repeat steps 2-5 until the stopping condition is reached.
[0075] The elite strategy of the NSGAII algorithm can effectively improve the convergence speed and search ability of the algorithm. By retaining the best individuals in each generation of the population, the NSGAII algorithm can avoid falling into the local optimal solution, making it easier to find the global optimal solution. Among them, when using the NSGAII algorithm to solve, the physical operation constraints and system power balance constraints that need to be met are combined to achieve the solution of the two objective functions.
[0076] Step b2, based on the interactive and shared data, calculate the information entropy of each solution in the solution result to obtain the multi-objective optimal solution; specifically, the solution result obtained by using the NSGAII algorithm includes multiple solutions. At this time, the county control center selects the solution that makes the yield of each virtual power plant and the power grid system as balanced as possible according to the interactive data of each virtual power plant as the multi-objective optimal solution, thereby reflecting the principle of fair sharing of benefits according to costs. The selection method of the multi-objective optimal solution in this embodiment is realized by calculating the information entropy of the solution.
[0077] Among them, the information entropy of each solution in the solution result is calculated to obtain a multi-objective optimal solution, including: determining the information entropy discreteness of the multi-objective optimization solution according to the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; minimizing the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution.
[0078] Therefore, the information entropy calculation method can be expressed by the following formula:
[0079]
[0080] Where IS is the information entropy dispersion of the multi-objective optimization solution, reflecting the differences in the values of each objective function when the multi-objective optimization solution is adopted; i is the objective function value of virtual power plant i, that is, the proportion of the first objective function value in the total objective function value, reflecting its profit share. The calculation formula is shown in formula (4); p sys It is the objective function value of the power grid system, that is, the proportion of the second objective function value in the total objective function value, reflecting its profit share. The calculation formula is shown in formula (5); the calculation formula of k is shown in formula (6).
[0081]
[0082]
[0083] k=1 / (N VPP +1) (6)
[0084] It can be seen from equations (3)-(6) that when the revenue of each virtual power plant is equal to the revenue of the power grid system, the IS value reaches the minimum value of 0. When the difference between the revenue of each virtual power plant and the revenue of the power grid system is greater, the IS value is larger and closer to the maximum value of 1. It can be seen that by minimizing the information entropy dispersion IS of the multi-objective optimization solution, the optimization benefits can be evenly distributed between each virtual power plant and the power grid system.
[0085] Step b3, adopting the multi-objective optimal solution as the dispatching method when maximizing the interests of multiple subjects. Specifically, after determining the multi-objective optimal solution, the specific dispatching in the county energy Internet can be carried out based on the parameters such as power when the virtual power plant participates in the dispatching in the multi-objective optimal solution.
[0086] As a specific application example of the present invention, the distributed collaborative scheduling method of multiple virtual power plants in the county energy Internet is implemented by the following process:
[0087] Step 1: The full-process management framework of the collaborative interaction of the county energy Internet virtual power plant twins and the distributed collaborative interactive communication sharing mechanism based on DDS.
[0088] According to the hierarchical architecture of the county energy Internet and its collaborative interaction needs, a discovery, authentication, and sharing full-process management framework is proposed to adapt to the three-level collaborative interaction of ① equipment-level twins and power plant-level twins, ② power plant-level twins and upper-level twins, and ③ power plant-level twins and county-level twins, as well as the distributed collaborative interaction within the layer. The discovery, authentication, and sharing full-process management framework of each layer is shown in the attached figure. Figure 4 As shown. DDS is data-centric and provides a rich set of service quality strategies to ensure real-time, efficient and flexible data distribution, which can meet the needs of distributed real-time communication scenarios between twins. Therefore, in the hierarchical collaborative interaction of the county energy Internet, a distributed collaborative interactive communication sharing mechanism based on DDS is adopted between each device-level and virtual power plant-level twin. This step specifically includes the following process:
[0089] 1. Establish a device-level twin model for the source-load-storage equipment, establish a power plant-level twin model for the virtual power plant, and establish a twin model of the upper-level virtual power plant for the upper-level virtual power plant, and submit them to the upper-level virtual power plant or the county control center for optimization and control.
[0090] 2. A domain communication plane is jointly established for twins belonging to the same level. According to the DDS mechanism, only twins in the same domain can communicate and share, thus solving the authentication problem between twins and avoiding the intrusion of twins outside the domain. Each twin in the same domain, that is, domain participant, can publish or subscribe to data as a publisher or subscriber, so as to perform efficient subject discovery and data sharing in the same domain. Data interaction between multiple twins in the same domain can achieve efficient subject discovery and data sharing.
[0091] 3. Establish a collaborative and interactive discovery, authentication, and sharing management mechanism for the entire process between device-level twins, power plant-level twins, and upper-level twins; and establish a collaborative and interactive discovery, authentication, and sharing management mechanism for the entire process between county twins and device-level twins, county twins and power plant-level twins, and county twins and upper-level twins.
[0092] Among them, in the distributed collaborative interaction within the layer, each twin at this level can use the DDS mechanism to scan and detect other twins in real time. When the twin scans and detects other twins, the twin tries to communicate with them and determines whether it is necessary to interact and share data with the twin. For example, when the virtual power plant twin receives the regulation demand from the county twin, the virtual power plant twin communicates with other device-level twins in the layer, and the two twins determine the data to be interacted and shared, and the two twins use DDS technology to interact and share data.
[0093] As attached Figure 5 As shown in the figure, each twin in the same domain first acts as a publisher to publish real-time active power, adjustable limit, regulation rate, scheduling power, scheduling cost and other data to the DDS global data space, and other twins in the same domain act as subscribers to read the data they need from the DDS global data space.
[0094] Step 2: Multi-agent and multi-objective distributed collaborative scheduling model under the DDS mechanism.
[0095] In order to meet the economic benefit expectations of different entities and realize fair distribution of optimization benefits among different entities, the present invention establishes a multi-agent distributed collaborative scheduling model based on the DDS distributed collaborative interactive communication sharing mechanism. This step specifically includes the following process:
[0096] 1. Establish a multi-objective optimization (MOO) objective function, which includes the first objective function of the county control center and the second objective function of the virtual power plant. Among them, the goal of the county control center is to minimize the total dispatch cost of the entire system relative to when the virtual power plant does not participate in the dispatch optimization by incorporating the virtual power plant into the system dispatch. Then the first objective function can be expressed by the above formula (1). The goal of the virtual power plant is to minimize the power generation cost relative to the independent operation by participating in the system dispatch optimization. Then the second objective function can be expressed by the above formula (2).
[0097] 2. Establish constraint conditions. The objective functions shown in formulas (1) and (2) should satisfy the physical operation constraints such as the adjustable limits and rates of conventional generators and virtual power plants; at the same time, they should also satisfy the system power balance constraints.
[0098] 3. MOO optimization solution. For the above-mentioned first objective function and second objective function and the corresponding constraints, the non-dominated sorting genetic algorithm (NSGAII) with elite strategy can be used for solution. After the genetic algorithm solves, according to the aforementioned DDS mechanism, the county power grid and each virtual power plant interact with real-time active power, adjustable limit, regulation rate, dispatching power, dispatching cost and other data in the same domain. The county control center selects the solution that makes the yield of each virtual power plant and the power grid system as balanced as possible according to the interactive data of each virtual power plant as the multi-objective optimal solution, thereby reflecting the principle of fair sharing of benefits according to costs. The selection of the multi-objective optimal solution is achieved by calculating the information entropy of the solution, that is, through the above formulas (3) to (6). It can be seen from formulas (3) to (6) that when the benefits of each virtual power plant are equal to the benefits of the power grid system, the IS value reaches the minimum value of 0, and when the difference between the benefits of each virtual power plant and the benefits of the power grid system is greater, the IS value is larger and closer to the maximum value of 1. It can be seen that by minimizing the information entropy discreteness IS of the multi-objective optimization solution, the optimization benefits can be evenly distributed among the virtual power plants and the power grid system.
[0099] In this embodiment, a county-level energy internet multi-virtual power plant distributed collaborative scheduling device is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and will not be repeated hereafter. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.
[0100] This embodiment provides a distributed collaborative dispatching device for multiple virtual power plants in a county energy internet, such as Figure 6 As shown, including:
[0101] The twin construction module 601 is used to construct twins for the equipment, virtual power plants, upper-level virtual power plants, and county control centers in the county energy internet;
[0102] The scheduling module 602 is used to solve the pre-built multi-objective and multi-agent objective function based on the data obtained by the data distribution service between the twins, and obtain the scheduling method when the multi-agent benefits are maximized.
[0103] 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.
[0104] In an optional embodiment, the twins include equipment-level twins, power plant-level twins, upper-level twins and county twins, and the device also includes: a hierarchical division module, used to divide the equipment-level twins, power plant-level twins, upper-level twins and county twins into multiple levels; a communication plane establishment module, used to establish a communication plane for twins belonging to the same level, and the communication plane is used for communication between twins at the same level.
[0105] In an optional embodiment, the scheduling module includes: a data sharing module, which is used to use data distribution services to interact and share data between twins based on the communication plane; a function construction module, which is used to construct the first objective function of the county control center and the second objective function of the virtual power plant, and determine the constraints of the first objective function and the constraints of the second objective function; a solution module, which is used to solve the first objective function and the second objective function based on the interactive and shared data and constraints, and obtain the scheduling method when the interests of multiple subjects are maximized.
[0106] In an optional embodiment, the solution module includes: a first solution module, which is used to solve the first objective function and the second objective function based on constraints and adopt a non-dominated sorting genetic algorithm with an elite strategy to obtain a solution result; a second solution module, which is used to calculate the information entropy of each solution in the solution result based on interactive and shared data to obtain a multi-objective optimal solution; a scheduling submodule, which is used to adopt the multi-objective optimal solution as a scheduling method when maximizing the interests of multiple subjects.
[0107] In an optional embodiment, the second solution module is specifically used to: determine the information entropy discreteness of the multi-objective optimization solution based on the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; minimize the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution.
[0108] In an optional embodiment, the function construction module is specifically used to: construct a first objective function by minimizing the total dispatching cost when the virtual power plant participates in scheduling based on the power of the generator sets when the virtual power plant participates in the operation of the power grid and when the virtual power plant does not participate in the operation of the power grid; construct a second objective function by minimizing the power generation cost when the virtual power plant participates in scheduling.
[0109] In an optional embodiment, the interactive and shared data include real-time active power, adjustable limits, dispatch power and dispatch cost; the constraints include satisfying the adjustable limits and rates of the generator sets and virtual power plants and satisfying the system power balance constraints.
[0110] The embodiment of the present invention also provides a computer device having the above Figure 6 The county energy Internet multi-virtual power plant distributed collaborative dispatching device shown.
[0111] See also Figure 7 , Figure 7 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Figure 7 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, 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 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. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 7 A processor 10 is taken as an example.
[0112] 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 a dedicated 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.
[0113] The memory 20 stores instructions executable by at least one processor 10, so that at least one processor 10 executes the method shown in the above embodiment.
[0114] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created by the use of a computer device based on the presentation of a small program landing page, 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 arranged 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.
[0115] 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.
[0116] The computer device further comprises a communication interface 30 for the computer device to communicate with other devices or a communication network.
[0117] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, 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 hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. 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.
[0118] Although the embodiments of the present invention have been described in conjunction with 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, and such modifications and variations are all within the scope defined by the appended claims.
Claims
1. A distributed collaborative scheduling method for multiple virtual power plants in county energy internet, characterized in that: The method comprises: Build twins for the equipment, virtual power plants, upper-level virtual power plants, and county control centers in the county energy internet; Based on the data obtained by the data distribution service between twins, the pre-built multi-objective and multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized; The twins include device-level twins, power plant-level twins, upper-level twins and county-level twins. After twins are constructed for the devices, virtual power plants, upper-level virtual power plants and county-level control centers in the county-level energy internet, the method further includes: The equipment-level twins, power plant-level twins, upper-level twins, and county-level twins are divided into multiple levels; A communication plane is established for twins belonging to the same level, where the communication plane is used for communication between twins at the same level; Based on the data obtained by the data distribution service between twins, the pre-built multi-objective and multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized, including: Based on the communication plane, a data distribution service is used to interact and share data between twins. The interactive and shared data include real-time active power, adjustable limit, dispatch power and dispatch cost. Construct the first objective function of the county control center and the second objective function of the virtual power plant, and determine the constraints of the first objective function and the constraints of the second objective function; Based on the interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain the scheduling method when the interests of multiple agents are maximized; Based on the interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain the scheduling method when the multi-agent interests are maximized, including: Based on the constraints, a non-dominated sorting genetic algorithm with an elite strategy is used to solve the first objective function and the second objective function, and the solution is obtained; Based on interactive and shared data, the information entropy of each solution in the solution result is calculated to obtain the multi-objective optimal solution; Adopting the multi-objective optimal solution as a scheduling method for maximizing the interests of multiple subjects; Calculate the information entropy of each solution in the solution result to obtain the multi-objective optimal solution, including: Determine the information entropy discreteness of the multi-objective optimization solution according to the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; Minimize the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution; Construct the first objective function of the county control center and the second objective function of the virtual power plant, including: According to the power of the generator set when the virtual power plant participates in the grid operation and when the virtual power plant does not participate in the grid operation, the first objective function is constructed by minimizing the total dispatch cost when the virtual power plant participates in the dispatch. The first objective function is expressed as: In the formula, λ F is the penalty cost coefficient for the infeasibility of the virtual power plant interactive power curve; Is the virtual power plant i responding to the interactive power P i The decision variable P j (t) is the power of conventional generator set j when the virtual power plant does not participate in grid interaction; P' j (t) is the power of conventional generator set j when the virtual power plant participates in grid interaction operation; λ i (t) is the electricity price of the virtual power plant; λ j (t) is the unit power generation cost of conventional generator set j; N TPP is the number of conventional generating units; N VPP is the number of virtual power plants, T is the period of system dispatch optimization; The second objective function is constructed based on minimizing the power generation cost when the virtual power plant participates in the dispatch. The second objective function is expressed as: In the formula, is the virtual power plant i with interactive power P i The scheduling cost at time P i0 is the exchange power curve of virtual power plant i operating as a non-dispatchable load, P i is the variable that needs to be solved here.
2. The distributed collaborative scheduling method for multiple virtual power plants in county energy internet according to claim 1 is characterized by: The constraints include satisfying the adjustable limits and rates of the generator sets and virtual power plants and satisfying the system power balance constraints.
3. A distributed collaborative dispatching device for multiple virtual power plants in a county energy internet, characterized in that: The device comprises: The twin construction module is used to construct twins for the equipment, virtual power plants, upper-level virtual power plants, and county control centers in the county energy internet; The scheduling module is used to solve the pre-built multi-objective and multi-agent objective function based on the data obtained by the data distribution service between twins, and obtain the scheduling method when the multi-agent benefits are maximized; The twins include equipment-level twins, power plant-level twins, upper-level twins and county-level twins, and the device also includes: The hierarchical division module is used to divide the equipment-level twins, power plant-level twins, upper-level twins and county-level twins into multiple levels; A communication plane establishment module, used to establish a communication plane for twins belonging to the same level, wherein the communication plane is used for communication between twins at the same level; Based on the data obtained by the data distribution service between twins, the pre-built multi-objective and multi-agent objective function is solved to obtain the scheduling method when the multi-agent benefits are maximized, including: Based on the communication plane, a data distribution service is used to interact and share data between twins. The interactive and shared data include real-time active power, adjustable limit, dispatch power and dispatch cost. Construct the first objective function of the county control center and the second objective function of the virtual power plant, and determine the constraints of the first objective function and the constraints of the second objective function; Based on the interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain the scheduling method when the interests of multiple agents are maximized; Based on the interactive and shared data and constraints, the first objective function and the second objective function are solved to obtain the scheduling method when the multi-agent interests are maximized, including: Based on the constraints, a non-dominated sorting genetic algorithm with an elite strategy is used to solve the first objective function and the second objective function, and the solution is obtained; Based on interactive and shared data, the information entropy of each solution in the solution result is calculated to obtain the multi-objective optimal solution; Adopting the multi-objective optimal solution as a scheduling method for maximizing the interests of multiple subjects; Calculate the information entropy of each solution in the solution result to obtain the multi-objective optimal solution, including: Determine the information entropy discreteness of the multi-objective optimization solution according to the ratio of the first objective function value to the total objective function value and the proportion of the second objective function value to the total objective function value, wherein the total objective function value is the sum of the first objective function value and the second objective function value; Minimize the information entropy discreteness of the multi-objective optimization solution to determine the multi-objective optimal solution; Construct the first objective function of the county control center and the second objective function of the virtual power plant, including: According to the power of the generator set when the virtual power plant participates in the grid operation and when the virtual power plant does not participate in the grid operation, the first objective function is constructed by minimizing the total dispatch cost when the virtual power plant participates in the dispatch. The first objective function is expressed as: In the formula, λ F is the penalty cost coefficient for the infeasibility of the virtual power plant interactive power curve; Is the virtual power plant i responding to the interactive power P i The decision variable P j (t) is the power of conventional generator set j when the virtual power plant does not participate in grid interaction; P' j (t) is the power of conventional generator set j when the virtual power plant participates in grid interaction operation; λ i (t) is the electricity price of the virtual power plant; λ j (t) is the unit power generation cost of conventional generator set j; N TPP is the number of conventional generating units; N VPP is the number of virtual power plants, T is the period of system dispatch optimization; The second objective function is constructed based on minimizing the power generation cost when the virtual power plant participates in the dispatch. The second objective function is expressed as: In the formula, is the virtual power plant i with interactive power P i The scheduling cost at time P i0 is the exchange power curve of virtual power plant i operating as a non-dispatchable load, P i is the variable that needs to be solved here.
4. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the distributed collaborative scheduling method of multiple virtual power plants in the county energy Internet as described in claim 1 or 2 by executing the computer instructions.
5. 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 county energy Internet multi-virtual power plant distributed collaborative scheduling method as described in claim 1 or 2.
Citation Information
Patent Citations
Multi-energy coupling optimization scheduling method and system based on digital twinning
CN115423161A
Power grid digital twin system construction method and device, electronic equipment and storage medium
CN115954933A
