Paired-bacteria optimiser – A simple and fast algorithm
| Autor: | Jon R. Saunders, M. S. Li, W. J. Tang, Qinghua Wu |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
education.field_of_study
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Population Evolutionary algorithm Fast algorithm Computer Science Applications Theoretical Computer Science Quorum sensing Rate of convergence Simple (abstract algebra) Signal Processing Theory of computation Benchmark (computing) education Algorithm Information Systems Mathematics |
| Zdroj: | Information Processing Letters. 111:809-813 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/j.ipl.2011.05.011 |
| Popis: | Most of Evolutionary Algorithms (EAs) do not fully explore the potential of searching ability and are time consuming. This paper presents a fast bacteria-inspired optimisation algorithm: Paired-Bacteria Optimiser (PBO), which incorporates the underlying mechanisms of bacterial chemotaxis and quorum sensing, and has only two bacteria in a population. The experimental results show that PBO has not only a promising performance of searching for accurate solutions, but also a fast convergence rate, which are evaluated using benchmark functions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect