2018
DOI: 10.1155/2018/6258350
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic Approach for Optimal Planning and Operation of Distribution Systems

Abstract: The efficient planning and operation of power distribution systems are becoming increasingly significant with the integration of renewable energy options into power distribution networks. Keeping voltage magnitudes within permissible ranges is vital; hence, control devices, such as tap changers, voltage regulators, and capacitors, are used in power distribution systems. This study presents an optimization model that is based on three heuristic approaches, namely, particle swarm optimization, imperialist compet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…In literature, various versions of the PSO-SVM algorithm have been developed for different issues in multiple scientific fields. In comparison to the literature, the PSO and SVM clustering algorithms have been observed to be extremely successful for their own concerns [29][30][31][34][35][36][37][38][39][40][41][42][43]. This study successfully created a combined version of the algorithm, as well as its computer code.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In literature, various versions of the PSO-SVM algorithm have been developed for different issues in multiple scientific fields. In comparison to the literature, the PSO and SVM clustering algorithms have been observed to be extremely successful for their own concerns [29][30][31][34][35][36][37][38][39][40][41][42][43]. This study successfully created a combined version of the algorithm, as well as its computer code.…”
Section: Resultsmentioning
confidence: 99%
“…where w represents corresponding weights, c 1 , c 2 are acceleration coefficients (cognitive parameter, social parameter), rand 1 , rand 2 are uniformly distrubed random numbers between 0 and 1, V old p gives velocity of individual p at the iteration, X old p determines position of individual p at the current iteration, P best and gbest indicate the best local value of each particle and the best value of swarm, respectively [30], [31].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…The particles keep the best value in their memory. This value, P best , is listed for each particle and the best value is selected according to the …tness function such as G best [39,42,43].…”
Section: Study Samplesmentioning
confidence: 99%
“…The swarm size plays a very important role in the PSO, as is the complexity and sturdiness of the algorithm. As shown in Figure 1, the PSO algorithm was inspired by the literature [21,42].…”
Section: Figure 1 the Pso Algorithmmentioning
confidence: 99%
“…A heuristic approach is used for the solution of this model example which can be easily implemented to optimise the production logistics system. It is based on the experience of the authors who present examples of theoretical and practical bases, for example, in [43], [44], [45], or [46] who provides satisfactory decision support.…”
Section: Introductionmentioning
confidence: 99%