4.2. Efficient prequalification algorithm implemented in field experiment
In this paper, we have adapted the algorithm from the reference [
9] for field experiment and summarized it with step-by-step formulas. The specific differences from the previous paper are summarized in the following subsections 4.3.
The DSO conducts a power flow calculation of the distribution system under its jurisdiction, based on the bidding information submitted by DERA and own load forecast of the DSO. From the results of the power flow calculation, the risky set is determined by determining which lines exceed the overvoltage/undervoltage risk threshold or the reverse/forward overflow risk threshold.
(3a)
(3b)
(3c)
(3d)
(3e)
(3f)
(3g)
(3h)
(4a)
( (4b)
(4c)
(4d)
The DSO considers the forecast error of DERs and loads, and the amount each DER responds to the frequency control signal from the TSO. For each of the four cases, overvoltage, undervoltage, reverse overflow, and forward overflow, the worst-case scenario is explored where each value of the risky nodes and lines within the considered uncertainty ranges causes the greatest violation of grid constraints.
(5a)
subject to
(3a-3c)
(5b)
(5c)
(5d)
(5e)
(6)
subject to
(3a-3c, 5b-5e)
(7)
subject to
(3a – 3f, 5b – 5e)
(8)
subject to
(3a-3f, 5b-5e)
The DSO verifies that all grid constraints are not violated in all worst-case scaenrios found in Step 2. If any violations occurred, go to Step 4; if none existed, go directly to Step 6.
(9a)
(9b)
(9c)
(9d)
(10a)
(10b)
(10c)
(10d)
The DSO calculates the sensitivity matrix regarding the impacts of DERs on each node and line for each worst-case scenario. Based on this information, the DSO allocates the violation information to each DERA.
(11a)
(11b)
(12a)
(12b)
(12c)
(12d)
(13a)
(13b)
(13c)
(13d)
(14a)
(14b)
(14c)
(14d)
(15a)
(15b)
(15c)
(15d)
This step calculates the maximum allowable bids for each DERA, taking into account the sensitivity of the DERs calculated in Step 4 and the amount of constraint violations distributed among the DERAs. The objective function of the DERA is set to minimize the difference between the initial bid and the revised bid based on the iterative process.
(16a)
(16b)
(16c)
(16d)
(16e)
(16f)
(16g)
(16h)
(17a)
Subject to
(16)
(17b)
(17c)
(17d)
(17e)
(17f)
(17g)
(17h)
(17i)
(17j)
(18a)
(18b)
(18c)
(18d)
(18e)
(18f)
(18g)
(18h)
(19a)
(19b)
(19c)
(19d)
(20a)
(20b)
(21a)
(21b)
(22a)
(22b)
(22c)
(22d)
(23a)
(23b)
(23c)
(23d)
(24)
subject to
(16, 17b-17h, 18, 19, 21-23)
This step checks that the bid value is not too different from the bid value of the previous iteration if it passed the criteria in Step 3. Since the power flow equation is nonlinear and we consider it by linearizing it in the form of sensitivity, there may be an error from the actual optimal value. To reduce this, this iteration step is performed.
(25a)
(25b)
(25c)
It is a step for the DSO to calculate and communicate to DERAs the upper and lower bounds of storage output that will not affect the reliability of the grid.
(26a)
Subject to
(26b)
(26c)
(26d)
(26e)
(26f)
(26g)
(26h)
(26i)
(26j)
(26k)
(27a)
(27b)
(27c)
(27d)
(28a)
(28b)
(28c)
(28d)
(29a)
(29b)
(29c)
(29d)
A flow chart representation of the entire algorithm from step1 to step6 is shown in
Figure 3.