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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Peng, W., & Liu, W. (2009). A new method for substation planning problem based on weighted K-mean. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5552 LNCS, pp. 647–654). https://doi.org/10.1007/978-3-642-01510-6_73
Mendeley helps you to discover research relevant for your work.