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 条
  • [31] Elitist Multi-Objective Bacterial Foraging Evolutionary Algorithm for Multi-Criteria based Grid Scheduling Problem
    Kaur, Mandeep
    2016 INTERNATIONAL CONFERENCE ON INTERNET OF THINGS AND APPLICATIONS (IOTA), 2016, : 431 - 436
  • [32] Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure
    Toncovich, Adrian A.
    Rossit, Daniel A.
    Frutos, Mariano
    Rossit, Diego G.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2019, 10 (01) : 1 - 16
  • [33] A Multi Objective Evolutionary Algorithm based on Decomposition for a Flow Shop Scheduling Problem in the Context of Industry 4.0
    Rossit, Diego Gabriel
    Nesmachnow, Sergio
    Rossit, Daniel Alejandro
    INTERNATIONAL JOURNAL OF MATHEMATICAL ENGINEERING AND MANAGEMENT SCIENCES, 2022, 7 (04) : 433 - 454
  • [34] A Decomposition-based Multi-modal Multi-objective Evolutionary Algorithm with Problem Transformation into Two-objective Subproblems
    Nojima, Yusuke
    Fujii, Yuto
    Masuyama, Naoki
    Liu, Yiping
    Ishibuchi, Hisao
    PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 399 - 402
  • [35] Multi-objective optimal design for AC filters in high voltage direct current system based on improved multi-objective evolutionary algorithm based on decomposition
    Shi, Fan
    Wang, Honghua
    Lu, Tianhang
    Huang, Jiawei
    Wang, Chengliang
    HIGH VOLTAGE, 2023, 8 (03) : 492 - 503
  • [36] A multi-objective evolutionary algorithm based on adaptive clustering for energy-aware batch scheduling problem
    Qian, Si-yuan
    Jia, Zhao-hong
    Li, Kai
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 113 (113): : 441 - 453
  • [37] Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for Optimal Design of Hydrogen Supply Chains
    Cantu, Victor H.
    Azzaro-Pantel, Catherine
    Ponsich, Antonin
    30TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, PTS A-C, 2020, 48 : 883 - 888
  • [38] EVOLUTIONARY ALGORITHM BASED ON SIMULATED ANNEALING FOR THE MULTI-OBJECTIVE OPTIMIZATION OF COMBINATORIAL PROBLEMS EMSA: Hybrid Metaheuristic based on Genetic Algorithms, Simulated Annealing and Deterministic Swapping
    Ruiz, Elias D. Nino
    Nieto Parra, Henry
    Chinchilla Camargo, Anangelica Isabel
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2013, 4 (02): : 53 - 63
  • [39] A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots
    Zhang, Biao
    Pan, Quan-ke
    Meng, Lei-lei
    Zhang, Xin-li
    Jiang, Xu-chu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (03) : 1013 - 1038
  • [40] A Memetic Decomposition-Based Multi-Objective Evolutionary Algorithm Applied to a Constrained Menu Planning Problem
    Marrero, Alejandro
    Segredo, Eduardo
    Leon, Coromoto
    Segura, Carlos
    MATHEMATICS, 2020, 8 (11) : 1 - 18