A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU

Creative Commons License

Ozcan S. O. , Dokeroglu T., COŞAR A., YAZICI A.

31st International Symposium on Computer and Information Sciences (ISCIS), Krakow, Poland, 27 - 28 October 2016, vol.659, pp.52-60 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 659
  • Doi Number: 10.1007/978-3-319-47217-1_6
  • City: Krakow
  • Country: Poland
  • Page Numbers: pp.52-60
  • Keywords: 1D Bin packing, Grouping genetic, CUDA, GPU, OPTIMIZATION
  • Middle East Technical University Affiliated: Yes


One-dimensional Bin Packing Problem (1D-BPP) is a challenging NP-Hard combinatorial problem which is used to pack finite number of items into minimum number of bins. Large problem instances of the 1D-BPP cannot be solved exactly due to the intractable nature of the problem. In this study, we propose an efficient Grouping Genetic Algorithm (GGA) by harnessing the power of the Graphics Processing Unit (GPU) using CUDA. The time consuming crossover and mutation processes of the GGA are executed on the GPU by increasing the evaluation times significantly. The obtained experimental results on 1,238 benchmark 1D-BPP instances show that our proposed algorithm has a high performance and is a scalable algorithm with its high speed fitness evaluation ability. Our proposed algorithm can be considered as one of the best performing algorithms with its 66 times faster computation speed that enables to explore the search space more effectively than any of its counterparts.