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

TLDR

The transmission network is modeled as a transportation network. A method for optimal transmission network expansion planning is presented. The problem is solved using hierarchical Benders decomposition, with a branch‑and‑bound master subproblem for investment decisions and a specialized linear program slave subproblem for network operation. Several alternative branch‑and‑bound implementations, tailored to the problem’s special characteristics, were tested on various literature test systems.

Abstract

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.