Iterative clearing method and system for electric power spot market

Abstract

The invention discloses an electric power spot market iterative clearing method and system, and the method comprises the steps: firstly constructing a first spot market clearing model which does not consider network constraints, and solving to obtain the network-constraint-free power of a generator set and an electrical load; secondly, direct current power flow of each stable section is calculated in combination with complete sensitivity data, and an initial power flow plan is obtained; filtering the small-order-of-magnitude sensitivity data, adding load flow constraint on the basis of the first spot market clearing model, and constructing a second spot market clearing model considering network constraint; and carrying out clearing calculation on the second spot market clearing model, generating network constraint power of the generator set and the electrical load, and ending clearing. According to the method, the accurate initial plan and initial power flow are rapidly provided for the SCUC, the complexity of network constraint is reduced, the iteration times of optimization and security check are reduced, and the iterative calculation efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the field of power systems and automation technologies thereof, and in particular to an iterative clearing method and system for a power spot market. Background Art

[0002] The effective operation of the electricity spot market requires the support of efficient clearing methods. The core of the market clearing process is the safety constrained unit commitment (SCUC) program. SCUC is a mixed integer optimization problem with a large number of integer variables and equality and inequality constraints. It is difficult to solve SCUC by taking into account all grid equipment components and directly considering AC power flow constraints. Usually, a DC power flow constraint model is established based on sensitivity, and the solution efficiency is guaranteed through iteration between SCUC calculation and safety verification.

[0003] With the advancement of the construction of bilateral spot markets, more and more load-side entities are participating in the spot market, and the data of load-side entities is much larger than that of power generation entities. If complete sensitivity data is used in SCUC calculations, considering a large number of load-side market entities will make the network constraints denser and the clearing calculations more difficult; at the same time, affected by small-order sensitivity data, in order to eliminate section blockage, it is easy to cause large changes in the start and stop of small-order sensitivity units associated with sections. If the sensitivity data is screened in the SCUC calculation, and the sensitivity after filtering the small-order data is used for calculation, it will cause excessive deviations in the flow calculation, affecting the validity of the results.

[0004] Therefore, in view of the problem of clearing a large number of load entities participating in the spot market under a two-way competition environment, how to improve the calculation efficiency and rationality of the results of SCUC has become a technical problem that technical personnel in this field urgently need to solve. Summary of the invention

[0005] Purpose of the invention: The purpose of the present invention is to provide an iterative clearing method and system that can adapt to the participation of a large number of load entities in the spot market, by improving the network constraint processing strategy within the optimization calculation, and optimizing the iterative process between the calculation and the safety check, so as to improve the iterative efficiency of the spot market clearing and the calculation accuracy of the DC power flow results.

[0006] Technical solution: The iterative clearing method of the electricity spot market described in the present invention comprises the following steps:

[0007] Construct the first spot market clearing model without considering network constraints, and solve the power of generators and power loads without network constraints;

[0008] According to the non-network-constrained power of the generator set and the power load, and the complete sensitivity data, the DC power flow of each stable section is calculated to obtain an initial power flow plan;

[0009] Filter the small-order sensitivity data, add power flow constraints on the basis of the first spot market clearing model, and construct a second spot market clearing model considering network constraints;

[0010] The clearing calculation is performed on the second spot market clearing model to generate the network constraint power of the power generation unit and the power load, and the clearing is completed.

[0011] Furthermore, the objective function of the first spot market clearing model is:

[0012]

[0013] The constraints include:

[0014]

[0015] P i,min u i,t ≤P i,t,0 ≤P i,max u i,t ;

[0016]

[0017] -Δ i ≤P i,t,0 -P i,t-1,0 ≤Δ i ;

[0018] Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P d,t,0 is the power load without network constraints of the market load d in time period t; P i,t,0 is the active output of generator set i without network constraints in period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DTi are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period.

[0019] Furthermore, the objective function of the second spot market clearing model is:

[0020] The objective function is expressed as:

[0021]

[0022] Constraints:

[0023]

[0024] P i,min u i,t ≤P i,t ≤P i,max u i,t ;

[0025]

[0026] -Δ i ≤P i,t -P i,t-1 ≤Δ i ;

[0027]

[0028] Among them, P i,t is the network-constrained active output of generator set i in period t; P d,t is the network-constrained power consumption of the market load d in time period t; are the lower and upper limits of the power flow transmission of section s respectively; G′ s-i G' is the filtered sensitivity of the node where unit i is located to section s; d-i is the filtered sensitivity of the node where the market load d is located to section s; S is the set of stable sections considered in the clearing calculation.

[0029] Furthermore, the calculating of the DC power flow of each stable section to obtain the initial power flow plan includes:

[0030]

[0031] Among them, F s,t,0 is the initial power flow of stable section s in time period t; K is the total number of bus loads in the power system; D k,t G is the non-market load forecast power of bus load k in period t; s-i G is the sensitivity of the node where unit i is located to section s; s-jG is the sensitivity of the node where the tie line j is located to the section s; d-k is the sensitivity of the node where the market load d is located to the section s; G s-k is the sensitivity of the node where the bus load k is located to the section s

[0032] Furthermore, performing clearing calculation on the second spot market clearing model to generate network constraint power of the generator set and the power load includes:

[0033] Optimize the calculation of the second spot market clearing model to obtain the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load;

[0034] Conduct safety verification based on the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load;

[0035] If there is no new transmission section power flow exceeding the limit in the verification result, the calculation result of the electricity spot market clearing is obtained according to the power of the network-constrained generator set and the power consumption of the market-based load;

[0036] Otherwise, the newly added transmission sections will be added to the stable section set to regain the network-constrained active power of the generator sets and market-oriented loads.

[0037] The power spot market iterative clearing system of the present invention comprises:

[0038] The non-network-constrained clearing module is used to construct the first spot market clearing model without considering network constraints, and solve the non-network-constrained power of the generator set and the power load;

[0039] A DC power flow calculation module is used to calculate the DC power flow of each stable section according to the non-network-constrained power of the generator set and the power load, and the complete sensitivity data, and obtain an initial power flow plan;

[0040] The network constraint clearing module is used to filter the small-order sensitivity data, add power flow constraints on the basis of the first spot market clearing model, and construct a second spot market clearing model considering network constraints; perform clearing calculations on the second spot market clearing model to generate network constraint power for generator sets and power loads, and then the clearing is completed.

[0041] Furthermore, the objective function of the first spot market clearing model is:

[0042]

[0043] The constraints include:

[0044]

[0045] Pi,min u i,t ≤P i,t,0 ≤P i,max u i,t ;

[0046]

[0047]

[0048] -Δ i ≤P i,t,0 -P i,t-1,0 ≤Δ i ;

[0049] Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P d,t,0 is the power load without network constraints of the market load d in time period t; P i,t,0 is the active output of generator set i without network constraints in period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period.

[0050] Furthermore, the objective function of the second spot market clearing model is:

[0051] The objective function is expressed as:

[0052]

[0053] Constraints:

[0054]

[0055] Pi,min u i,t ≤P i,t ≤P i,max u i,t ;

[0056]

[0057] -Δ i ≤P i,t -P i,t-1 ≤Δ i ;

[0058]

[0059] Among them, P i,t is the network-constrained active output of generator set i in period t; P d,t is the network-constrained power consumption of the market load d in time period t; are the lower and upper limits of the power flow transmission of section s respectively; G′ s-i G' is the filtered sensitivity of the node where unit i is located to section s; d-i is the filtered sensitivity of the node where the market load d is located to section s; S is the set of stable sections considered in the clearing calculation.

[0060] The electronic device described in the present invention includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the computer program is loaded into the processor, the iterative clearing method for the electricity spot market is implemented.

[0061] The computer-readable storage medium of the present invention stores a computer program, and when the computer program is executed by a processor, the iterative clearing method of the electricity spot market is implemented.

[0062] Beneficial effects: Compared with the prior art, the advantages of the present invention are: 1) by adding network-free constraint clearing and DC verification of full data sensitivity, an accurate initial plan and initial power flow are quickly provided for SCUC, and the DC power flow results obtained by SCUC optimization are relatively more accurate, and the number of out-of-limit sections is reduced; 2) on the basis of the initial power flow, the optimization clearing adopts an incremental power flow method based on filtering sensitivity, which reduces the complexity of network constraints, reduces the number of iterations of optimization and safety verification, and improves the iterative calculation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 It is a flow chart of the iterative clearing method of the electricity spot market of the present invention;

[0064] Figure 2 This is a diagram of the iterative clearing system architecture of the electricity spot market of the present invention. DETAILED DESCRIPTION

[0065] The technical solution of the present invention is further described below in conjunction with the accompanying drawings.

[0066] like Figure 1 As shown, the iterative clearing method for the electricity spot market includes the following steps.

[0067] Step 1: Construct a spot market clearing model without considering network constraints, and solve the power of generators and power loads without network constraints.

[0068] Furthermore, in one embodiment, a spot market clearing model without considering network constraints specifically includes:

[0069] The objective function is expressed as:

[0070]

[0071] Constraints:

[0072]

[0073] P i,min u i,t ≤P i,t,0 ≤P i,max u i,t ;

[0074]

[0075] -Δ i ≤P i,t,0 -P i,t-1,0 ≤Δ i ;

[0076] Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P d,t,0 is the power load without network constraints of the market load d in time period t; P i,t,0 is the active output of generator set i without network constraints in period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,minare the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period.

[0077] Step 2: Based on the power results without network constraints of the generator set and power load, as well as the complete sensitivity data, the DC power flow of each stable section is calculated to obtain the initial power flow plan.

[0078] Furthermore, in one embodiment, the DC power flow calculation of the stable section specifically includes:

[0079]

[0080] Among them, F s,t,0 is the initial power flow of stable section s in time period t; K is the total number of busbar loads in the system; D k,t G is the non-market load forecast power of bus load k in period t; s-i G is the sensitivity of the node where unit i is located to section s; s-j G is the sensitivity of the node where the tie line j is located to the section s; d-k is the sensitivity of the node where the market load d is located to the section s; G s-k is the sensitivity of the node where the bus load k is located to the section s.

[0081] Step 3: Adopt the power flow constraint incremental modeling method, filter the small-order sensitivity data at the same time, and build a spot market clearing model considering network constraints.

[0082] Furthermore, in one embodiment, a spot market clearing model considering network constraints is based on a spot market clearing model not considering network constraints, and adds power flow constraint modeling, specifically including:

[0083] The objective function is expressed as:

[0084]

[0085] Constraints:

[0086]

[0087] P i,min u i,t ≤P i,t ≤P i,max u i,t ;

[0088]

[0089] -Δ i ≤P i,t -P i,t-1 ≤Δ i ;

[0090]

[0091] Among them, P i,t is the network-constrained active output of generator set i in period t; P d,t is the network-constrained power consumption of the market load d in time period t; are the lower and upper limits of the power flow transmission of section s respectively; G s ' -i G' is the filtered sensitivity of the node where unit i is located to section s; d-i is the filtered sensitivity of the node where the market load d is located to section s; S is the set of stable sections considered in the clearing calculation.

[0092] Step 4: Perform clearing calculations on the spot market clearing model that takes network constraints into account to generate network constraint power results for generators and power loads, and clearing is completed.

[0093] Furthermore, in one embodiment, a spot market clearing model considering network constraints is used for clearing calculation, specifically including:

[0094] Optimize the spot market clearing model considering network constraints to obtain the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load;

[0095] Conduct safety verification based on the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load;

[0096] If there is no new transmission section power flow exceeding the limit in the verification result, the calculation result of the electricity spot market clearing is obtained according to the power of the network-constrained generator set and the power consumption of the market-based load;

[0097] Otherwise, the newly added transmission section will be added to the stable section set, and the network constrained active power results of the generator sets and market-oriented loads will be obtained again.

[0098] In this embodiment, the provincial power spot market day-ahead clearing is taken as an example. The clearing scale includes more than 2,000 computing nodes, more than 300 units, more than 1,000 large-scale load entities at the power sales company level, and more than 400 stable sections. The day-ahead calculation granularity is 15 minutes, with a total of 96 calculation periods.

[0099] Before the method of the present invention was adopted, a single optimization calculation took 15 minutes, usually 2-3 iterations were required, and the total clearing time was 40 minutes on average.

[0100] By adopting the method of the present invention, the clearing process adds unit combination without network constraints and DC power flow verification, performs safety verification iteration based on incremental power flow constraints, and carries out day-ahead clearing of the power spot market with the participation of a large number of load entities. A single optimization calculation takes 8 minutes, usually 1-2 iterations are required, and the total clearing time is an average of 15 minutes.

[0101] The method of the present invention solves the problem of optimizing the clearing of a large number of load entities participating in the electricity spot market, meets the market clearing security, efficiency and practicality, and ensures the effective operation of the spot market.

[0102] like Figure 2 As shown, the iterative clearing system for the electricity spot market of the present invention includes the following contents:

[0103] The non-network-constrained clearing module is used to construct the first spot market clearing model without considering network constraints, and solve the non-network-constrained power of the generator set and the power load;

[0104] A DC power flow calculation module is used to calculate the DC power flow of each stable section according to the non-network-constrained power of the generator set and the power load, and the complete sensitivity data, and obtain an initial power flow plan;

[0105] The network constraint clearing module is used to filter the small-order sensitivity data, add power flow constraints on the basis of the first spot market clearing model, and construct a second spot market clearing model considering network constraints; perform clearing calculations on the second spot market clearing model to generate network constraint power for generator sets and power loads, and then the clearing is completed.

[0106] The electronic device described in the present invention includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the computer program is loaded into the processor, the iterative clearing method for the electricity spot market is implemented.

[0107] The computer-readable storage medium of the present invention stores a computer program, and when the computer program is executed by a processor, the iterative clearing method of the electricity spot market is implemented.

[0108] The computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, flash memory, or any other medium that can be used to store the desired program code in the form of instructions or data structures and that can be accessed by a computer.

[0109] The processor is used to execute the computer program stored in the memory to implement each step of the method involved in the above embodiment.

Claims

1. An iterative clearing method for a power spot market, characterized in that: The steps include: Construct the first spot market clearing model without considering network constraints, and solve the power of generators and power loads without network constraints; According to the non-network-constrained power of the generator set and the power load, and the complete sensitivity data, the DC power flow of each stable section is calculated to obtain an initial power flow plan; Filter the small-order sensitivity data, add power flow constraints on the basis of the first spot market clearing model, and construct a second spot market clearing model considering network constraints; The clearing calculation is performed on the second spot market clearing model to generate the network constraint power of the power generation unit and the power load, and the clearing is completed.

2. The iterative clearing method for the electricity spot market according to claim 1, characterized in that: The objective function of the first spot market clearing model is: The constraints include: P i,min in i,t ≤P i,t,0 ≤P i,max in i,t ; -D i ≤P i,t,0 -P i,t-1,0 ≤Δ i ; Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P d,t,0 is the power load without network constraints of the market load d in time period t; P i,t,0 is the active output of generator set i without network constraints in period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period.

3. The iterative clearing method for the electricity spot market according to claim 1, characterized in that: The objective function of the second spot market clearing model is: The objective function is expressed as: Constraints: P i,min in i,t ≤P i,t ≤P i,max in i,t ; -D i ≤P i,t -P i,t-1 ≤Δ i ; Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P i,t is the network-constrained active output of generator set i in period t; P d,t is the network-constrained power consumption of the market load d in time period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period; P s min , P s max are the lower and upper limits of the power flow transmission of section s respectively; G s ' -i G' is the filtered sensitivity of the node where unit i is located to section s; d-i is the filtered sensitivity of the node where the market load d is located to section s; S is the set of stable sections considered in the clearing calculation.

4. The iterative clearing method for the electricity spot market according to claim 1, characterized in that: The calculation of the DC power flow of each stable section to obtain the initial power flow plan includes: Among them, F s,t,0 is the initial power flow of stable section s in time period t; K is the total number of busbar loads in the power system; D k,t G is the non-market load forecast power of bus load k in period t; s-i G is the sensitivity of the node where unit i is located to section s; s-j G is the sensitivity of the node where the tie line j is located to the section s; d-k is the sensitivity of the node where the market load d is located to the section s; G s-k is the sensitivity of the node where the bus load k is located to the section s.

5. The iterative clearing method for the electricity spot market according to claim 1, characterized in that: The performing of clearing calculation on the second spot market clearing model to generate network constraint power of the generator set and the power load comprises: Optimize the calculation of the second spot market clearing model to obtain the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load; Conduct safety verification based on the network-constrained active output of the generator set and the network-constrained power consumption of the market-based load; If there is no new transmission section power flow exceeding the limit in the verification result, the calculation result of the electricity spot market clearing is obtained according to the power of the network-constrained generator set and the power consumption of the market-based load; Otherwise, the newly added transmission sections will be added to the stable section set to regain the network-constrained active power of the generator sets and market-oriented loads.

6. An iterative clearing system for the electricity spot market, characterized in that: include: The non-network-constrained clearing module is used to construct the first spot market clearing model without considering network constraints, and solve the non-network-constrained power of the generator set and the power load; A DC power flow calculation module is used to calculate the DC power flow of each stable section according to the non-network-constrained power of the generator set and the power load, and the complete sensitivity data, and obtain an initial power flow plan; The network constraint clearing module is used to filter the small-order sensitivity data, add power flow constraints on the basis of the first spot market clearing model, and construct a second spot market clearing model considering network constraints; perform clearing calculations on the second spot market clearing model to generate network constraint power for generator sets and power loads, and then the clearing is completed.

7. The iterative clearing system for the electricity spot market according to claim 6, characterized in that: The objective function of the first spot market clearing model is: The constraints include: P i,min in i,t ≤P i,t,0 ≤P i,max in i,t ; -D i ≤P i,t,0 -P i,t-1,0 ≤Δ i ; Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P d,t,0 is the power load without network constraints of the market load d in time period t; P i,t,0 is the active output of generator set i without network constraints in period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period.

8. The iterative clearing system for the electricity spot market according to claim 6, characterized in that: The objective function of the second spot market clearing model is: The objective function is expressed as: Constraints: P i,min in i,t ≤P i,t ≤P i,max in i,t ; -D i ≤P i,t -P i,t-1 ≤Δ i ; Where T is the number of time periods included in the spot market clearing; D is the total number of market load entities; I is the total number of generators in the system; P i,t is the network-constrained active output of generator set i in period t; P d,t is the network-constrained power consumption of the market load d in time period t; C d is the electricity purchase cost of market load d; C i is the operating cost of unit i; S i is the startup cost of unit i; y i,t is the sign of whether the unit i has changed from shutdown to startup in time period t; J is the total number of interconnection lines in the system; T j,t is the planned power of tie line j in period t; L t is the non-market load demand of the system in period t; R t is the spinning reserve demand of the system in period t; P i,max and P i,min are the upper and lower limits of the output power of unit i; u i,t is the start and stop status of unit i in period t; z i,t It is the sign of whether the unit i has changed from startup to shutdown state in time period t; UT i and DT i are the minimum start-up time and minimum shutdown time of unit i respectively; Δ i is the ramp rate of unit i in each period; P s min , P s max are the lower and upper limits of the power flow transmission of section s respectively; G s ' -i G' is the filtered sensitivity of the node where unit i is located to section s; d-i is the filtered sensitivity of the node where the market load d is located to section s; S is the set of stable sections considered in the clearing calculation.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the computer program is loaded into a processor, the iterative clearing method for the electricity spot market is implemented according to any one of claims 1 to 5.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the iterative clearing method for the electricity spot market is implemented according to any one of claims 1 to 5.

Images