2004
DOI: 10.1016/j.engappai.2004.02.009
|View full text |Cite
|
Sign up to set email alerts
|

Designing digital IIR filters using ant colony optimisation algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
57
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 121 publications
(57 citation statements)
references
References 14 publications
0
57
0
Order By: Relevance
“…In this paper, we use the ABC algorithm to find its optimal weights. Artificial Bee Colony (ABC) algorithm was originally presented by Karaboga et al [18] under the inspiration of collective behavior on honey bees with better performance in function optimization problems compared with GA, differential evolution (DE), and particle swarm optimization (PSO) [19]. As is known, normal global optimization techniques conduct only one search operation in one iteration.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we use the ABC algorithm to find its optimal weights. Artificial Bee Colony (ABC) algorithm was originally presented by Karaboga et al [18] under the inspiration of collective behavior on honey bees with better performance in function optimization problems compared with GA, differential evolution (DE), and particle swarm optimization (PSO) [19]. As is known, normal global optimization techniques conduct only one search operation in one iteration.…”
Section: Introductionmentioning
confidence: 99%
“…Genetic Algorith m (GA ) is not only capable of searching multid imensional and multimodal spaces but also optimizes co mplex and discontinuous functions that are hard to analyze mathematically. Therefore, researchers have developed design methods based on modern heuristics optimizat ion algorith ms such as genetic algorith ms [2][3][4][5][6][7][8][9][10] , particle swarm optimization [11] , seeker-optimizat ion-algorithm-based evolutionary method [12] , simulated annealing [13] , tabu search [14] , ant colony optimization [15] , hybrid taguchi genetic algorith m (HTGA) [16] ,immune algorith m (TIA) [17] and many more.…”
Section: Introductionmentioning
confidence: 99%
“…However, as the particles in PSO only search in a finite sampling space, it also lacks the ability to jump out of the local optima when solving complex multi-modal tasks. 16 Ant colony optimisation (ACO) 18 imitates the social behavior of real ant colonies. It may occasionally be trapped into local stagnation or premature convergence resulting in a low optimizing precision or even failure.…”
Section: Evolutionary Identification Methodsmentioning
confidence: 99%