A new heuristic embedded approach for multi-constraint air-cargo loading problem

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.

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.

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.

Packing problems deal with loading of a set of items (objects) into a set of boxes (containers) in order to optimize a performance criterion under various constraints. With the advance of RFID technologies and investments in IT infrastructures companies now have access to the necessary data that can be utilized in cost reduction of packing processes. Therefore bin packing and container loading problems are becoming more popular in recent years. In this research we propose a beam search algorithm to solve a packing problem that we encountered in a real world project. The 3D-MBSBPP (Multiple Bin Sized Bin Packing Problem) that we present and solve has not been analyzed in literature before, to the best of our knowledge. We present the performance of our proposed beam search algorithm in terms of both cost and computational time in comparison to a greedy algorithm and a tree search enumeration 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

This study focuses on a real-world case that is defined as an extension of the container loading problem (CLP) with weakly heterogeneous types of boxes. A company producing plastic cups wants to increase its efficiency in container loading operations. To solve the problem, a hybrid approach including a static rule to rank orders and integer nonlinear programming (INLP) models is developed. INLP models form box sizes according to the properties of the cups, and determine the position of the boxes in layers while simultaneously minimizing the layer-depth. The presented approach is tested on real-world cases and benchmark data sets. The results show that simultaneously forming boxes and solving the CLP increases the effectiveness of container loading operations.

Formal methodologies and tools for decision support systems – An editorial

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.

In this work, it is presented an exact method to solve the Single Container Loading Problem, which aims at deciding which items should be packed into the container in order to attain the maximum loaded value. The method is derived from the resolution of integer and constraint programming models. One of the integer programming models is a relaxation for the three-dimensional packing problem related to arranging items into the container. Besides that, it is measured how constraints related to priority conditions and vertical and horizontal load cargo stability can impact on the solution. Instances from the literature are solved in order to assess the method behavior in relation to the occupied volume and runtime. It has been observed that the highest volume losses have happened when the priority conditions are taken into consideration, while the runtime has increased when the vertical and horizontal stability constraints are considered.

Heuristic algorithm for the container loading problem with multiple constraints

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach