An efficient method for the three-dimensional container loading problem by forming box sizes

The container loading problem (CLP) has been studied for maximising container space utilization as a method of lowering costs and increasing supply chain efficiency. This paper presents an approach to the CLP, in which a container is to be filled with a selection of cargoes from an available set so that the volume utilization of the container is maximized. By minimizing the outer volume of all the cargoes placed, tight arrangement of the cargoes can be achieved. Genetic algorithm (GA) with adaptive chromosome length formation has been used to find the optimum solution for the arranged cargoes to be placed with minimum space utilization. Two experiments have been conducted, to simulate the space optimization with fixed and unfixed number of cargoes. Our findings show that the GA with adaptive chromosome length proposes better arrangements of cargoes to give optimum space utilization for the container with 93.4% fitness difference percentage than the first generation’s fitness value.KeywordsSpace optimizationContainer loading problemGenetic algorithm

This paper presents a tree search algorithm for the three-dimensional container loading problem (3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the packing volume is maximized. The method includes two variants: the full-support variant guarantees full support from below for all packed boxes, although this constraint is not taken into account by the nonsupport variant. The guillotine cut constraint is considered by both variants. The method is mainly based on two concepts. On the one hand, the block building approach is generalized. Not only are blocks of identical boxes in the same spatial orientation applied but also blocks of different boxes with small inner gaps. On the other hand, the tree search is carried out in a special fashion called a partition-controlled tree search. This makes the search both efficient and diverse, enabling a sufficient search width as well as a suitable degree of foresight. The approach achieves excellent results for the well-known 3D-CLP instances suggested by Bischoff and Ratcliff [Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23(4) 377–390] with reasonable computing time.

The correct layout of goods, objects or cargo, in the container's available space is considered a complex task. The study was motivated by the need to implement a solution to optimise container use in a steel industry company in the South of Brazil. This article has contributed to synthesising research on the three-dimensional container loading problem, highlighting classifications, constraints, and algorithms used in its resolution. A framework is presented and may be used as a road map for practical implementation as used in this research. As a practical contribution, this article presents several instances of one actual case application. Results showed reducing of formatting loads processing time in comparison with the traditional company approach.

The multiple container loading problem with preference

This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of caving degree (CD) algorithm and variable neighborhood descent (VND) algorithm. More precisely, the first constructive phase is based on a caving degree (CD) heuristic developed for the single container loading problem. In the second improvement phase, four new moves are designed and combined in a VND structure. The resulting hybrid CD/VND algorithm is simple and quite fast and the extensive computational results on test instances from the literature show that the quality of the solutions is equal to or better than that obtained by the best existing heuristic procedures.

The paper presents a genetic algorithm (GA) for the container loading problem. The main ideas of the approach are first to generate a set of disjunctive box towers and second to arrange the box towers on the floor of the container according to a given optimization criterion. The loading problem may include different practical constraints. The performance of the GA is demonstrated by a numerical test comparing the GA and several other procedures for the container loading problem.

Container loading problem is a kind of constrained three-dimensional bin packing problem in transportation industry. Container loading problem is complex combinatorial optimization problem, and the problem is NP-hard. The multiple container loading problem considered in this paper considered loading multiple containers simultaneously. In the problem the cargoes loaded are strongly heterogeneous cargoes. According to the complexity and the characters of multiple container problem as knapsack loading problem with strongly heterogeneous cargoes, scatter search algorithm is designed to solve the problem. Scatter search is a kind of metaheuristic algorithm based on population evolution which has been successfully applied in many fields of combinatorial optimization. Multiple neighborhood structures are used in the proposed scatter search algorithm, so the search effective of the algorithm and the quality of the obtained solutions can be improved. The simulations based on ample numerical examples show the effectiveness of the algorithm.

Constraints in container loading – A state-of-the-art review

Container loading problem (CLP) is a major problem for logistics in distributing cargoes to customers. As cost and time savings are important in shipping management, the process of cargo handling is essential. Cargoes must be effectively packed into a container. This paper, therefore, proposes container loading problem solving using a strategy for positioning non placement heuristics to reduce space between different buildings. Particle Swarm Optimization (PSO) is used to select the orientation of boxes to be packed into a single container to minimize the space which simulated in 3D. The condition for this solution is packing must be placed within the container with no part of the box overhanging the container, and the boxes must be placed parallel to the container surface area or other boxes. Weight and orientation of the box condition are also considered. The experiments are 12 cases. Different sizes of boxes and different sizes of containers are used. The experimental results are satisfied and it can be concluded that varied sizes of boxes are applicable for the space utilization in the container.

This article presents PackageCargo. A modular open-source application developed using the Unity game engine to calculate, visualize, and save efficient packing patterns to instances of the Container Loading Problem (CLP). The packing patterns are obtained through approximate optimization algorithms (metaheuristics). Additionally, the proposed tool allows us to estimate cargo stability metrics through the implementation of mathematical models and verify the results of said models using a simulation environment built with the PhysX library. The goal of this application was to create a usable decision support system suitable for industrial purposes as well as a platform for academic research. It is offering a modifiable framework that can adapt to the necessities of its users, saving them software development time while continuing to extend PackageCargo through community contributions. The resulting application was compared with commercial software solutions. Furthermore, each module was tested using the most successful approaches found in literature as benchmarks. The packing module was compared against the top-performing algorithm published to date, obtaining similar results in similar computational times. The simulation module for cargo stability was benchmarked against high-performance simulation software, validating its accuracy and performance. Accordingly, PackageCargo was found to have a competitive feature set useful in both academic and commercial settings. As future work, it is proposed to combine the different modules to solve more sophisticated variants of the CLP, like the container loading problem constrained to weight distribution profiles.

A caving degree approach for the single container loading problem

Formal methodologies and tools for decision support systems – An editorial

The paper discusses the complexities of the air cargo loading problem and provides an effective approach based on the proposed heuristic to tackle the problem. The primitive class of problems like general bin packing, cutting stock and knapsack problems can be taken as the basic step towards the air-cargo loading problem. The discussed problem is very different in its nature in respect to the general pallet, container or truck loading problem. Generally, the container loading problems consider only the rectangular type of containers to load the items whereas in case of air-cargos, the shape of containers are very different such as irregular pentagon, hexagon etc. Apart from this, the objective of air cargo loading problem discussed in this paper is based on the minimization of the shipping cost of the container keeping in mind the number of constraints involved in loading. In past research literatures, most of the container loading problems are aimed to pack the container in such a way so that either the number of containers is minimized or the volume of the packed items are maximized. In this paper the objective function includes the shipment cost as the primary goal and the volume and weight of the containers are taken as constraints. A very interesting finding can be noticed in this paper which states that even if the container's volume is properly utilized the cost of shipment may be increased.

This paper suggests a methodology for tackling container loading problem by using a Q-learning technique. One of the important issues for the efficient operation of container loading problem is to find software that can determine the order in which the containers are to be arranged in order to speed up the process. However, the efficient way to arrange containers involves new and specialized logistic process, a number of logistics plan and automated system to handle a great number of containers. This study proposes a method for maximizing the load of container and consequently minimizing the waste of space.

Heuristic algorithm for the container loading problem with multiple constraints