Transmission Expansion Planning Using Cycle Flows

作者: Fabian Neumann , Tom Brown

DOI: 10.1145/3396851.3397688

关键词:

摘要: The common linear optimal power flow (LOPF) formulation that underlies most transmission expansion planning (TEP) formulations uses bus voltage angles as auxiliary optimization variables to describe Kirchhoff's law. As well introducing a large number of variables, the angle-based has disadvantage it is not well-suited considering connection multiple disconnected networks. It is, however, possible circumvent these and reduce required constraints by expressing law directly in terms flows, based on cycle decomposition network graph. For generation capacity with multi-period LOPF, this equivalent reformulation was shown solving times an order magnitude. Allowing line be co-optimized discrete TEP problem makes non-convex mixed-integer problem. This paper develops novel cycle-based for LOPF compares standard formulation. combinatorics networks formalized both formulations, topic which received attention literature. conveniently accommodate synchronization options. Since use big-M disjunctive relaxation, useful derivations suitable values are provided. competing benchmarked realistic model European system at varying spatial temporal resolutions. solves up 31 faster particular cases, while averaging speed-up factor 4.

参考文章(24)
Panagiota Tsamasphyrou, Arnaud Renaud, Pierre Carpentier, Transmission Network Planning Under Uncertainty with Benders Decomposition Springer Berlin Heidelberg. pp. 457- 472 ,(2000) , 10.1007/978-3-642-57014-8_30
Norman Biggs, Algebraic Graph Theory Cambridge University Press. ,(1974) , 10.1017/CBO9780511608704
R. Romero, A. Monticelli, A. Garcia, S. Haffner, Test systems and mathematical models for transmission network expansion planning IEE Proceedings - Generation, Transmission and Distribution. ,vol. 149, pp. 27- 36 ,(2002) , 10.1049/IP-GTD:20020026
Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig, Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications Computer Science Review. ,vol. 3, pp. 199- 243 ,(2009) , 10.1016/J.COSREV.2009.08.001
M.F. Carvalho, S. Soares, T. Ohishi, Optimal active power dispatch by network flow approach IEEE Transactions on Power Systems. ,vol. 3, pp. 1640- 1647 ,(1988) , 10.1109/59.192975
Venkat Krishnan, Jonathan Ho, Benjamin F. Hobbs, Andrew L. Liu, James D. McCalley, Mohammad Shahidehpour, Qipeng P. Zheng, Co-optimization of electricity transmission and generation resources for planning and policy analysis: review of concepts and modeling approaches Energy Systems. ,vol. 7, pp. 297- 332 ,(2016) , 10.1007/S12667-015-0158-4
S. Binato, M.V.F. Pereira, S. Granville, A New Benders Decomposition Approach to Solve Power Transmission Network Design Problems IEEE Transactions on Power Systems. ,vol. 16, pp. 235- 240 ,(2001) , 10.1109/59.918292
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch, An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs Algorithmica. ,vol. 52, pp. 333- 349 ,(2008) , 10.1007/S00453-007-9064-Z
Joshua Adam Taylor, Convex Optimization of Power Systems ,(2015)
Henrik Ronellenfitsch, Marc Timme, Dirk Witthaut, A Dual Method for Computing Power Transfer Distribution Factors IEEE Transactions on Power Systems. ,vol. 32, pp. 1007- 1015 ,(2017) , 10.1109/TPWRS.2016.2589464