A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Computers and Operations Research
An AI approach for optimizing multi-pallet loading operations
Expert Systems with Applications: An International Journal
Neighborhood structures for the container loading problem: a VNS implementation
Journal of Heuristics
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
A caving degree based flake arrangement approach for the container loading problem
Computers and Industrial Engineering
An efficient placement heuristic for three-dimensional rectangular packing
Computers and Operations Research
A novel hybrid tabu search approach to container loading
Computers and Operations Research
A hybrid 'bee(s) algorithm' for solving container loading problems
Applied Soft Computing
Three-dimensional container loading models with cargo stability and load bearing constraints
Computers and Operations Research
A parallel multi-population biased random-key genetic algorithm for a container loading problem
Computers and Operations Research
A heuristic for the multiple container loading cost minimization problem
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Expert Systems with Applications: An International Journal
A priority-considering approach for the multiple container loading problem
International Journal of Metaheuristics
A heuristic block-loading algorithm based on multi-layer search for the container loading problem
Computers and Operations Research
Packing first, routing second-a heuristic for the vehicle routing and loading problem
Computers and Operations Research
A multi-methodology agent-based approach for container loading
Proceedings of the Winter Simulation Conference
Journal of Mathematical Modelling and Algorithms
Local search for a multi-drop multi-container loading problem
Journal of Heuristics
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Computers and Operations Research
A beam search approach to the container loading problem
Computers and Operations Research
Hi-index | 0.00 |
In this article, the authors present GRModGrasp, a new GRASP (greedy randomized adaptive search procedure) algorithm for the single container-loading problem. The CLP aims to pack a set of boxes into a container, minimizing wasted space and satisfying other constraints related to the physical loading and transportation of the boxes. This GRASP algorithm, based on a wall-building constructive heuristic, aims to achieve high levels of cargo stability without compromising the container volume use. The authors evaluated GRModGrasp's performance both in terms of volume use and load stability and compared it with nine well-known algorithms. No other approaches can produce solutions that are simultaneously better in terms of volume use and better cargo stability.This article is part of a special issue on advanced heuristics in transportation and logistics.