Multi-objective flower algorithm for optimization
Conference paper
Yang, X., Karamanoglu, M. and He, X. 2013. Multi-objective flower algorithm for optimization. 2013 International Conference on Computational Science . Barcelona, Spain. 05 - 07 Jun 2013 Elsevier. pp. 861- 868 https://doi.org/10.1016/j.procs.2013.05.251
Type | Conference paper |
---|---|
Title | Multi-objective flower algorithm for optimization |
Authors | Yang, X., Karamanoglu, M. and He, X. |
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. |
Keywords | Algorithm; benchmark; flower algorithm; optimization; metaheuristics; engineering design |
Conference | 2013 International Conference on Computational Science |
Page range | 861- 868 |
Proceedings Title | Procedia Computer Science, Volume 18: 2013 International Conference on Computational Science |
Series | Procedia Computer Science |
ISSN | 1877-0509 |
Publisher | Elsevier |
Publication dates | |
2013 | |
Online | 01 Jun 2013 |
Publication process dates | |
Deposited | 09 Aug 2013 |
Output status | Published |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.procs.2013.05.251 |
Web of Science identifier | WOS:000321051200088 |
Language | English |
Permalink -
https://repository.mdx.ac.uk/item/841q6
87
total views0
total downloads4
views this month0
downloads this month