Hybrid Genetic Algorithm for Solving 3D Bin Packing Problem with Variable Size

XU Jiang, WANG Hang, ZHOU Yanjie, FENG Xuehao

Packaging Engineering ›› 2024 ›› Issue (13) : 259-267.

PDF(592 KB)
PDF(592 KB)
Packaging Engineering ›› 2024 ›› Issue (13) : 259-267. DOI: 10.19554/j.cnki.1001-3563.2024.13.030

Hybrid Genetic Algorithm for Solving 3D Bin Packing Problem with Variable Size

  • XU Jiang1, WANG Hang1, ZHOU Yanjie1, FENG Xuehao2
Author information +
History +

Abstract

The work aims to propose a package loading scheme that allows the cargo to change size on the premise of constant volume, to solve the problem of fresh packaging and loading optimization in cold chain transportation, and maximize the space utilization rate of containers. A nonlinear mixed integer programming model was proposed to formulate the varietal package packing problem. To solve the nonlinear mixed integer programming model by solvers including CPLEX or Lingo, the internalization method was adopted to linearize the nonlinear integer programming model. Due to the NP-hardness of the studied problem, CPLEX or LINGO could not solve large-scale problems. An algorithm which effectively combined genetic algorithm and deepest bottom left with fill (DBLF) was designed. The experimental results of large and small scale examples showed that the hybrid genetic algorithm could obtain the optimal solution or approximate optimal solution in a reasonable time, which verified the performance of the algorithm. The proposed variable-size package scheme effectively improves the loading rate and could benefit both customers and the express delivery company.

Cite this article

Download Citations
XU Jiang, WANG Hang, ZHOU Yanjie, FENG Xuehao. Hybrid Genetic Algorithm for Solving 3D Bin Packing Problem with Variable Size[J]. Packaging Engineering. 2024(13): 259-267 https://doi.org/10.19554/j.cnki.1001-3563.2024.13.030
PDF(592 KB)

Accesses

Citation

Detail

Sections
Recommended

/