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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Received: 5 August 2019 Accepted: 10 January 2020 In this paper, the optimal feeder routing along with optimal distributed generator placement is formulated as an optimization problem. In this problem, the total cost of capital recovery, supply interruption and energy losses are minimized. Also, line loading capacity and bus voltage constraints are applied. By proposing a novel method to code the solutions of the optimization problem with the facilitation obtained from the utilization of the Kruskal's algorithm, it is guaranteed that graphs of all solutions would always be spanning trees. The main result of the implementation of this method within meta-heuristic algorithms is to limit the search space to radial networks leading to snap quicker answers with higher degree of optimality. A distribution network with a 24 load points and 42 candidate branches is used as a baseline to indicate the effectiveness of the proposed method which was tested using three meta-heuristic algorithms including genetic algorithm, particle swarm optimization and simulated annealing.

Optimal Feeder Routing and DG Placement Using Kruskal’s Algorithm