A GAN-based genetic algorithm for solving the 3D bin packing problem

Boliang Zhang, Yu Yao, H. K. Kan, Wuman Luo

Research output: Contribution to journalArticlepeer-review


The 3D bin packing problem is a challenging combinatorial optimization problem with numerous real-world applications. In this paper, we present a novel approach for solving this problem by integrating a generative adversarial network (GAN) with a genetic algorithm (GA). Our proposed GAN-based GA utilizes the GAN to generate high-quality solutions and improve the exploration and exploitation capabilities of the GA. We evaluate the performance of the proposed algorithm on a set of benchmark instances and compare it with two existing algorithms. The simulation studies demonstrate that our proposed algorithm outperforms both existing algorithms in terms of the number of used bins while achieving comparable computation times. Our proposed algorithm also performs well in terms of solution quality and runtime on instances of different sizes and shapes. We conduct sensitivity analysis and parameter tuning simulations to determine the optimal values for the key parameters of the proposed algorithm. Our results indicate that the proposed algorithm is robust and effective in solving the 3D bin packing problem. The proposed GAN-based GA algorithm and its modifications can be applied to other optimization problems. Our research contributes to the development of efficient and effective algorithms for solving complex optimization problems, particularly in the context of logistics and manufacturing. In summary, the proposed algorithm represents a promising solution to the challenging 3D bin packing problem and has the potential to advance the state-of-the-art in combinatorial optimization.

Original languageEnglish
Article number7775
JournalScientific Reports
Issue number1
Publication statusPublished - Dec 2024


Dive into the research topics of 'A GAN-based genetic algorithm for solving the 3D bin packing problem'. Together they form a unique fingerprint.

Cite this