T.T. Tran, J. Choi, S. Moon (Korea), and R. Billinton (Canada)
Transmission system expansion planning, integerprogramming, branch and bound method, maximum flow-minimum cut set
This paper proposes a method to solve the expansion problem of a transmission network, given future generation and load strategies, an d alternative types of lines available, subject to load, reliability and right of way constraints. The problem is formulated as a series of zero or one integer programs which are solved by an efficient branch and bound algorithm. A study test result on a 63 bus test system shows that the proposed method is practical and efficiently applicable to transmission expansion planning.
Important Links:
Go Back
