Subject004 Data processing and computer science 510 Mathematics Greedy-AlgorithmusHeuristikProgrammierungOptimierung
MetadataShow full item record
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.
CitationIn: IEEE Open Access Journal of Power and Energy Volume 7 (2020-07-01) , S. 234-242 ; EISSN: 2687-7910
SponsorshipGefördert durch den Publikationsfonds der Universität Kassel
CollectionsPublikationen (Artikel im Open Access gefördert durch die UB)
The following license files are associated with this item: