An efficient simulated annealing algorithm for network reconfiguration in large-scale distribution systems
Young-Jae Jeon, Jae‐Chul Kim, Jin‐O Kim et al. · IEEE Transactions on Power Delivery · 2002
This paper presents an efficient algorithm for loss minimization by using an automatic switching operation in large-scale distribution systems. Simulated annealing is particularly well suited for a large combinatorial optimization problem since it can avoid local minima by accepting improvements in cost. However, it often requires a meaningful cooling schedule and a special strategy, which makes use of the property of distribution systems in finding the optimal solution. In this paper, we augment the cost function with the operation condition of distribution systems, improve the perturbation mechanism with system topology, and use the polynomial-time cooling schedule, which is based on the statistical calculation during the search. The validity and effectiveness of the proposed methodology is demonstrated in the Korea Electric Power Corporation's distribution system.
Cited by 287 works. doi:10.1109/tpwrd.2002.803823
Authors
References
- Optimization by Simulated Annealing
- Tabu Search
- Network reconfiguration in distribution systems for loss reduction and load balancing
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
- Simulated annealing: theory and applications.
- Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing
- Distribution feeder reconfiguration for loss reduction
- Simulated Annealing: Theory and Applications
- Tabu Search
- Reconfiguration of electric distribution networks for resistive line losses reduction