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 条
  • [21] The fully polynomial approximation algorithm for the 0-1 knapsack problem
    Liu, YJ
    THEORY OF COMPUTING SYSTEMS, 2002, 35 (05) : 559 - 564
  • [22] Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem
    Rezoug, Abdellah
    Boughaci, Dalila
    Badr-El-Den, Mohamed
    PROGRESS IN ARTIFICIAL INTELLIGENCE-BK, 2015, 9273 : 298 - 304
  • [23] A new artificial immune algorithm for the 0-1 Knapsack Problem
    Jin, XY
    Du, HF
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS 1 AND 2, 2004, : 8 - 12
  • [24] Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
    Kumar, Rajeev
    Banerjee, Nilanjan
    THEORETICAL COMPUTER SCIENCE, 2006, 358 (01) : 104 - 120
  • [25] An improved genetic algorithm for the multiconstrained 0-1 Knapsack Problem
    Raidl, GR
    1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 207 - 211
  • [26] A New Immune Genetic Algorithm for 0-1 Knapsack Problem
    Jin, Zongxin
    Fan, Hongjuan
    2013 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 1, 2013, : 31 - 33
  • [27] Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem
    Tsai, Sientang
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 416 - 427
  • [28] A Novel Bat algorithm of solving 0-1 Knapsack Problem
    Chen, Yanfeng
    PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY, 2016, 60 : 1598 - 1601
  • [29] Reoptimizing the 0-1 knapsack problem
    Archetti, Claudia
    Bertazzi, Luca
    Speranza, M. Grazia
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (17) : 1879 - 1887
  • [30] COLLAPSING 0-1 KNAPSACK PROBLEM
    POSNER, ME
    GUIGNARD, M
    MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 155 - 161
12345