Paper
22 November 2022 Heuristic search algorithm for three-dimensional packing problem
Zhihu Mei, Zhibo Tang
Author Affiliations +
Proceedings Volume 12475, Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022); 124751R (2022) https://doi.org/10.1117/12.2659334
Event: Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022), 2022, Hulun Buir, China
Abstract
Container loading is an important step in the process of cargo transportation and belongs to the NP-hard problem. All different sizes of containers are loaded into different sizes of containers and the space utilization of containers is maximized. In this paper, we mainly study the loading layout of a single container, and establish a mathematical model with the volume, load capacity, cargo direction and stability of the container as constraints and the utilization rate of container space as the final goal. Space partitioning, simple block generation heuristic algorithm and depth-first search algorithm are used to solve the model. The feasibility and applicability of the algorithm were verified by specific cargo data. The average volume utilization rate of three foreign trade containers is higher than 89%, which achieves the ideal crating effect and proves the effectiveness and feasibility of the algorithm.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhihu Mei and Zhibo Tang "Heuristic search algorithm for three-dimensional packing problem", Proc. SPIE 12475, Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022), 124751R (22 November 2022); https://doi.org/10.1117/12.2659334
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Mathematical modeling

Packaging

Computer programming

Computer programming languages

MATLAB

3D modeling

Algorithm development

RELATED CONTENT


Back to Top