A Maximal-Space Algorithm for the Container Loading Problem

A Maximal-Space Algorithm for the Container Loading Problem

0.00 Avg rating0 Votes
Article ID: iaor200952625
Country: United States
Volume: 20
Issue: 3
Start Page Number: 412
End Page Number: 422
Publication Date: Jun 2008
Journal: INFORMS Journal On Computing
Authors: , , ,
Keywords: containers, packing
Abstract:

In this paper, a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal space, a nondisjoint representation of the free space in a container.

Reviews

Required fields are marked *. Your email address will not be published.