Sulaiman, Muhammad and Salhi, Abdellah (2016) A Hybridisation of Runner-Based and Seed-Based Plant Propagation Algorithms. In: Studies in Computational Intelligence. Springer International Publishing, pp. 195-215. ISBN 9783319302331. Official URL: http://dx.doi.org/10.1007/978-3-319-30235-5_10
Sulaiman, Muhammad and Salhi, Abdellah (2016) A Hybridisation of Runner-Based and Seed-Based Plant Propagation Algorithms. In: Studies in Computational Intelligence. Springer International Publishing, pp. 195-215. ISBN 9783319302331. Official URL: http://dx.doi.org/10.1007/978-3-319-30235-5_10
Sulaiman, Muhammad and Salhi, Abdellah (2016) A Hybridisation of Runner-Based and Seed-Based Plant Propagation Algorithms. In: Studies in Computational Intelligence. Springer International Publishing, pp. 195-215. ISBN 9783319302331. Official URL: http://dx.doi.org/10.1007/978-3-319-30235-5_10
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 Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 20 Nov 2016 14:26 |
| Last Modified: | 24 Oct 2024 21:45 |
| URI: | http://repository.essex.ac.uk/id/eprint/18122 |