2011
DOI: 10.1016/j.ipl.2011.05.011
|View full text |Cite
|
Sign up to set email alerts
|

Paired-bacteria optimiser – A simple and fast algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…To evaluate the performance of GSOICLW, it is tested comprehensively on 21 benchmark functions [12], compared with GSO, GSOLW (which replaces RW with LW as for GSO), GSOIC (which integrates IC into GSO), PBO (paired-bacteria optimiser [21]) and BFAVP (bacterial foraging algorithm with varying population [22]). These benchmark functions consist of unimodal functions (f 1 À f 13 ) and multimodal functions (f 14 À f 21 ).…”
Section: Simulation Studiesmentioning
confidence: 99%
“…To evaluate the performance of GSOICLW, it is tested comprehensively on 21 benchmark functions [12], compared with GSO, GSOLW (which replaces RW with LW as for GSO), GSOIC (which integrates IC into GSO), PBO (paired-bacteria optimiser [21]) and BFAVP (bacterial foraging algorithm with varying population [22]). These benchmark functions consist of unimodal functions (f 1 À f 13 ) and multimodal functions (f 14 À f 21 ).…”
Section: Simulation Studiesmentioning
confidence: 99%
“…Most of these techniques are slow in convergence, poor robustness and need a large amount of calculation. Recently, a pairedbacteria optimizer (PBO) appears as a promising evolution technique for handling this kind of problem [14]. Unlike most of Evolutionary Algorithms (EAs), the PBO only have two individuals in each iteration and it converges fast in speed.…”
Section: Introductionmentioning
confidence: 99%