15520

Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture

Qadha’a AlEnezi, Hosam AboElFotoh, Bader AlBdaiwi, Mohammad Ali AlMulla
Computer Science Department, Kuwait University, Kuwait
arXiv:1602.08735 [cs.DC], (28 Feb 2016)

@article{alenezi2016heuristics,

   title={Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture},

   author={AlEnezi, Qadha’a and AboElFotoh, Hosam and AlBdaiwi, Bader and AlMulla, Mohammad Ali},

   year={2016},

   month={feb},

   archivePrefix={"arXiv"},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

574

views

The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, the objective is to minimize the total size of the used bins. This problem is known to be NP-hard. In this article, we present two new heuristics for solving the problem using a new variation of P systems with active membranes, which we call a Hybrid P-system, implemented in CUDA. We examine the performance of the two heuristics, and compare the results with those of other known algorithms. The numerical results show that good solutions for large instances (10000 items) of this problem could be obtained in a very short time (seconds) using our CUDA simulator.
Rating: 2.5. From 7 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: