Solving container loading problems by block arrangement

Solving container loading problems by block arrangement

0.00 Avg rating0 Votes
Article ID: iaor20031915
Country: Netherlands
Volume: 141
Issue: 2
Start Page Number: 393
End Page Number: 409
Publication Date: Sep 2002
Journal: European Journal of Operational Research
Authors:
Keywords: programming: branch and bound
Abstract:

In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a greedy heuristic is presented that generates the desired block arrangements. Second the solutions provided by the greedy heuristic are improved by a tree search. Additional aspects such as load stability and weight distribution within the container are also taken into account. The test cases of Bischoff and Ratcliff are used for benchmarking purposes.

Reviews

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