2021
DOI: 10.1016/j.ijepes.2020.106683
|View full text |Cite
|
Sign up to set email alerts
|

Bi-level mixed-integer linear programming algorithm for evaluating the impact of load-redistribution attacks on Volt-VAR optimization in high- and medium-voltage distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…To simplify, we take the ES trading model with only ES station as an example and reconfigure the MP model (46) [31].…”
Section: • the Master Problem (Denoted As Mp)mentioning
confidence: 99%
“…To simplify, we take the ES trading model with only ES station as an example and reconfigure the MP model (46) [31].…”
Section: • the Master Problem (Denoted As Mp)mentioning
confidence: 99%
“…Evaluations on a modified IEEE 33-bus distribution test system with one On-LTC, nine Capacitor Banks (CBs), four PV systems and 32 smart meters highlight that there is a 1% increase in the voltage magnitude along with a 16% increase in the On-LTC tap position which results in abnormal feeder voltage profile in both the physical and cyber layers. Shen et al Shen et al (2021) extended the previous work by modeling a load redistribution attack on VVC as a single-leader-multi-follower bi-level mixed-integer linear programming (BMILP) model to maximize voltage profiles and increase load curtailment costs. Real-world experiments on a High-and-medium-voltage distribution system (HMVDS) in China demonstrate fluctuations on the reactive power support and voltage profiles by up to 83%.…”
Section: Volt-var Controlmentioning
confidence: 99%
“…3) A tailored algorithm that integrates the traditional Karush-Kuhn-Tucker-based (KKT-based) reformulation approach [23] and a relaxation-based bi-level reformulation and decomposition (RBRD) algorithm [24] is developed to solve the proposed bi-level bidding model. Based on the traditional KKT-based reformulation approach, the proposed bi-level model is transformed into a bi-level mixed-integer linear programming (BMILP) model with only mixed-integer linear programming (MILP) lower-level problems, which can be globally solved using the RBRD algorithm.…”
Section: Contribution and Organizationmentioning
confidence: 99%
“…To tackle this challenge, the original BMINLP model is transformed into a special tractable form based on the linearization and approximation techniques applied in Section 2.4. To solve this special BMINLP model with both linear programming (LP) lower-level problems and MILP lower-level problems, a tailored algorithm integrating the traditional KKT-based reformulation approach [23] and the RBRD algorithm [24] is proposed in this section. Moreover, the nonlinear term (i.e., F1) in the objective function in the upper-level problem can be linearized through the strong duality theorem [23], and hence, this special BMINLP model is converted into the BMILP model.…”
Section: Linearization Of the Line Flow Capacity Constraints In Dsmentioning
confidence: 99%
See 1 more Smart Citation