Optimization of Transmission Expansion Planning by Minimal Cut Sets Based on Graph Theory

• Published in: Electric power components and systems Vol. 43; no. 16; pp. 1822 - 1831
• Main Authors: Chen, Tsai-Hsiang, Tran, Van-Tan
• Format: Journal Article
• Language: English
• Published: Philadelphia Taylor & Francis 02.10.2015; Taylor & Francis Ltd
• Subjects: Algorithms; Benchmarking; bottleneck; Bottlenecks; Construction costs; Cost engineering; Expansion; Graph theory; IEEE standards; Investment; minimal cut sets; Networks; node removal method; optimal construction cost; Optimization; Overloading; Reliability; transmission network expansion planning
• ISSN: 1532-5008; 1532-5016
• DOI: 10.1080/15325008.2015.1062441

Abstract-This research proposes a method based on the graph theory for transmission network expansion planning. The proposed method suggests an optimal investment cost for transmission network expansion planning by using the minimal cut sets based on the graph theory. On the basis of the oriented connected graph of an intent transmission network, this research aims to find the maximum power flows through the bottlenecks of the network. The main object function of the proposed algorithm is the construction cost of new lines, which needs to be added in parallel with the overloading lines of an existing transmission network. The major consideration is the load demand in the given future. This research uses three benchmark systems to illustrate the proposed method: Garver's 6-bus system (Garver system) the 24-bus and 21-bus IEEE reliability test systems. In a word, the Garver system is used to demonstrate the algorithm of the proposed method, and the 24-bus and 21-bus IEEE reliability test systems are tested by using the proposed method in many cases to compare the results and performance with those of recent studies. The findings of this research are of value to solve transmission network expansion planning problems.