Abstract
Substation planning is considered the most important step in the power system planning process. It represents the main link between transmission and distribution system. In this paper, the substation planning problem is looked as a clustering process to divide all the loads into several clusters. The capacity of substation is estimated by the total value of loads. The location and links are solved iteratively using weighted k-means, whose objective function is the investment cost. Each cluster is charged by a substation which is in the cluster weighted center. The performance of the proposed method as compared to that of an evolutionary computing approach is promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nara, K., Satoh, T., Aoki, K., et al.: Multi-year Expansion Planning for Distribution Systems. IEEE Transactions on Power Systems 6, 952–958 (1991)
Thompson, G.L., Wall, D.L.: A Branch and Bound Model for Choosing Optimal Substation Locations. IEEE Trans. Power App. Syst. 100, 2683–2688 (1981)
Fawzi, T.H., Ali, K.F., Sobki, S.M.E.: A New Planning Model For Distribution Systems. IEEE Trans. Power App. Syst. 102, 3010–3017 (1983)
Hasselfield, C.W., Wilson, P., Penner, L., et al.: An Automated Method for Least Cost Distribution Planning. IEEE Trans. Power Delivery 5, 1188–1194 (1990)
Jonnavithula, S., Billinton, R.: Minimum Cost Analysis of Feeder Routing in Distribution System Planning. IEEE Trans. Power Delivery 11, 1935–1940 (1996)
Ramirez-Rosado, I.J., Bernal-Agustin, J.L.: Genetic Algorithms Applied to the Design of Large Power Distribution Systems. IEEE Trans. Power Sys. 13, 696–703 (1998)
Miranda, V., Ranito, J.V., Proença, L.M.: Genetic Algorithms in Optimal Multistage Distribution Network Planning. IEEE Trans. Power Sys. 9, 1927–1933 (1994)
Miguez, E.: Herramientas Para La Planificación De Redes De Distribución En Areas De Población Dispersa, Ph.D. Dissertation, Universidade de Vigo, Spain (1999)
Diaz-Dorado, E., Cidras, J., Miguez, E.: Application of Evolutionary Algorithms for the Planning of Urban Distribution Networks of Medium Voltage. IEEE Trans. Power Sys. 17, 879–884 (2002)
Liu, Z., Zhang, J.: Optimal Planning of Substation of Locating and Sizing Based on GIS and Adaptive Mutation PSO Algorithm. In: International Conference on Power System Technology, pp. 1–5 (2006)
Li, W., Wang, H., Zou, Z.: Function Optimization Method Based on Bacterial Colony Chemotaxis. Journal of Circuits and Systems 20, 58–63 (2005)
Liu, W., Yi, F., Zhang, J., et al.: Study of Multi-level Substation Planning Approach Aased on Bacteria lColony Chemotaxis Algorithm and GIS. In: Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies, pp. 1014–1019 (2008)
Miranda, V., Srinivasan, D., Proença, L.M.: Evolutionary Computation in Power Systems. Electrical Power Energy Sys. 20, 89–98 (1998)
Yasuoka, J., Brittes, J., Schmidt, H., et al.: Artificial Neural Network-based Distribution Substation and Feeder Load Forecast. In: 16th International Conference and Exhibition on Electricity Distribution, pp. 5–26 (2001)
Alsabti, K., Ranka, S., Singh, V.: An Efficient K-Means Clustering Algorithm. In: First Workshop High Performance Data Mining (1998)
Astrahan, M.: Speech Analysis by Clustering, or the Hyperphoneme Method. Stanford University, Palo Alto (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, W., Liu, W. (2009). A New Method for Substation Planning Problem Based on Weighted K-Means. In: Yu, W., He, H., Zhang, N. (eds) Advances in Neural Networks – ISNN 2009. ISNN 2009. Lecture Notes in Computer Science, vol 5552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01510-6_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-01510-6_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01509-0
Online ISBN: 978-3-642-01510-6
eBook Packages: Computer ScienceComputer Science (R0)