Title: Comparing several heuristics for a packing problem
Authors: Camelia-M. Pintea; Cristian Pascan; Mara Hajdu-Măcelaru
Addresses: Technical University of Cluj Napoca, North University Centre, 430122 Baia Mare, Romania ' SoftVision, 52 George Cosbuc, 430032 Baia Mare, Romania ' Technical University of Cluj Napoca, North University Centre, 430122 Baia Mare, Romania
Abstract: Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algorithm with a hybrid genetic algorithm in order to see which technique is better for the given problem. The algorithms are tested on different sizes data.
Keywords: packing problems; genetic algorithms; hybridisation; 2D bin packing; greedy algorithms.
International Journal of Advanced Intelligence Paradigms, 2012 Vol.4 No.3/4, pp.268 - 277
Published online: 23 Aug 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article