Flower pollination algorithm: A novel approach for multiobjective optimization

被引:432
作者
Yang, Xin-She [1 ]
Karamanoglu, Mehmet [1 ]
He, Xingshi [2 ]
机构
[1] Middlesex Univ, Sch Sci & Technol, London NW4 4BT, England
[2] Xian Polytech Univ, Sch Sci, Xian, Peoples R China
关键词
algorithm; flower pollination algorithm; metaheuristics; benchmark; optimization; DIFFERENTIAL EVOLUTION; SEARCH; DESIGN;
D O I
10.1080/0305215X.2013.832237
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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 article, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multiobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that the FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis is highlighted and discussed.
引用
收藏
页码:1222 / 1237
页数:16
相关论文
共 53 条
[21]   An efficient multiobjective differential evolution algorithm for engineering design [J].
Gong, Wenyin ;
Cai, Zhihua ;
Zhu, Li .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2009, 38 (02) :137-157
[22]   An improved particle swarm optimizer for mechanical design optimization problems [J].
He, S ;
Prempain, E ;
Wu, QH .
ENGINEERING OPTIMIZATION, 2004, 36 (05) :585-605
[23]  
Hedar A., 2013, TEST FUNCTION WEB PA
[24]  
Holland J.H., 1992, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
[25]   IPWM: An interval parameter water quality management model [J].
Huang, GH .
ENGINEERING OPTIMIZATION, 1996, 26 (02) :79-103
[26]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[27]  
Kim J. T., 1997, P 7 KAIST NTU KU TRI
[28]   The harmony search heuristic algorithm for discrete structural optimization [J].
Lee, KS ;
Geem, ZW ;
Lee, SH ;
Bae, KW .
ENGINEERING OPTIMIZATION, 2005, 37 (07) :663-684
[29]   Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II [J].
Li, Hui ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (02) :284-302
[30]  
Madavan NK, 2002, IEEE C EVOL COMPUTAT, P1145, DOI 10.1109/CEC.2002.1004404