A Physarum-inspired optimization algorithm for load-shedding problem*

被引:22
|
作者
Gao, Chao [1 ,2 ,3 ]
Chen, Shi [1 ]
Li, Xianghua [1 ]
Huang, Jiajin [4 ]
Zhang, Zili [1 ,5 ]
机构
[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Potsdam Inst Climate Impact Res PIK, D-11473 Potsdam, Germany
[3] Humboldt Univ, Inst Phys, D-12489 Berlin, Germany
[4] Beijing Univ Technol, Int WIC Inst, Beijing 100124, Peoples R China
[5] Deakin Univ, Sch Informat Technol, Geelong, Vic 3220, Australia
基金
中国国家自然科学基金;
关键词
Load-shedding problem; Physarum; Ant colony algorithm; 0/1; KP; ANT COLONY OPTIMIZATION; GAME-THEORETIC ANALYSIS; 0/1; KNAPSACK-PROBLEM; BANKRUPTCY PROBLEM; SEARCH; SYSTEM; NETWORK; FAIRNESS;
D O I
10.1016/j.asoc.2017.07.043
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Load-shedding is an intentional reduction approach which can maintain the stability of a microgrid system effectively. Recent studies have shown that a load-shedding problem can be solved by formulating it as a 0/1 knapsack problem (KP). Although approximate solutions of 0/1 KP can be given by ant colony optimization (ACO) algorithms, adopting them requests a delicate consideration of the robustness, convergence rate and premature convergence. This paper proposes a new kind of Physarum-based hybrid optimization algorithm, denoted as PM-ACO, based on the critical paths reserved feature of Physaruminspired mathematical (PM) model. Through adding additional pheromone to those important items selected by the PM model, PM-ACO improves the selection probability of important items and emerge a positive feedback process to generate optimal solutions. Comparing with other 0/1 KP solving algorithms, our experimental results demonstrate that PM-ACO algorithms have a stronger robustness and a higher convergence rate. Moreover, PM-ACO provides adaptable solutions for the load-shedding problem in a microgrid system. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:239 / 255
页数:17
相关论文
共 50 条
  • [41] An Algorithm for Measuring Relative Anger at Eskom During Load-Shedding using Twitter
    Butgereit, Laurie
    PROCEEDINGS OF THE 2015 12TH IEEE AFRICON INTERNATIONAL CONFERENCE - GREEN INNOVATION FOR AFRICAN RENAISSANCE (AFRICON), 2015,
  • [42] Coupled Physarum-Inspired Memristor Oscillators for Neuron-like Operations
    Ntinas, Vasileios
    Vourkas, Ioannis
    Sirakoulis, Georgios Ch.
    Adamatzky, Andrew
    Rubio, Antonio
    2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [43] Optimization of Emergency Load-Shedding Based on Surrogate-Assisted Differential Evolution
    Gai, Chenhao
    Chang, Yanzhao
    Xu, Taoyang
    Li, Changgang
    2021 IEEE IAS INDUSTRIAL AND COMMERCIAL POWER SYSTEM ASIA (IEEE I&CPS ASIA 2021), 2021, : 868 - 873
  • [44] CONSIDERATIONS WHEN PLANNING A LOAD-SHEDDING PROGRAM
    HARRISON, P
    BROWN BOVERI REVIEW, 1980, 67 (10): : 593 - 598
  • [45] A Fast Load-shedding Algorithm for Power System based on Artificial Neural Network
    Wang, Youming
    Wang, Yong
    Ding, Ying
    Zhou, Yingjian
    Zhang, Zhewen
    17TH IEEE INTERNATIONAL CONFERENCE ON IC DESIGN AND TECHNOLOGY (ICICDT 2019), 2019,
  • [46] The Model of Load-shedding Determined in Power Market
    Cao Yong
    Tan Lunnong
    MECHANICAL ENGINEERING, MATERIALS SCIENCE AND CIVIL ENGINEERING II, 2014, 470 : 758 - 762
  • [47] Optimal load-shedding using local information
    Hosei Univ
    Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi), 1996, 116 (02): : 32 - 51
  • [48] Distributed Load-Shedding in the Balancing of Electricity Markets
    Crampes, Claude
    Leautier, Thomas-Olivier
    2012 9TH INTERNATIONAL CONFERENCE ON THE EUROPEAN ENERGY MARKET (EEM), 2012,
  • [49] Optimal load-shedding using local information
    Fujita, G
    Shirai, G
    ELECTRICAL ENGINEERING IN JAPAN, 1996, 116 (02) : 32 - 51
  • [50] Fairness of Power System Load-Shedding Plans
    Heylen, Evelyn
    Ovaere, Marten
    Van Hertem, Dirk
    Deconinck, Geert
    2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2018, : 1404 - 1409