Considerations on using genetic algorithms for the 2D bin packing problem: A general model and detected difficulties

The 2-dimensional bin packing problem appears in various fields across many industries such as wood, glass, or paper industries. They may differ in terms of specific constraints with respects to each area but they all share a common objective that is to maximize the material utilization. Belonging to the class of NP-Hard problems, there exist no efficient method to solve it, but only approximate solution by combining a greedy placement strategy with some optimization techniques such as Genetic Algorithms. That combination approach is very popular in this topic, but few researchers have clearly presented their method and no one has explained the difficulty of applying Genetic Algorithms to this problem, making it difficult for new researchers to reimplement the known algorithms. In this paper, in addition to proposing a general framework for applying Genetic Algorithms to solving this problem, we also identify the main difficulties of using this approach and propose 2 genetic operators, path recombination and hill-climbing mutation, to support our genetic model.

[1]  Oguz Findik,et al.  A directed artificial bee colony algorithm , 2015, Appl. Soft Comput..

[2]  Karim Faez,et al.  Adaptive image steganography based on transform domain via genetic algorithm , 2017 .

[3]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Rafael Stanley Nunez Cruz,et al.  Efficient mechanical design and limit cycle stability for a humanoid robot: An application of genetic algorithms , 2017, Neurocomputing.

[6]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[7]  Doina Logofatu,et al.  Considerations on 2D-Bin Packing Problem: Is the Order of Placement a Relevant Factor? , 2017, SIMULTECH.

[8]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[9]  Duarte Nuno Gonçalves Ferreira.  Rectangular Bin-Packing Problem: a computational evaluation of 4 heuristics algorithms , 2017 .

[10]  Helder A. Pereira,et al.  Wavelength Assignment for Physical-Layer-Impaired Optical Networks Using Evolutionary Computation , 2011, IEEE/OSA Journal of Optical Communications and Networking.

[11]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

[12]  Stefan Preitl,et al.  Novel Adaptive Charged System Search algorithm for optimal tuning of fuzzy controllers , 2014, Expert Syst. Appl..

[13]  Joseph O'Rourke,et al.  Finding minimal enclosing boxes , 1985, International Journal of Computer & Information Sciences.

[14]  J. A. Bennell,et al.  50 years of irregular shape packing problems: a tutorial , 2008 .

[15]  Ajalmar R. da Rocha Neto,et al.  A new pruning method for extreme learning machines via genetic algorithms , 2016, Appl. Soft Comput..

[16]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .