Flower Pollination Algorithm: A Novel Approach for Multiobjective Optimization release_4mzggw3g6jfjtafuafggpedzuy

by Xin-She Yang, M. Karamanoglu, X. S. He

Released as a article .

2014  

Abstract

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this paper, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis are highlighted and discussed.
In text/plain format

Archived Files and Locations

application/pdf   585.4 kB
file_biy2p4fc4jb57n5mikj7xoo5pi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-08-22
Version   v1
Language   en ?
arXiv  1408.5332v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7502bad6-d65b-4942-bb95-4a493f92ec5d
API URL: JSON