2012
DOI: 10.1002/etep.1674
|View full text |Cite
|
Sign up to set email alerts
|

Solution of economic load dispatch problem via hybrid particle swarm optimization with time-varying acceleration coefficients and bacteria foraging algorithm techniques

Abstract: SUMMARY In this research, a hybrid particle swarm optimization with time‐varying acceleration coefficients (HPSOTVAC) and bacteria foraging algorithm (BFA) are presented for solving a complex economic load dispatch problem. Basically, there are many realistic constraints that affect feasible operation such as generation limitation, ramp rate limits, prohibited operating zone, nonlinear cost functions, and transmission loss that are considered in this research. The effectiveness of the proposed HPSOTVAC/BFA is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
26
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 36 publications
(26 citation statements)
references
References 26 publications
0
26
0
Order By: Relevance
“…The best result archived by the MPSO-TVAC for 6-generators system is compared with the previous publiccations of GA [14], PSO [14], PSO_LRS [16], NPSO [16], NPSO_LRS [16] and PSO-TVAC [36] in Table 8. The results show that the MPSO-TVAC provides the minimum cost with less computational time compared to other methods .…”
Section: Comparison Of Best Solutionmentioning
confidence: 99%
See 1 more Smart Citation
“…The best result archived by the MPSO-TVAC for 6-generators system is compared with the previous publiccations of GA [14], PSO [14], PSO_LRS [16], NPSO [16], NPSO_LRS [16] and PSO-TVAC [36] in Table 8. The results show that the MPSO-TVAC provides the minimum cost with less computational time compared to other methods .…”
Section: Comparison Of Best Solutionmentioning
confidence: 99%
“…The results show that the MPSO-TVAC provides the minimum cost with less computational time compared to other methods . For 15-generators system, the results obtained by the MPSO-TVAC are compared with GA [14], PSO [14], BF [37], SOH_PSO [17],GA-API [6], PSO-MSAF [38], PSO-TVAC [36] and FA [34] in Table 9. It shows that MPSO-TVAC can produce a better cost and less computational time compared to other methods.…”
Section: Comparison Of Best Solutionmentioning
confidence: 99%
“…Many of real-world optimization problems involve with complexities such as nonlinearity, nonconvexity, nonsmoothness, nondifferentiability, mixed integer nature, and discontinuous domain, which challenge the numerical optimization methods [3]. Accordingly, to tackle the mentioned complexities, several metaheuristic optimization techniques have been proposed in the literature in the recent decades such as genetic algorithm (GA) [4], particle swarm optimization (PSO) [5,6], ant colony optimization (ACO) [7,8], honey bee mating optimization (HBMO) [9,10], artificial bee colony (ABC) [11,12], bacterial foraging (BF) [13], clonal selection algorithm (CSA) [14], invasive weed optimization (IWO) [15], shuffled frog leaping (SFL) [16], evolutionary algorithm (EA) [17], differential evolution (DE) [18], Correspondence to: O. Abedinia, E-mail: abediniaoveis@ gmail.com simulated annealing (SA) [19], and gravitational search algorithm (GSA) [20,21]. Due to their high flexibility, simplicity and modeling efficiency, these optimization methods have been widely used in many scientific and engineering areas.…”
Section: Introductionmentioning
confidence: 99%
“…However, the classical PSO algorithm may converge at local minima, especially for complex problems with multiple local minima. Many PSO variants were proposed in [21][22][23][24][25] in order to enhance the searching capability of classical PSO.…”
Section: Introductionmentioning
confidence: 99%