Comparative study of Benders decomposition techniques for ATC calculation

Available transfer capability (ATC) is a relatively new concept and plays an increasingly significant role in the power industry deregulated environment. In this paper, Benders decomposition technique is applied to partition the ATC calculation problem considering static security constraints into an iterative two-stage mathematic programming problem. At the first stage, the master problem is formulated for calculating ATC with only the steady-state constraints. At the second stage, a series of slave problems relevant to different contingencies are formulated to check the feasibility of the solved ATC. Two different techniques are presented to add Benders cut to the master problem. Numerical results on the IEEE 30-bus system are given to compare the two techniques of Benders decomposition.