Power Distribution Network Reconfiguration by Evolutionary Integer Programming
This paper presents and analyses new metaheuristics for solving the multiobjective (power) distribution network reconfiguration problem (DNRP). The purpose of DNRP is to minimize active power loss for single objective optimization, minimize active power loss and minimize voltage deviation for multi-objective optimization.
A non-redundant integer programming representation for the problem will be used to reduce the search space size as compared to a binary representation by several orders of magnitudes and represent exactly the feasible (cycle free, non-isolated node) networks. Two algorithmic schemes, a Hybrid Particle Swarm Optimization - Clonal Genetic Algorithm (HPCGA) and an Integer Programming Evolution Strategy (IES), will be developed for this representation and tested empirically.
Conventional algorithms for solving multi-objective DNRP are converting the multiple objective functions into a single objective function by adding weights. However, this method cannot capture the trade-offs and might fail in case of a concave Pareto front. Therefore, we extend the HPCGA and IES in order to compute Pareto fronts using selection procedures from NSGA-II and SMS-EMOA. The performance of the methods is assessed on large scale DNRPs.
KeywordsPower Distribution Network Reconfiguration Integer Programming Particle Swarm Optimization Clonal Genetic Algorithm Evolution Strategies Multiobjective Optimization
Unable to display preview. Download preview PDF.
- 2.Aman, M.M., Jasmon, G.B., Naidu, K., Bakar, A.H.A., Mokhlis, H.: Discrete evolutionary programming to solve network reconfiguration problem. In: TENCON Spring 2013 Conference, pp. 505–509. IEEE, Sydney (2013)Google Scholar
- 3.Rao, R.S., Narasimham, S.V.L., Ramalingaraju, M.: Optimization of distribution network configuration for loss reduction using artificial bee colony algorithm. International Journal of Electrical Power and Energy Systems Engineering 1(2), 116–122 (2008)Google Scholar
- 6.Qin, Y.M., Wang, J.: Distribution network reconfiguration based on particle clonal genetic algorithm. Journal of Computers 4(9), 813–820 (2009)Google Scholar
- 9.Wang, S.X., Wang, C.S.: A novel network reconfiguration algorithm implicitly including parallel searching for large-scale unbalanced distribution systems. Automation of Electric Power Systems 24(19), 34–38 (2000)Google Scholar
- 10.Ma, X.F., Zhang, L.Z.: Distribution network reconfiguration based on genetic algorithm using decimal encoding. Transactions of China Electrotechnical Society 19(10), 65–69 (2005)Google Scholar
- 11.Bi, P.X., Liu, J., Liu, C.X., Zhang, W.Y.: A refined genetic algorithm for power distribution network reconfiguration. Automation of Electric Power Systems 26(2), 57–61 (2002)Google Scholar
- 14.Wang, J., Luo, A., Qi, M.J., Li, M.J.: The improved clonal genetic algorithm & its application in reconfiguration of distribution networks. In: Power Systems Conference and Exposition, PSCE 2004, pp. 1423–1428. IEEE, New York (2004)Google Scholar
- 15.Rudolph, G.: An evolutionary algorithm for integer programming. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN III. LNCS, vol. 866, pp. 139–148. Springer, Heidelberg (1994)Google Scholar
- 18.Anderson, M., Whitcomb, P.: Find the optimal formulation for mixtures (2002), http://www.statease.com/pubs/chem-2.pdf
- 19.Bäck, T.: Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, New York (1996)Google Scholar