A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
A Reinforced Tabu Search Approach for 2D Strip Packing
[chapter]
Modeling, Analysis, and Applications in Metaheuristic Computing
This paper deals with a particular "packing" problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied here considers regular items (they are rectangular to be more precise) that must be packed without overlap, rotations being not allowed. The objective is to minimize the height of the resulting packing. For this problem, we present a local search algorithm based on the
doi:10.4018/978-1-4666-0270-0.ch011
fatcat:lcinwbc2ufecdeekhrtym2x47m