.png){kind=icon}
Return
A tree search algorithm for the container loading problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.05.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a binary tree search algorithm for the three dimensional container loading problem (3D-CLP). The 3D-CLP is about how to load a subset of a given set of rectangular boxes into a rectangular container, such that the packing volume is maximized. In this algorithm, all the boxes are grouped into strips and layers while three constraints, i.e., full support constraint, orientation constraint and guillotine cutting constraint are satisfied. A binary tree is created where each tree node denotes a container loading plan. For a non-root each node, the layer set of its left (or right) child is obtained by inserting a directed layer into its layer set. A directed layer is parallel (or perpendicular) to the left side of the container. Each leaf node denotes a complete container loading plan. The solution is the layer set whose total volume of the boxes is the greatest among all tree nodes. The proposed algorithm achieves good results for the well-known 3D-CLP instances suggested by Bischoff and Ratcliff with reasonable computing time. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Packing
Container loading
Heuristic algorithm
Tree search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveOn the Impact of Formative Assessment on Student Motivation, Achievement, and Conceptual Change
PREAI
ShareSaveShareSave View more