Multi-objective flower algorithm for optimization
Yang, Xin-She 
ORCID: https://orcid.org/0000-0001-8231-5556, Karamanoglu, Mehmet ORCID: https://orcid.org/0000-0002-5049-2993 and He, Xingshi
(2013)
Multi-objective flower algorithm for optimization.
Procedia Computer Science, 18
.
861- 868.
ISSN 1877-0509
[Article]
(doi:10.1016/j.procs.2013.05.251)
Abstract
Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, we extend this flower algorithm to solve multi-objective optimization problems in engineering. By using the weighted sum method with random weights, we show that the proposed multi-objective flower algorithm can accurately find the Pareto fronts for a set of test functions. We then solve a bi-objective disc brake design problem, which indeed converges quickly.
| Item Type: | Article |
|---|---|
| Additional Information: | Proceedings of the International Conference on Computational Science, (ICCS) 2013 |
| Keywords (uncontrolled): | Algorithm; benchmark; flower algorithm; optimization; metaheuristics; engineering design |
| Research Areas: | A. > School of Science and Technology > Design Engineering and Mathematics |
| Item ID: | 10902 |
| Useful Links: | |
| Depositing User: | Mehmet Karamanoglu |
| Date Deposited: | 09 Aug 2013 07:32 |
| Last Modified: | 10 Jun 2019 13:07 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/10902 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)