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 条
  • [41] A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem
    Sassi, Jamila
    Alaya, Ines
    Borne, Pierre
    Tagina, Moncef
    ENGINEERING OPTIMIZATION, 2022, 54 (03) : 524 - 538
  • [42] An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem
    Cota, Luciano P.
    Guimaraes, Frederico G.
    Ribeiro, Roberto G.
    Meneghini, Ivan R.
    de Oliveira, Fernando B.
    Souza, Marcone J. F.
    Siarry, Patrick
    SWARM AND EVOLUTIONARY COMPUTATION, 2019, 51
  • [43] Temporal Data Scheduling in Internet of Vehicles Using an Improved Decomposition-Based Multi-Objective Evolutionary Algorithm
    Li, Ya-Lun
    Chai, Zheng-Yi
    Tan, Fei
    Liu, Xu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (05) : 5282 - 5295
  • [44] Inverse modelling-based multi-objective evolutionary algorithm with decomposition for community detection in complex networks
    Zou, Feng
    Chen, Debao
    Huang, De-Shuang
    Lu, Renquan
    Wang, Xude
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 513 : 662 - 674
  • [45] Multi-objective optimal scheduling for vehicle routing problem (MVRP) based on improved genetic algorithm (IGA)
    Qian, Z
    Gao, LQ
    Hu, XP
    PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 494 - 498
  • [46] Near-optimal rehabilitation scheduling of water distribution systems based on a multi-objective genetic algorithm
    Alvisi, Stefano
    Franchini, Marco
    CIVIL ENGINEERING AND ENVIRONMENTAL SYSTEMS, 2006, 23 (03) : 143 - 160
  • [47] Multi-objective Rao algorithm in resilience-based optimal design of water distribution networks
    Jain, Priyanshu
    Khare, Ruchi
    WATER SUPPLY, 2022, 22 (04) : 4346 - 4360
  • [48] Solving Multi-Objective Semiconductor Assembly and Test Manufacturing Scheduling Problem Based on Estimation of Distribution Algorithm
    Zhong, Xincheng
    Liu, Chang
    Zhu, Jun
    Han, Dongbin
    Yuan, Zhiling
    2015 IEEE INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2015, : 1496 - 1501
  • [49] A Q-learning-based multi-objective evolutionary algorithm for integrated green production and distribution scheduling problems
    Hou, Yushuang
    Wang, Hongfeng
    Huang, Xiaoliang
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 127
  • [50] A Decomposition-Based Multi-Objective Evolutionary Algorithm for Solving Low-Carbon Scheduling of Ship Segment Painting
    Bu, Henan
    Zhu, Xianpeng
    Ge, Zikang
    Yang, Teng
    Yan, Zhuwen
    Tang, Yingxin
    COATINGS, 2024, 14 (03)