Derivation and Generation of Path-Based Valid Inequalities for Transmission Expansion Planning

This paper seeks to solve the long-term transmission expansion planning problem more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle-differences along paths. Several theorems are proposed which show the validity of these cutting planes onto the underlying mathematical formulations. The path-based bus angle-difference constraints, which tighten the relaxed feasible region, are used in combination with branch-and-bound to find lower bounds on the optimal investment of the transmission expansion planning problem. This work also creates an algorithm that automates the process of finding and applying the discussed valid inequalities, resulting in significantly reduced testing and computation time. The algorithm is implemented in Python, using the solver CPLEX to add constraints and solve the transmission expansion problem. This paper uses two different-sized systems to illustrate the effectiveness of the proposed framework: a modified IEEE 118-bus system and the Polish 2383-bus system.

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

[2]  Seyyed M. T. Fatemi Ghomi,et al.  Acceleration strategies of Benders decomposition for the security constraints power system expansion planning , 2015, Ann. Oper. Res..

[3]  Rubén Romero,et al.  Bus-Angle Difference Structural Cuts for Transmission System Expansion Planning with L-l Reliability , 2018, 2018 IEEE Electrical Power and Energy Conference (EPEC).

[4]  James R. Luedtke,et al.  A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching , 2014, Oper. Res..

[5]  M. J. Rider,et al.  A Strategy to Solve the Multistage Transmission Expansion Planning Problem , 2011, IEEE Transactions on Power Systems.

[6]  S. Garcia-Martinez,et al.  Expansion of Electrical Networks Considering Power Quality Aspects by Applying a Multi-objective Tabu Search Technique , 2015, 2015 International Conference on Computational Science and Computational Intelligence (CSCI).

[7]  L. Vargas.  Angular cuts applied to the long-term transmission expansion planning problem , 2017 .

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

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

[10]  Eduardo N. Asada,et al.  A Heuristic method based on the branch and cut algorithm to the transmission system expansion planning problem , 2011, 2011 IEEE Power and Energy Society General Meeting.

[11]  Sara Lumbreras,et al.  Automatic selection of candidate investments for Transmission Expansion Planning , 2014 .

[12]  E. Gil,et al.  Transmission Expansion Planning Considering an Hourly Demand Curve , 2018 .

[13]  Laura Bahiense,et al.  A Mixed Integer Disjunctive Model for Transmission Network Expansion , 2001 .

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[15]  Hui Zhang.  Transmission Expansion Planning for Large Power Systems , 2013 .

[16]  Jian Di,et al.  Review of transmission network planning in market environment , 2013, 2013 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC).

[17]  Adolfo R. Escobedo.  Foundational Factorization Algorithms for the Efficient Roundoff-Error-Free Solution of Optimization Problems , 2016 .

[18]  M. V. F. Pereira,et al.  A New Benders Decomposition Approach to Solve Power Transmission Network Design Problems , 2001, IEEE Power Engineering Review.

[19]  Robert J. Thomas,et al.  Transmission System Expansion Plans in View Point of Deterministic, Probabilistic and Security Reliability Criteria , 2006, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

[20]  M. Anjos,et al.  Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem , 2012, IEEE Transactions on Power Systems.

[21]  Ruben Romero,et al.  Transmission system expansion planning by an extended genetic algorithm , 1998 .

[22]  S. Carneiro,et al.  Transmission system expansion planning using a sigmoid function to handle integer investment variables , 2005, 2006 IEEE Power Engineering Society General Meeting.

[23]  S. Binato,et al.  Transmission network expansion planning under a Tabu Search approach , 2001 .

[24]  G. Latorre,et al.  Classification of publications and models on transmission expansion planning , 2003 .

[25]  Hossein Haghighat,et al.  Bilevel Conic Transmission Expansion Planning , 2018, IEEE Transactions on Power Systems.

[26]  Jose Roberto Sanches Mantovani,et al.  Branch and bound algorithm for transmission system expansion planning using a transportation model , 2000 .

[27]  Natalia Alguacil,et al.  On the Solution of Large-Scale Robust Transmission Network Expansion Planning Under Uncertain Demand and Generation Capacity , 2016, IEEE Transactions on Power Systems.

[28]  R. Baldick,et al.  Dispatchable transmission in RTO markets , 2005, IEEE Transactions on Power Systems.

[29]  Quentin Ploussard,et al.  An Operational State Aggregation Technique for Transmission Expansion Planning Based on Line Benefits , 2017, IEEE Transactions on Power Systems.

[30]  Sara Lumbreras,et al.  The new challenges to transmission expansion planning. Survey of recent practice and literature review , 2016 .

[31]  Kory W. Hedman,et al.  A Fast LP Approach for Enhanced Utilization of Variable Impedance Based FACTS Devices , 2016, IEEE Transactions on Power Systems.

[32]  N. Wickramaarachchi,et al.  Transmission Network Planning Using Genetic Algorithm , 2006, 2006 IEEE/PES Transmission & Distribution Conference and Exposition: Latin America.

[33]  Kurt Mehlhorn,et al.  Cycle bases in graphs characterization, algorithms, complexity, and applications , 2009, Comput. Sci. Rev..