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 条
  • [41] Solution to the 0-1 Multidimensional Knapsack Problem Based on DNA Computation
    Wu, Kee-Rong
    Yeh, Chung-Wei
    INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS II, PTS 1-3, 2011, 58-60 : 1767 - +
  • [42] A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem
    Liu, Yan
    Liu, Chao
    IACSIT-SC 2009: INTERNATIONAL ASSOCIATION OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY - SPRING CONFERENCE, 2009, : 160 - 164
  • [43] A HEURISTIC ALGORITHM BASED ON EXPECTATION EFFICIENCY FOR 0-1 KNAPSACK PROBLEM
    Zhang, Lingling
    Lv, Jianhui
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2018, 14 (05): : 1833 - 1854
  • [44] Binary salp swarm algorithm for discounted {0-1} knapsack problem
    Binh Thanh Dang
    Tung Khac Truong
    PLOS ONE, 2022, 17 (04):
  • [45] An exact algorithm for the two-constraint 0-1 knapsack problem
    Martello, S
    Toth, P
    OPERATIONS RESEARCH, 2003, 51 (05) : 826 - 835
  • [46] Genetic algorithm based on Greedy strategy in the 0-1 Knapsack Problem
    Zhao, JiangFei
    Huang, Tinglei
    Pang, Fei
    Liu, YuanJie
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 105 - 107
  • [47] A Distributed Algorithm for 0-1 Knapsack Problem Based on Mobile Agent
    Qiao Shanping
    Wang Shixian
    Lin Yongzheng
    Zhao Ling
    ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, PROCEEDINGS, 2008, : 208 - 212
  • [48] An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem
    Sundar, Shyam
    Singh, Alok
    Rossi, Andre
    CONTEMPORARY COMPUTING, PT 1, 2010, 94 : 141 - +
  • [49] An expanding-core algorithm for the exact 0-1 Knapsack Problem
    Univ. Copenhagen, dep. computer sci., Copenhagen, Denmark
    Eur J Oper Res, 1 (175-187):
  • [50] An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem
    Salami, Hamza Onoruoiza
    Bala, Abubakar
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2022, 19 (04) : 253 - 266
12345