This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A GRASP Approach to the Container-Loading Problem
July/August 2005 (vol. 20 no. 4)
pp. 50-57
Ana Moura, Escola Superior de Tecnologia e Gestao, Braganca, and Instituto de Engenharia de Sistemas e Computadores do Porto
Jos? Fernando Oliveira, Faculdade de Engenharia da Universidade do Porto and Instituto de Engenharia de Sistemas e Computadores do Porto
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.

Index Terms:
container-loading problem, GRASP (greedy randomized adaptive search procedure), cargo stability
Citation:
Ana Moura, Jos? Fernando Oliveira, "A GRASP Approach to the Container-Loading Problem," IEEE Intelligent Systems, vol. 20, no. 4, pp. 50-57, July-Aug. 2005, doi:10.1109/MIS.2005.57
Usage of this product signifies your acceptance of the Terms of Use.