Comparing several heuristics for a packing problem
Neural and Evolutionary Computing
2020-07-28 v1
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.
Cite
@article{arxiv.1210.4502,
title = {Comparing several heuristics for a packing problem},
author = {Camelia-M. Pintea and Cristian Pascan and Mara Hajdu-Macelaru},
journal= {arXiv preprint arXiv:1210.4502},
year = {2020}
}
Comments
5 figures, 2 tables; accepted: International Journal of Advanced Intelligence Paradigms