|
Litvinchev, Pankratov & Romanova (2019)
|
Open size single bin type 3D bin packing problem |
The problem is formulated using the phi function technique, which utilizes an analytical description of the relationship between irregular objects. The modeling approach involves formulating the problem as a nonlinear programming problem. However, it should be noted that the assumption made in the model, where each object is approximated by a polyhedron, may not precisely capture the exact shape of the real objects involved. |
|
Que, Yang & Zhang (2023)
|
Open size single bin type 3D bin packing problem |
The DRL model utilizes the Transformer architecture as a policy network and is trained through a neighborhood policy optimization algorithm. However, there are certain drawbacks associated with DRL. Firstly, DRL necessitates a substantial amount of problem instances for effective training. Secondly, the performance of the model is influenced by both the quality and quantity of data available for training. |
|
Tsai, Wang & Lin (2015)
|
3D bin packing problem for open size multiple-bin types |
The 3D-ODRPP is converted into a hybrid integer linear programming problem to effectively address the challenge of finding optimal solutions for the 3D open-dimensional rectangular packing problem. However, it should be noted that the proposed model exhibits a high level of complexity, leading to long computation times. |
| This article |
3D bin packing problem for open size multiple-bin types |
A 3D-MODRPP hybrid integer planning model is developed that allows for the existence of multiple open dimensions with different lengths, widths, and height dimension fetches based on the 3D-ODRPP problem Tsai, Wang & Lin (2015). A new 0–1 integer variable assumption method is proposed to reduce the model complexity and computation time. |
