Solving 0-1 Knapsack Problems by Binary Dragonfly Algorithm

被引：18

作者：

Abdel-Basset, Mohamed ^{[1
]}

Luo, Qifang ^{[2
,3
]}

Miao, Fahui ^{[2
]}

Zhou, Yongquan ^{[2
,3
]}

机构：

[1] Zagazig Univ, Fac Comp & Informat, Dept Operat Res, Zagazig, Egypt

[2] Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Peoples R China

[3] Guangxi High Sch, Key Lab Complex Syst & Computat Intelligence, Nanning 530006, Peoples R China

来源：

INTELLIGENT COMPUTING METHODOLOGIES, ICIC 2017, PT III | 2017年 / 10363卷

基金：

美国国家科学基金会;

关键词：

Dragonfly algorithm; Meta-heuristics; Combinatorial optimization; 0-1 knapsack problem; SEARCH ALGORITHM; CUCKOO SEARCH; OPTIMIZATION;

D O I：

10.1007/978-3-319-63315-2_43

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The 0-1 knapsack problem (0-1KP) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays significant roles in many real life applications. Dragonfly algorithm (DA) a novel swarm intelligence optimization algorithm, inspired by the nature of static and dynamic swarming behaviors of dragonflies. DA has demonstrated excellent performance in solving multimodal continuous problems and engineering optimization problems. This paper proposes a binary version of dragonfly algorithm (BDA) to solve 0-1 knapsack problem. Experimental results have proven the superior performance of BDA compared with other algorithms in literature.

引用

页码：491 / 502

页数：12

共 32 条

[1]

[Anonymous], 2016, INDONESIAN J ELECT E

[2] A Modified Binary Particle Swarm Optimization for Knapsack Problems [J].

Bansal, Jagdish Chand ;

Deep, Kusum .

APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (22) :11042-11061

[3] An Ant colony optimization approach for binary knapsack problem under fuzziness [J].

Changdar, C. ;

Mahapatra, G. S. ;

Pal, R. K. .

APPLIED MATHEMATICS AND COMPUTATION, 2013, 223 :243-253

[4]

Chaokun Yan, 2015, Advances in Swarm and Computational Intelligence. 6th International Conference, ICSI 2015 held in conjunction with the Second BRICS Congress, CCI 2015. Proceedings: LNCS 9141, P229, DOI 10.1007/978-3-319-20472-7_25

[5]

Cheng K, 2013, APPL RES COMPUT, V4, P009

[6] Greedy Strategy Based Self-adaption Ant Colony Algorithm for 0/1 Knapsack Problem [J].

Du, De-peng ;

Zu, Yue-ran .

UBIQUITOUS COMPUTING APPLICATION AND WIRELESS SENSOR, 2015, 331 :663-670

[7] An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems [J].

Feng, Yanhong ;

Jia, Ke ;

He, Yichao .

COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2014, 2014

[8] Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm [J].

Gherboudj, Amira ;

Layeb, Abdesslem ;

Chikhi, Salim .

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2012, 4 (04) :229-236

[9] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem [J].

Gong, Qiaoqiao ;

Zhou, Yongquan ;

Yang, Yan .

SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 :166-171

[10]

Gupta M., 2013, INT J DIGITAL APPL C, V1, P1

← 1 2 3 4 →