A GRASP Approach to the Container-Loading Problem
- 8 August 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Intelligent Systems
- Vol. 20 (4) , 50-57
Abstract
The container-loading problem aims to determine the arrangement of items in a container. We present GRMODGRASP, a new algorithm for the CLP based on the GRASP (greedy randomized adaptive search procedure) paradigm. We evaluate GRMODGRASP'S performance in terms of volume use and load stability and by comparing it with nine well-known algorithms. Our approach produces solutions that surpass other approaches' solutions in terms of volume use and cargo stability.Keywords
This publication has 12 references indexed in Scilit:
- A parallel tabu search algorithm for solving the container loading problemParallel Computing, 2003
- Solving container loading problems by block arrangementEuropean Journal of Operational Research, 2002
- A Parallel Genetic Algorithm for Solving the Container Loading ProblemInternational Transactions in Operational Research, 2002
- A hybrid genetic algorithm for the container loading problemEuropean Journal of Operational Research, 2001
- Greedy Randomized Adaptive Search Procedures2001
- Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem KistenvorratOR Spectrum, 1998
- A genetic algorithm for solving the container loading problemInternational Transactions in Operational Research, 1997
- Loading pallets with non-identical itemsEuropean Journal of Operational Research, 1995
- Issues in the development of approaches to container loadingOmega, 1995
- A heuristic for packing boxes into a containerComputers & Operations Research, 1980