2018
DOI: 10.4314/jfas.v9i3s.57
|View full text |Cite
|
Sign up to set email alerts
|

Comparison between Binary Particles Swarm Optimization (BPSO) and Binary Artificial Bee Colony (BABC) for nonlinear autoregressive model structure selection of chaotic data

Abstract: This paper presents a comparison between the Binary Artificial Bee Colony (BABC) and Binary Particle Swarm Optimization (BPSO) algorithm for structure selection of a Nonlinear Auto-Regressive Model (NAR) of the chaotic Mackey optimization algorithms are swarm BPSO mimicking the swarming behavior of birds. Recent research has suggested that the ABC algorithm has better solution quality compared to PSO. However, resea this advantage applies to the structure selection case in system identification has not been in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…These works conclude that ABC algorithm can converge faster than particle swarm optimization (PSO), genetic algorithm (GA), cuckoo-search, and differential evolution. [38][39][40] Moreover, another work comparison to other full search (FS) methods, modified ABC algorithm (MABCA), outperformed. 40,41 The authors compared MABCA to six FS methods including FS, three-step search, new three-step search, simple and efficient search, four-step search, and diamond search.…”
Section: Related Workmentioning
confidence: 99%
“…These works conclude that ABC algorithm can converge faster than particle swarm optimization (PSO), genetic algorithm (GA), cuckoo-search, and differential evolution. [38][39][40] Moreover, another work comparison to other full search (FS) methods, modified ABC algorithm (MABCA), outperformed. 40,41 The authors compared MABCA to six FS methods including FS, three-step search, new three-step search, simple and efficient search, four-step search, and diamond search.…”
Section: Related Workmentioning
confidence: 99%
“…The results have very slight different with single PSO [30]. In this paper, the composition of a set of implementation frameworks for the LLH of PSO-GA [31] with dynamic parameterization has been presented. The implementation frameworks are developed based on a general taxonomy that classify the common terminology of the LLH.…”
Section: Constant Parameterizationmentioning
confidence: 99%