dc.description.abstract | In recent years, with the rise of Industry 4.0, there has been a revolutionary development in various aspects such as digital technology, automated machinery for loading and unloading, smart manufacturing, and the application of the Internet of Things (IoT). These advancements have not only led to significant growth in different industries but have also effectively improved production efficiency and reduced costs. The primary goal of Industry 4.0 is to integrate manufacturing resources, data, and processes to establish a more flexible and intelligent manufacturing industry. In this process, the critical process of product packaging and shipping has become crucial. A well-optimized arrangement during the packing of goods can lead to highly efficient utilization of loading space. This not only conserves the quantity of tools for carrying goods, such as pallets, containers, and trucks, but also reduces the time and labor costs associated with repetitive placement attempts.
This paper applies image processing technology to identify box sizes for the purpose of automated categorization of various types of boxes. It conducts packing computations for boxes of different sizes and quantities using traditional trial-and-error method, greedy algorithm, and depth-first search algorithm. By comparing the differences in computation results and analyzing the strengths and weaknesses of these three methods in practical applications, the heuristic greedy algorithm is ultimately chosen for subsequent experimental applications involving packing constraint conditions. To better align with practical requirements, this study introduces conditions involving weight limits, base area limits, and position constraints in the packing calculation. The experiments involve loading mechanical parts from production into boxes, stacking them onto pallets, and finally loading the pallets and goods into containers. Considering various safety requirements, the experiments are conducted with different individual and combined constraint conditions. The more constraint conditions are added, the more the efficiency of space utilization is reduced.
In this study, we utilized the Python programming language to write code. During the experiments, we employed the Matplotlib toolbox, specifically mplot3d, to visualize the results of the packing computations in three-dimensional graphs for observation purposes. Additionally, the program simultaneously recorded the execution results into a CSV file during the packing computation process. After the computation concluded, the results can be viewed by opening the CSV file in Excel to examine the packing outcome data. Comparing the results obtained by the heuristic greedy algorithm employed in this study with those obtained by the traditional trial-and-error method for solving the three-dimensional bin packing problem, it was found that the heuristic approach saved up to approximately 16.20% of available space. | en_US |