A Parallel Solution for The 0-1 Knapsack Problem Using Firefly Algorithm

被引：0

作者：

Hoseini, Farnaz ^{[1
]}

Shahbahrami, Asadollah ^{[2
]}

Hajarian, Mohammad ^{[3
]}

机构：

[1] Islamic Azad Univ, Rasht Branch, Fac Engn, Rasht, Iran

[2] Univ Guilan, Fac Engn, Dept Comp Engn, Rasht, Iran

[3] Islamic Azad Univ, Karaj Branch, Dept Comp Engn, Karaj, Iran

来源：

2016 1ST CONFERENCE ON SWARM INTELLIGENCE AND EVOLUTIONARY COMPUTATION (CSIEC 2016) | 2016年

关键词：

Firefly Algorithm; Knapsack Problem; the 0-1 Knapsack Problem CUDA; GPU; Parallel Processing; OPTIMIZATION;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The knapsack problem is known as a NP-hard problem. There is a dynamic programming solution for this problem which is called the 0-1 knapsack. Firefly's innovative optimization algorithm is an algorithm, inspired by the behavior of fireflies flashing. This study represents a parallel solution for the 0-1 knapsack problem using firefly algorithm. Regarding parallel nature of most optimization algorithms they can be used successfully in a graphical processing unit (GPU). Since it is time consuming to test all the cases, when increasing the items and iterations, Compute Unified Device Architecture (CUDA) is used to implement the solution in a parallel way. The results of simulating the 0-1 knapsack problem using firefly algorithm on GPU hardware showed that the execution time of this method in a parallel way decreases with the increase of the population of fireflies and it is 320 times faster than serial solution and this rate is because of synchrony in execution of the blocks on GPU hardware.

引用

页码：25 / 30

页数：6

共 50 条

[31] The quadratic 0-1 knapsack problem with series-parallel support
Rader, DJ
Woeginger, GJ
OPERATIONS RESEARCH LETTERS, 2002, 30 (03) : 159 - 166
[32] Parallel programming in SRVRT: A case study of 0-1 Knapsack Problem
Wan, JY
Xue, JY
COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY, 2001, : 470 - 473
[33] Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem
Dantas, Bianca de Almeida
Caceres, Edson Norberto
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 : 2739 - 2743
[34] THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM A New Heuristic Algorithm Combined with 0-1 Linear Programming
Csebfalvi, Aniko
Csebfalvi, Gyorgy
ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, : 203 - 207
[35] Solving the 0-1 Knapsack Problem Using Genetic Algorithm and Rough Set Theory
Pradhani, Tribikram
Israni, Akash
Sharma, Manish
2014 INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2014, : 1120 - 1125
[36] Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
El Baz, D
Elkihel, M
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (01) : 74 - 84
[37] On exact solution approaches for bilevel quadratic 0-1 knapsack problem
Zenarosa, Gabriel Lopez
Prokopyev, Oleg A.
Pasiliao, Eduardo L.
ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 555 - 572
[38] Approximate and exact solution methods for the hyperbolic 0-1 knapsack problem
Billionnet, A
INFOR, 2002, 40 (02) : 97 - 110
[39] Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem
Wang, Zhengyuan
Zhang, Hui
Li, Yali
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
[40] Molecular solution to the 0-1 knapsack problem based on DNA computing
Darehmiraki, Majid
Nehi, Hasan Mishmast
APPLIED MATHEMATICS AND COMPUTATION, 2007, 187 (02) : 1033 - 1037

← 1 2 3 4 5 →