Container packing in a multi-customer delivering operation
Proceedings of the 23rd international conference on on Computers and industrial engineering
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
SIAM Journal on Computing
The Three-Dimensional Bin Packing Problem
Operations Research
A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
A container packing support system for determining and visualizing container packing patterns
Decision Support Systems
3-D Container Packing Heuristics
Applied Intelligence
A GRASP Approach to the Container-Loading Problem
IEEE Intelligent Systems
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
A Maximal-Space Algorithm for the Container Loading Problem
INFORMS Journal on Computing
Neighborhood structures for the container loading problem: a VNS implementation
Journal of Heuristics
A study of optimal system for multiple-constraint multiple-container packing problems
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Computers and Operations Research
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
Hi-index | 0.01 |
Mathematical models for the problem of loading rectangular boxes into containers, trucks or railway cars have been proposed in the literature, however, there is a lack of studies which consider realistic constraints that often arise in practice. In this paper, we present mixed integer linear programming models for the container loading problem that consider the vertical and horizontal stability of the cargo and the load bearing strength of the cargo (including fragility). The models can also be used for loading rectangular boxes on pallets where the boxes do not need to be arranged in horizontal layers on the pallet. A comprehensive performance analysis using optimization software with 100s of randomly generated instances is presented. The computational results validate the models and show that they are able to handle only problems of a moderate size. However, these models might be useful to motivate future research exploring other solution approaches to solve this problem, such as decomposition methods, relaxation methods, heuristics, among others.