Bin-packing using genetic algorithms

We present in this paper a genetic algorithm (GA) approach to solve 2D bin packing problems of polygonal shapes on a rectangular canvas. We present the way to encode shape parameters and a fitness function based on a the medial axis transform (MAT) to evaluate individuals of a genetic algorithm population. Some test and results of our experimentation are presented.

[1]  Hitoshi Iima,et al.  A new design of genetic algorithm for bin packing , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[3]  Souran Manoochehri,et al.  Optimal packing using the multiple mating method , 2003, Engineering with Computers.

[4]  Wang Chunxi,et al.  Neural algorithms of two-dimensional packing , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[5]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[6]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[7]  R. P. Pargas,et al.  A parallel stochastic optimization algorithm for solving 2D bin packing problems , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[8]  J. O. Berkey.  Massively parallel computing applied to the one-dimensional bin packing problem , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.