scholarly journals A Granular Ant Colony Algorithm for Power Distribution Network Planning

2016 ◽  
Vol 9 (11) ◽  
pp. 169-180
Author(s):  
Jia-Mei Zhu ◽  
Honge Ren ◽  
Meng Zhu
Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 1094-1106 ◽  
Author(s):  
Zhen Li ◽  
Yao Zhang ◽  
Muhammad Aqeel Ashraf

Abstract Distribution network reconfiguration is a very complex and large-scale combinatorial optimization problem. In network reconfiguration, whether an effective solution can be obtained is a key issue. Aiming at the problems in network reconstruction by traditional algorithm, such as long time required, more times of power flow calculation and high network loss, a network optimization design algorithm based on improved ant colony algorithm for high voltage power distribution network is proposed. After analyzing the operating characteristics of the high voltage power distribution network, the network topology of the high voltage power distribution network is described by constructing a hierarchical variable-structure distribution network model. A mathematical model of distribution network reconstruction considering the opportunity constraint with the minimum network loss as the objective function is established. The power flow distribution is calculated by using the pre-push back-generation method combined with the hierarchical structure of the distribution network. The maximum and minimum ant colony algorithm is introduced to improve the pheromone updating method of the traditional ant colony algorithm, and the search range is expanded, so that the algorithm can jump out of the local optimization trap to realize the accurate solution of the power distribution network reconstruction model. The experimental results show that compared with the current network reconstruction algorithm, the proposed algorithm requires less time for convergence, less power flow calculation, and lower network loss.


Sign in / Sign up

Export Citation Format

Share Document