论文信息 - Branch and bound algorithm for transmission system expansion planning using a transportation model

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been tested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

[1] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[2] Hamdy A. Taha. CHAPTER 2 – Linear Programming , 1975 .

[3] L. L. Garver,et al. Transmission Network Estimation Using Linear Programming , 1970 .

[4] G. Nemhauser,et al. Integer Programming , 2020 .

[5] Jean-Michel Gauthier,et al. Experiments in mixed-integer linear programming using pseudo-costs , 1977, Math. Program..

[6] Ruben Romero,et al. A hierarchical decomposition approach for transmission network expansion planning , 1994 .

[7] C. J. Baldwin,et al. A Model for Transmission Planning by Logic , 1959, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[8] A. Santos,et al. Interactive Transmission Network Planning Using a Least-Effort Criterion , 1982, IEEE Transactions on Power Apparatus and Systems.