The power system security becomes complex for $N-x$ contigency situations, especially if triggered by cyber or physical attacks. This paper proposes a multi-objective combinatorial optimization problem of binary linear knapsack to model peak load loss in power network with least number of line trippings. The optimization problem represents the power network as a edge-weighted digraph and minimizes the number of link rejections to cause maximum loss of path gain with congestion and path flow constraints. The model is defined for complete information exploits with no restrictions on link selection and limited information model with boundary edge restrictions. The multi-objective optimization is solved using E-constraint and weighted sum methods. For both methods, approximate Pareto fronts obtained using multi-start techniques are used. The proposition is tested for the theoretical interconnected graph models and attack area in a IEEE-39 bus test system.
Multi-Objective Combinatorial Optimization of Simultaneous Multi-Trip Attacks in Power System
2024-07-31
520609 byte
Conference paper
Electronic Resource
English
Electric vehicle range prediction for constant speed trip using multi-objective optimization
Online Contents | 2015
|Hybrid Approach for Multi-Objective Combinatorial Optimization in Search of Greener Aircraft
British Library Conference Proceedings | 2011
|