An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

被引:28
作者
Abdel-Basset, Mohamed [1 ]
Zhou, Yongquan [2 ]
机构
[1] Zagazig Univ, Fac Comp & Informat, Dept Operat Res, El Zera Sq, Zagazig, Egypt
[2] Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Peoples R China
关键词
flower pollination algorithm; meta-heuristics; combinatorial optimisation; NP-hard; optimisation; knapsack problems; PARTICLE SWARM OPTIMIZATION;
D O I
10.1504/IJBIC.2016.10004350
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The knapsack problem is one of the most studied combinatorial optimisation problems with various practical applications. In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard combinatorial optimisation problem. The performance of the proposed algorithm is tested against a set of benchmarks of knapsack problems. Computational experiments with a set of large-scale instances show that the EFPA can be an efficient alternative for solving 0-1 knapsack problems.
引用
收藏
页码:46 / 53
页数:8
相关论文
共 23 条
[1]  
[Anonymous], COMPUT DIGIT ENG
[2]  
[Anonymous], J INNER MONGOLIA NOR
[3]  
[Anonymous], 1998, COMBINATORIAL OPTIMI
[4]   A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model [J].
Bas, Esra .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (10) :12415-12422
[5]   A genetic algorithm for the multidimensional knapsack problem [J].
Chu, PC ;
Beasley, JE .
JOURNAL OF HEURISTICS, 1998, 4 (01) :63-86
[6]   RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS [J].
FAYARD, D ;
PLATEAU, G .
MATHEMATICAL PROGRAMMING, 1975, 8 (03) :272-307
[7]  
He Y. C., 2007, COMPUTER ENG DESIGN, V28, P2655
[8]  
Hembecker F, 2007, LECT NOTES COMPUT SC, V4431, P358
[9]  
Houck C., 1995, GENETIC ALGORITHM FU, V95
[10]   A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice [J].
Lee, KS ;
Geem, ZW .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2005, 194 (36-38) :3902-3933