A Hybrid Optimization Method Combining Network Expansion Planning and Switching State Optimization

Combining switching state optimization (SSO) and network expansion planning (NEP) in AC systems results in a mixed-integer non-linear optimization problem. Two methodically different solution approaches are mathematical programming and heuristic methods. In this paper, we develop a hybrid optimization method combining both methods to solve the combined optimization of SSO and NEP. The presented hybrid method applies a DC programming model as an initialization strategy to reduce the search space of the heuristic. A greedy heuristic ensures that the obtained solutions are AC feasible. We compare the hybrid method with other heuristic methods and three mathematical programming models on the same set of planning problems. We show optimization results for four realistic sized power system study cases. Evaluation criteria are convergence, solution cost, and run time. Results show that the hybrid method is able to find a higher number of valid AC-solutions in comparisons to the mathematical programming methods. Furthermore, the obtained solutions have lower expansions costs and are obtained in a shorter run-time compared to the remaining methods for the analyzed study cases. As an addition to this paper, the hybrid implementation and the defined benchmark cases are available as open-source software.

[1]  Jan-Hendrik Menke,et al.  Comparison of Meta-Heuristics for the Planning of Meshed Power Systems , 2020, 2020 6th IEEE International Energy Conference (ENERGYCon).

[2]  Martin Braun,et al.  Heuristic optimisation for automated distribution system planning in network integration studies , 2017 .

[3]  Hamam Yskandar,et al.  A Comprehensive State-of-the-Art Survey on the Transmission Network Expansion Planning Optimization Algorithms , 2019, IEEE Access.

[4]  Pascal Van Hentenryck,et al.  AC-Feasibility on Tree Networks is NP-Hard , 2014, IEEE Transactions on Power Systems.

[5]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[6]  M. Ferris,et al.  Optimal Transmission Switching , 2008, IEEE Transactions on Power Systems.

[7]  Russell Bent,et al.  Transmission Network Expansion Planning: Bridging the gap between AC heuristics and DC approximations , 2014, 2014 Power Systems Computation Conference.

[8]  Surender Reddy Salkuti,et al.  Congestion Management Using Optimal Transmission Switching , 2018, IEEE Systems Journal.

[9]  Ali Reza Abbasi,et al.  Efficient linear network model for TEP based on piecewise McCormick relaxation , 2019, IET Generation, Transmission & Distribution.

[10]  Ali Ahmadian,et al.  Assessment of optimization algorithms capability in distribution network planning: Review, comparison and modification techniques , 2016 .

[11]  Florian Schäfer,et al.  Pandapower—An Open-Source Python Tool for Convenient Modeling, Analysis, and Optimization of Electric Power Systems , 2017, IEEE Transactions on Power Systems.

[12]  Javad Lavaei,et al.  A Bound Strengthening Method for Optimal Transmission Switching in Power Systems , 2017, IEEE Transactions on Power Systems.

[13]  Xiao-Ping Zhang,et al.  Automatic Selection Method for Candidate Lines in Transmission Expansion Planning , 2018, IEEE Access.

[14]  Russell Bent,et al.  PowerModels.J1: An Open-Source Framework for Exploring Power Flow Formulations , 2017, 2018 Power Systems Computation Conference (PSCC).

[15]  Carlos Sabillon Antunez,et al.  Transmission Expansion Planning: Literature Review and Classification , 2019, IEEE Systems Journal.

[16]  Pascal Van Hentenryck,et al.  Convex quadratic relaxations for mixed-integer nonlinear programs in power systems , 2016, Mathematical Programming Computation.

[17]  Ian A. Hiskens,et al.  A Survey of Relaxations and Approximations of the Power Flow Equations , 2019, Foundations and Trends® in Electric Energy Systems.

[18]  Dirk Van Hertem,et al.  TNEP of meshed HVDC grids: ‘AC’, ‘DC’ and convex formulations , 2019 .

[19]  R. Bent,et al.  Transmission Network Expansion Planning With Complex Power Flow Models , 2012, IEEE Transactions on Power Systems.

[20]  Quentin Ploussard,et al.  A Search Space Reduction Method for Transmission Expansion Planning Using an Iterative Refinement of the DC Load Flow Model , 2020, IEEE Transactions on Power Systems.

[21]  Panos M. Pardalos,et al.  Optimization techniques applied to planning of electric power distribution systems: a bibliographic survey , 2018 .

[22]  Pascal Van Hentenryck,et al.  Strengthening the SDP Relaxation of AC Power Flows With Convex Envelopes, Bound Tightening, and Valid Inequalities , 2017, IEEE Transactions on Power Systems.

[23]  Harsha Nagarajan,et al.  Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia , 2018, CPAIOR.