Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 133 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 125 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Sizing and Allocation of Distributed Energy Resources for Loss Reduction using Heuristic Algorithms (1911.07443v2)

Published 18 Nov 2019 in eess.SY and cs.SY

Abstract: Loss minimization in distribution networks (DN) is of great significance since the trend to the distributed generation (DG) requires the most efficient operating scenario possible for economic viability variations. Moreover, voltage instability in DNs is a critical phenomenon and can lead to a major blackout in the system. The decreasing voltage stability level restricts the increase of load served by distribution companies. DG can be used to improve DN capabilities and brings new opportunities to traditional DNs. However, installation of DG in non-optimal places can result in an increase in system losses, voltage problems, etc. In this paper, genetic algorithm (GA), harmony search algorithm (HSA) and improved HSA have been applied to determine the optimal location of DGs. Simulation results for an IEEE 33 bus network are compared for different algorithms, and the best algorithm is stated for minimum losses.

Citations (26)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.