Improved K-means Clustering based Distribution Planning on a Geographical Network

Full Text (PDF, 607KB), PP.69-75

Views: 0 Downloads: 0


Manju Mam 1,* Leena G 1 N.S. Saxena 2

1. Manav Rachna International University/EEE Dept., Faridabad, 121004, India

2. Management Development Institute, Gurgaon, 122007, India

* Corresponding author.


Received: 20 Jul. 2016 / Revised: 11 Oct. 2016 / Accepted: 26 Dec. 2016 / Published: 8 Apr. 2017

Index Terms

Distribution planning, kmeans, geographical network, modified load flow, improved kmeans, clustering, feeder routing


This paper presents a distribution planning on a geographical network, using improved K-means clustering algorithm and is compared with the conventional Euclidean distance based K-means clustering algorithm. The distribution planning includes optimal placement of substation, minimization of expansion cost, optimization of network parameters such as network topology, routing of single/multiple feeders, and reduction in network power losses. The improved K-means clustering is an iterative weighting factor based optimization algorithm which locates the substation optimally and improves the voltage drop at each node. For feeder routing shortest path based algorithm is proposed and the modified load flow method is used to calculate the active and reactive power losses in the network. Simulation is performed on 54 nodes based geographical network with load points and the results obtained show significant power loss minimization as compared to the conventional K-means clustering algorithm.

Cite This Paper

Manju Mam, Leena G, N S Saxena, "Improved K-means Clustering based Distribution Planning on a Geographical Network", International Journal of Intelligent Systems and Applications(IJISA), Vol.9, No.4, pp.69-75, 2017. DOI:10.5815/ijisa.2017.04.08


[1]Das D, Kothari D P, Kalam A. Simple and efficient method for load flow solution of radial distribution networks. 1995:17(5):335-346
[2]Ramirez-Rosado I.J, Gonen T. Pseudo dynamic Planning for Expansion of Power Distribution Systems. IEEE Trans. on Power Systems. 1991:6(1):245-254
[3]Nara K, Satoh T, Aoki K, Kitagawa M, Yamanaka M. Multi-Year Expansion Planning for Distribution Systems. IEEE Trans. on Power Systems. 1991:6(3):952-958
[4]Ranjan R, Venkatesh B, Das D. A new algorithm for power distribution system planning. Electric Power System Research. 2002:62:55-65
[5]Vaziri M, Tomsovic K, Bose A. Numerical Analyses of a Directed Graph Formulation of the Multistage Distribution Expansion Problem. IEEE Trans. on Power Delivery. 2004:19(3):1348-1354
[6]Peng W, Liu W. A new method for substation planning problem based on weighted K-means. Conference: Advances in Neural Networks. 2009
[7]Ouyang W, Cheng H, Zhang X, Yao L. Distribution network planning method considering distributed generation for peak cutting. Energy Conversion and Management. 2010:51(12):2394-2401
[8]U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, 1996.
[9]R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: John Wiley & Sons, 1973.
[10]A. Gersho and R.M. Gray, Vector Quantization and Signal Compression. Boston: Kluwer Academic, 1992.
[11]Kanungo D., Mount D. M., Netanyahu N. S., Piatko C.D., Silverman R., Wu A.Y. An efficient k-Means clustering algorithm: Analysis and implementation. 2002:24(7):881-892
[12]Tinney W F, Hart C E. Power flow solution by Newton's method. IEEE Trans. on PAS. 1967:PAS-86(11):1449-1460
[13]B Stott, Alsac O. Fast decoupled load flow. IEEE Trans. on PAS. 1974:PAS-93(3):859-869
[14]Stagg G W, El-Abiad A H. Computer methods in power system analysis. 1968 Tata McGraw Hill
[15]Nagrath I.J, Kothari D.P. Modern power system analysis. 1989 2nd edition Tata McGraw Hill
[16]Kalesar B.M, Seifi A.R. Optimal substation placement and feeder routing in distribution system planning using genetic algorithm. Elixir Elec. Engg. 2011:37:3908-3915