Paper
13 October 2022 Optimization method for distributed energy access to distribution network based on chaotic genetic simulated annealing algorithm
Author Affiliations +
Proceedings Volume 12287, International Conference on Cloud Computing, Performance Computing, and Deep Learning (CCPCDL 2022); 122870O (2022) https://doi.org/10.1117/12.2640955
Event: International Conference on Cloud Computing, Performance Computing, and Deep Learning (CCPCDL 2022), 2022, Wuhan, China
Abstract
This paper proposes an optimization method for distributed energy access to distribution network based on chaotic genetic simulated annealing algorithm, and establishes a joint optimization with the total network loss of the power grid system, the minimum node voltage, the average voltage deviation, and the user power purchase cost as the objective function. model, to realize the location selection and constant volume of distributed energy, and to use the weighted method to realize the simplification of the objective function. The chaotic genetic simulated annealing algorithm is used to solve the optimization model, and the simulation comparison is made based on the IEEE-69 node system and the particle swarm algorithm , the results show that the proposed method has higher effectiveness and reliability.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fan Xie, Anqin Luo, and Jianan Yuan "Optimization method for distributed energy access to distribution network based on chaotic genetic simulated annealing algorithm", Proc. SPIE 12287, International Conference on Cloud Computing, Performance Computing, and Deep Learning (CCPCDL 2022), 122870O (13 October 2022); https://doi.org/10.1117/12.2640955
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Optimization (mathematics)

Algorithms

Genetics

Particle swarm optimization

Particles

Chaos

Back to Top