Within-day rolling optimal scheduling problem for active distribution networks by multi-objective evolutionary algorithm based on decomposition integrating with thought of simulated annealing

被引:21
|
作者
Zhang, Jingrui [1 ,2 ]
Li, Zhuoyun [1 ]
Wang, Beibei [1 ]
机构
[1] Xiamen Univ, Dept Instrumental & Elect Engn, Xiamen 361005, Peoples R China
[2] Xiamen Univ, Shenzhen Res Inst, Shenzhen 518000, Peoples R China
关键词
Rolling optimal dispatch; Multi-objective optimal dispatch; Active distribution network; MOEA; D-TSA; Simulated annealing algorithm; PARTICLE SWARM OPTIMIZATION; DEMAND RESPONSE PROGRAM; OPTIMAL POWER-FLOW; DIFFERENTIAL EVOLUTION; OPTIMAL OPERATION; STRATEGY; PENETRATION; PERFORMANCE; DISPATCH; SYSTEMS;
D O I
10.1016/j.energy.2021.120027
中图分类号
O414.1 [热力学];
学科分类号
摘要
The prediction accuracy plays a very important role in the optimal dispatch problem of active distribution networks (ADN). Basing on the fact that the prediction accuracy will be greatly improved when approaching prediction domains and decreasing prediction time periods, rolling optimization provides an alternative approach to handle uncertainty of renewable sources in ADN. Considering the characteristics of power supplies and loads in ADN, a comprehensive model of rolling multi-objective optimal dispatch is established. Four objective functions of minimizing the ADN operation cost, minimizing adjustment of the active power outputs to the day-ahead plan, minimizing the total active power loss, and minimizing the total voltage deviation of the system are considered simultaneously. Then, the thought of simulated annealing is integrated into the multi-objective evolutionary algorithm based on decomposition (MOEA/D) to change the process of generating new solutions and the neighborhood updating process. Therefore, the proposed MOEA/D with the thought of simulated annealing (MOEA/DTSA) is adopted to solve this rolling multi-objective optimal dispatch problem. In the proposed approach, a dynamic probability value is employed to select which neighbor subproblem should be updated using the new generated solution in order to balance global and local searching ability of the algorithm. Finally, the performance of the proposed approach is tested and verified on an improved IEEE 33 node test system. The comparisons of the proposed method with the original MOEA/D and NSGA II on non dominated solutions, extreme solutions, optimal compromise solution (OCS) and statistical indicators are well illustrated. The results show that MOEA/D-TSA algorithm has better convergence and comprehensive performance than other considered algorithms and its application in rolling dispatch problem is also presented through this test system. ? 2021 Elsevier Ltd. All rights reserved.
引用
收藏
页数:18
相关论文
共 50 条
  • [11] A simulated annealing algorithm to find approximate Pareto optimal solutions for the multi-objective facility layout problem
    Ramazan Şahin
    Orhan Türkbey
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 1003 - 1018
  • [12] A simulated annealing algorithm to find approximate Pareto optimal solutions for the multi-objective facility layout problem
    Sahin, Ramazan
    Turkbey, Orhan
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (9-10): : 1003 - 1018
  • [13] An improved multi-objective evolutionary algorithm based on decomposition for bi-objective fuzzy flexible job-shop scheduling problem
    Li R.
    Gong W.-Y.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2022, 39 (01): : 31 - 40
  • [14] A new history-guided multi-objective evolutionary algorithm based on decomposition for batching scheduling
    Jia, Zhao-hong
    Gao, Le-yang
    Zhang, Xing-yi
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 141
  • [15] Research on Multi-objective Optimal Scheduling of Active Distribution Network Based on Cluster Partition
    Liu, Pengxi
    Long, Hongyu
    Ma, Mingyao
    PROCEEDINGS OF THE 2021 IEEE 16TH CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2021), 2021, : 1052 - 1056
  • [16] Optimal reservoir flood operation using a decomposition-based multi-objective evolutionary algorithm
    Zhang, Xiao
    Luo, Jungang
    Sun, Xiaomei
    Xie, Jiancang
    ENGINEERING OPTIMIZATION, 2019, 51 (01) : 42 - 62
  • [17] A Multi-Objective Evolutionary Algorithm Based on Decomposition for Optimal Design of Yagi-Uda Antennas
    Carvalho, R.
    Saldanha, R. R.
    Gomes, B. N.
    Lisboa, A. C.
    Martins, A. X.
    IEEE TRANSACTIONS ON MAGNETICS, 2012, 48 (02) : 803 - 806
  • [18] Decomposition-based multi-objective evolutionary algorithm for vehicle routing problem with stochastic demands
    Gee, Sen Bong
    Arokiasami, Willson Amalraj
    Jiang, Jing
    Tan, Kay Chen
    SOFT COMPUTING, 2016, 20 (09) : 3443 - 3453
  • [19] Decomposition-based dual-population evolutionary algorithm for constrained multi-objective problem
    Wang, Yufeng
    Zhang, Yong
    Xu, Chunyu
    Bai, Wen
    Zheng, Ke
    Dong, Wenyong
    SWARM AND EVOLUTIONARY COMPUTATION, 2025, 95
  • [20] Multi-Objective Evolutionary Algorithm Based on Decomposition for Air Traffic Flow Network Rerouting Problem
    Zhang, Xiao
    Xiao, Mingming
    Zhang, Miao
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2013, 2013, 8206 : 487 - 496