Multi-objective planning of electrical distribution system using Imperialist Competitive Algorithm

被引:0
|
作者
Zheng, Ying [1 ]
Yang, Yonggang [1 ]
Yu, Guangming [1 ]
机构
[1] State Grid Chongqing Tongliang Power Supply Co Lt, Chongqing, Peoples R China
关键词
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
The expansion planning of the distribution system is a hard multi-objective optimization problem to meet the load demand and ensure the reliability of power supply considering the technical, economic and environmental constraints. In this paper, Contingency-Load-Loss Index (CLLI) is used as the reliability index of the distribution system, together with investment and operating costs, active power loss and voltage deviation to build a more accurate and reasonable objective function, and to improve the multi-objective model of distribution network planning. The Imperialist Competitive Algorithm (ICA) is used in the multi-objective distribution planning to determine the optimal HV substation and MV feeder routing; ICA parameters were efficiently coded to improve the computing speed and convergence of the algorithm; Greedy algorithm was used to generate the Minimum Spanning Tree (MST) to ensure the radial configuration of the network. The example simulation and sensitivity analysis results verify the feasibility and effectiveness of the model and algorithm.
引用
收藏
页码:1823 / 1828
页数:6
相关论文
共 50 条
  • [21] MULTI-OBJECTIVE OPTIMIZATION OF DIRECT COUPLING PHOTOVOLTAIC-ELECTROLYZER SYSTEMS USING IMPERIALIST COMPETITIVE ALGORITHM
    Maroufmashat, Azadeh
    Sayedin, Farid
    Sattari, Sourena
    ASME INTERNATIONAL MECHANICAL ENGINEERING CONGRESS AND EXPOSITION, 2014, VOL 6A, 2015,
  • [22] The Imperialist Competitive Algorithm for Optimal Multi-Objective Location and Sizing of DSTATCOM in Distribution Systems Considering Loads Uncertainty
    Mostafa Sedighizadeh
    Amir Eisapour-Moarref
    INAE Letters, 2017, 2 (3): : 83 - 95
  • [23] Multi-objective planning of electrical distribution systems using dynamic programming
    Ganguly, S.
    Sahoo, N. C.
    Das, D.
    INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 46 : 65 - 78
  • [24] An imperialist competitive algorithm for multi-objective U-type assembly line design
    Nourmohammadi, A.
    Zandieh, M.
    Tavakkoli-Moghaddam, R.
    JOURNAL OF COMPUTATIONAL SCIENCE, 2013, 4 (05) : 393 - 400
  • [25] Multi-objective optimal power flow considering the cost, emission, voltage deviation and power losses using multi-objective modified imperialist competitive algorithm
    Ghasemi, Mojtaba
    Ghavidel, Sahand
    Ghanbarian, Mohammad Mehdi
    Gharibzadeh, Masihallah
    Vahed, Ali Azizi
    ENERGY, 2014, 78 : 276 - 289
  • [26] Multi-Objective Energy-Efficient Interval Scheduling in Hybrid Flow Shop Using Imperialist Competitive Algorithm
    Zhou, Rui
    Lei, Deming
    Zhou, Xinmin
    IEEE ACCESS, 2019, 7 : 85029 - 85041
  • [27] Multi-objective Flexible Job Shop Scheduling Problem with Energy Consumption Constraint Using Imperialist Competitive Algorithm
    Guo, Chengzhi
    Lei, Deming
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 659 - 669
  • [28] Multi-Objective Planning of Electrical Distribution Systems using Particle Swarm Optimization
    Ganguly, S.
    Sahoo, N. C.
    Das, D.
    2009 INTERNATIONAL CONFERENCE ON ELECTRIC POWER AND ENERGY CONVERSION SYSTEMS (EPECS 2009), 2009, : 159 - 164
  • [29] A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
    Tavakkoli-Moghaddam, R.
    Gholipour-Kanani, Y.
    Shahramifar, M.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2013, 26 (06): : 605 - 620
  • [30] Presenting a Model for Locating and Allocating Multi-Period Hubs and Comparing It With a Multi-Objective Imperialist Competitive Algorithm
    Chen, Tzu-Chia
    Muda, Iskandar
    Salman, Rabia
    Hussein, Baydaa Abed
    Uktamov, Khusniddin Fakhriddinovich
    Al-Muttar, Mohammed Yousif Oudah
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2023, 48 (03) : 331 - 344