Sulaiman, M and Salhi, A (2016) A hybridisation of runner-based and seed-based plant propagation algorithms. In: Studies in Computational Intelligence. UNSPECIFIED, 195 - 215. ISBN 978-3-319-30233-1.
Sulaiman, M and Salhi, A (2016) A hybridisation of runner-based and seed-based plant propagation algorithms. In: Studies in Computational Intelligence. UNSPECIFIED, 195 - 215. ISBN 978-3-319-30233-1.
Sulaiman, M and Salhi, A (2016) A hybridisation of runner-based and seed-based plant propagation algorithms. In: Studies in Computational Intelligence. UNSPECIFIED, 195 - 215. ISBN 978-3-319-30233-1.
Abstract
In this chapter we introduce a hybrid plant propagation algorithm which combines the standard PPA which uses runners as a means for search and SbPPA which uses seeds as a means for search. Runners are more suited for exploitation while seeds, when propagated by animals and birds, are more suited for exploration. Combining the two is a natural development to design an effective global optimisation algorithm. PPA and SbPPA will be recalled. The hybrid algorithm is then presented and comparative computational results are reported.
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Health > Mathematical Sciences, Department of |
| Depositing User: | Jim Jamieson |
| Date Deposited: | 20 Nov 2016 14:26 |
| Last Modified: | 07 Apr 2021 10:16 |
| URI: | http://repository.essex.ac.uk/id/eprint/18122 |