A Branch-and-bound Algorithm For The Multi-stage Transmission Expansion Planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.1171176Romero, R., Monticelli, A., Garcia, A., Haffner, S., Test systems and mathematical models for transmission network expansion planning (2002) IEE Proceedings - Generation, Transmission and Distribution, 149 (1), pp. 27-36Garver, L.L., Transmission network estimation using linear programming (1970) IEEE Trans. Power App. Syst., 89, pp. 1688-1697Romero, R., Rocha, C., Mantovani, M., Mantovani, J.R.S., Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems (2003) IEE Proceedings - Generation, Transmission and Distribution, 150 (5), pp. 521-526Haffner, S., Monticelli, A., Garcia, A., Romero, R., Specialized branch and bound algorithm for transmission network expansion planning (2001) IEE Proceedings - Generation, Transmission and Distribution, 148 (5), pp. 482-488Gallego, R.A., Monticelli, A., Romero, R., Comparative studies of non-convex optimization methods for transmission network expansion planning (1998) IEEE Transactions on Power Systems, 13 (3), pp. 822-828Da Silva, E.L., Gil, H.A., Areiza, J.M., Transmission network expansion planning under an improved genetic algorithm (2000) IEEE Transactions on Power Systems, 15 (4), pp. 1168-1175Da Silva, E.L., Areiza, J.M., De Oliveira, G.C., Binato, S., Transmission network expansion planning under a tabu search approach (2001) IEEE Transactions on Power Systems, 16 (1), pp. 62-68Latorre, G., Cruz, R.D., Areiza, J.M., Villegas, A., Classification of publications and models on transmission expansion planning (2003) IEEE Transactions on Power Systems, 18 (2), pp. 938-946Villasana, R., Garver, L.L., Salon, S.J., Transmission network planning using linear programming (1985) IEEE Trans. Power App. Systems, 104 (2), pp. 349-356Granville, S., Pereira, M.V.F., Analysis of the linearized power flow model in Benders decomposition (1985) EPRI-report, , Rp 2473-6, Stanford UniversitySeifu, A., Salon, S., List, G., Optimization of transmission line planning including security constraints (1989) IEEE Trans. Power Systems, 4 (4), pp. 1507-1513. , OctFang, R., Hill, D.J., A new strategy for transmission expansion in competitive electricity markets (2003) IEEE Trans. Power Systems, 18 (1), pp. 374-380. , FebEscobar, A.H., Gallego, R.A., Romero, R., Multistage and coordinated planning of the expansion of transmission systems (2004) IEEE Trans. Power Systems, 9 (2), pp. 735-744. , MayGauthier, J.M., Ribiere, G., Experiments in mixed integer linear programming using pesudo costs (1977) Mathematical Programming, 12, pp. 26-47Linderoth, J.T., Savelsbergh, M.W.P., A computational study of search strategies for mixed integer programming (1999) INFORMS Journal Comput., 11 (25), pp. 173-18