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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-Objective Combinatorial Optimization of Simultaneous Multi-Trip Attacks in Power System


    Contributors:


    Publication date :

    2024-07-31


    Size :

    520609 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multi-Objective Optimization of Cyber-Topology Attacks in Power Systems

    Malhotra, Akanksha / Yadav, Shailesh / Jain, Rishabh et al. | IEEE | 2024



    Electric vehicle range prediction for constant speed trip using multi-objective optimization

    Vaz, Warren / Nandi, Arup K.R. / Landers, Robert G. et al. | Tema Archive | 2015



    Hybrid Approach for Multi-Objective Combinatorial Optimization in Search of Greener Aircraft

    Roy, S. / Crossley, W. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2011