A hybrid genetic algorithm for the container loading problem

A hybrid genetic algorithm for the container loading problem

0.00 Avg rating0 Votes
Article ID: iaor20013961
Country: Netherlands
Volume: 131
Issue: 1
Start Page Number: 143
End Page Number: 161
Publication Date: May 2001
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

This paper presents a hybrid genetic algorithn (GA) for the container loading problem with boxes of different sizes and a single container for loading. Generated stowage plans include several vertical layers each containing several boxes. Within the procedure, stowage plans are represented by complex data structures closely related to the problem. To generate offspring, specific genetic operators are used that are based on an integrated greedy heuristic. The process takes several practical constraints into account. Extensive test calculations including procedures from other authors vouch for the good performance of the GA, above all for problems with strongly heterogeneous boxes.

Reviews

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