Benders Decomposition Algorithm for Reference Network

被引:0
|
作者
Zhang, Jie [1 ]
Cao, Xiangyang [1 ]
Tian, Xin [1 ]
Wang, Zhen [2 ]
Wang, Mingqiang [3 ]
Han, Xueshan [3 ]
Li, Shan [3 ]
机构
[1] Elect Power Co Jinan, Inst State Grid Shandong, Econ & Technol Res, Jinan, Shandong, Peoples R China
[2] Qingdao Power Supply Co, Qingdao, Shandong, Peoples R China
[3] Shandong Univ, Sch Elect Engn, Jinan, Shandong, Peoples R China
关键词
Benders Decomposition; Contingency Filtering Optimal Algorithm; Reference Network;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A reference network is topologically identical to the existing network in which the generators and loads are not changed while the transmission line capacity will be optimized. By applying a reference network, the optimal transmission capacities of each line could be identified, as it takes annual operational and transmission costs into consideration. A reference network provides a standard to evaluate the real network objectively. The congestion costs can be quantified and the optimal investment proposal can also be obtained based on load forecasting. Furthermore, the weakness of the system can be detected by comparing those in the reference and the actual network. However, for a large-scale power system, it is extremely complicated to build the reference network, as the optimal capacities for each line must be determined considering various contingency events. In this paper a simplified Benders decomposition algorithm is presented and applied to solve this model. Simulation results show that this technique can reduce computation time and improve convergence performance.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] DESIGNING A LOGISTIC NETWORK FOR HOSPITAL WASTE MANAGEMENT: A BENDERS DECOMPOSITION ALGORITHM
    Nikzamir, Mohammad
    Baradaran, Vahid
    Panahi, Yunes
    ENVIRONMENTAL ENGINEERING AND MANAGEMENT JOURNAL, 2020, 19 (11): : 1937 - 1956
  • [2] A Combinatorial Benders Decomposition Algorithm for the Directed Multiflow Network Diversion Problem
    Lee, Chungmok
    Cho, Donghyun
    Park, Sungsoo
    MILITARY OPERATIONS RESEARCH, 2019, 24 (01) : 23 - 39
  • [3] The Benders decomposition algorithm: A literature review
    Rahmaniani, Ragheb
    Crainic, Teodor Gabriel
    Gendreau, Michel
    Rei, Walter
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (03) : 801 - 817
  • [4] Benders Decomposition for Capacitated Network Design
    Mattia, Sara
    COMBINATORIAL OPTIMIZATION, ISCO 2016, 2016, 9849 : 71 - 80
  • [5] A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
    Bagloee, Saeed Asadi
    Sarvi, Majid
    Patriksson, Michael
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2017, 32 (04) : 319 - 343
  • [6] A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
    Seo, Kiho
    Joung, Seulgi
    Lee, Chungmok
    Park, Sungsoo
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (05) : 2804 - 2827
  • [7] Improving benders decomposition using a genetic algorithm
    Popjari, C. A.
    Beasley, J. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (01) : 89 - 97
  • [8] A Modified Benders Decomposition Algorithm for a Last-mile Network with Flexible Delivery Options
    Zahedi-Anaraki, A.
    Tavakkoli-Moghaddam, R.
    Sadeghian, R.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2022, 35 (08): : 1547 - 1557
  • [9] A Modified Benders Decomposition Algorithm for a Last-Mile Network with Flexible Delivery Options
    Zahedi-Anaraki A.
    Tavakkoli-Moghaddam R.
    Sadeghian R.
    International Journal of Engineering, Transactions B: Applications, 2022, 35 (08):
  • [10] Benders decomposition for network design covering problems
    Bucarey, Victor
    Fortz, Bernard
    Gonzalez-Blanco, Natividad
    Labbe, Martine
    Mesa, Juan A.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 137