考量方向選擇之蟻群算法進行配電網重構

Reconfigurations of Distribution Networks by Using Ant Colony Algorithms with Improved Directional Selection Schemes

何柳(He, Liu)

指導教授 ： 朱家齊

國立清華大學/電機資訊學院/電機工程學系/碩士(2015年)

摘要

本論文提出以基於方向選擇性的蟻群算法來解決配電網重構問題。在蟻群算法的基礎上，提出了基於概率的搜索方法，在費洛蒙中添加了方向資訊，設計了基於降低之前已搜索路徑概率的搜索策略，對鄰域執行選擇性搜索操作，在探索的過程中打破隨機無序的向下一個城市移動的特性而根據費洛蒙進行移動，避免迅速向個體最佳位置移動，並且在該點附近徘徊，出現過早的局部收斂。因此保證粒子向最佳位置移動的同時，使得整個種群根據費洛蒙可迅速良性發展，最終達到收斂。
本文以網損最小、負載均衡最優、開關操作次數少為重構之最佳化目標，並將電壓，過載電流的限制條件化為偏離懲罰函數，減少了限制條件，並考慮了負載波動等不確定因素，對IEEE33配電網算例進行驗證，配電網網路重構之後，在負載波動的影響下，網路仍能保持穩定，並得到了整體變化負載不影響最優解網路結構的結論，表明方向選擇蟻群最佳化算法對配電網的初始解不具有依賴性，算法的穩定性良好。最後對通過改變目標權重和懲罰因子，對多組聯絡開關斷開位置進行分析，提出了重負載偏好的方法，並對69節點的配電網路進行驗證，不僅可求得最佳配置，亦可縮短計算時間。

關鍵字

方向選擇 ； 蟻群算法 ； 多目標配電網重構 ； 重負載偏好

並列摘要

In this thesis, an ant colony algorithm based on directional selection is proposed to solve the problem of distribution network reconfigurations. On the basis of ant colony optimization algorithms, the search direction is based on the direction information which can reduce the probability of previously searched paths. It will be chosen when the searching on the neighborhood. During the exploration process, it breaks the characteristics random down to any cities, but to move according to the pheromone. Thus, this method can avoid the rapid move to the individual best position and the appearance of premature convergence in the vicinity of the wandering.
The optimization objective for network configurations includes three items: (i) the minimum network loss, (ii) the optimal load balancing, and (iii) the least switching operations. The voltage overload current is deviated to the penalty function, reducing the constraint conditions. The IEEE33 distribution network example is used for verification. The network after this reconfiguration can still remain stable underload fluctuations. It can be concluded that the change of load does not affect the optimal network structure result. This result also demonstrates that the directional selection ant colony optimization algorithm is independent of the initial configuration of the distribution network. Numerical experiments reflect that the algorithm provides a suitable solution in terms of stability.
Finally, by changing the objective weights and penalty factors, groups of switch off position are analyzed A reduction in calculation time can be observed on the 69-node testing network without sacrificing the solution quality.

並列關鍵字

Directional Selection ； Ant Colony Optimization Algorithm ； Multi-Objectives Distribution Network Reconfigurations ； Heavy Load Preference

參考文獻

[1] V C Güngör, D Sahin, T Kocak, et al. “Smart grid technologies: communication technologies and standards. ”IEEE Transactions on Industrial informatics, vol. 7, no.4, pp529-539, 2011.

[3] E R Ramos, A G Expósito, J R Santos, et al. “Path-based distribution network modeling: application to reconfiguration for loss reduction.” IEEE Transactions on Power Systems, vol. 20, no. 2, pp556-564, 2005.

[4] M E Baran, F F Wu. “Network reconfiguration in distribution systems for loss reduction and load balancing.” IEEE Transactions on Power Delivery, vol. 4, no. 2, pp1401-1407, 1989.

[5] D Shirmohammadi, H W Hong. “Reconfiguration of electric distribution networks for resistive line losses reduction.” IEEE Transactions on Power Delivery, vol. 4, no. 2, pp1492-1498, 1989.

[6] J Z Zhu. “Optimal reconfiguration of electrical distribution network using the refined genetic algorithm.” Electric Power Systems Research, vol. 62, no. 1, pp37-42, 2002.