English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The distribution network restoration problem is by nature a mixed integer andnon-linear optimization problem due to the switching decisions and OptimalPower Flow (OPF) constraints, respectively. The link between these two partsinvolves logical implications modelled through big-M coefficients. The presenceof these coefficients makes the relaxation of the mixed-integer problem usingbranch-and-bound method very poor in terms of computation burden. Moreover,this link inhibits the use of classical Benders algorithm in decomposing theproblem because the resulting cuts will still depend on the big-M coefficients.In this paper, a novel decomposition approach is proposed for the restorationproblem named Modified Combinatorial Benders (MCB). In this regard, thereconfiguration problem and the OPF problem are decomposed into master and subproblems, which are solved through successive iterations. In the case of alarge outage area, the numerical results show that the MCB provides, within ashort time (after a few iterations), a restoration solution with a quality thatis close to the proven optimality when it can be exhibited.

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks