An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

By E. Hopper, B. Turton. European Journal of Operational Research, 2001

534 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An improved typology of cutting and packing problems (2007, background): “Kro ¨ger, 1995; Jacobs, 1996; Hopper and Turton, 2001a; Martello et al., 2003) one may also refer to this problem as the Rectangular Strip Packing Problem, or even as the Orthogonal Rectangular Strip Packing Problem, if the small rectangles have to be laid out on the large object orthogonally.”
An Exact Approach to the Strip-Packing Problem (2003, methodology): “The ORLIB library (see Beasley 1990, web site http: //www.ms.ic.ac.uk/info.html ) contains just one set of strip-packing instances, taken from Hopper and Turton (2001): these are referred to, in Table 1, as ht1 – ht9 .”
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem (2004, methodology): “Perhaps the most extensive data sets given for this problem are found in Hopper and Turton (2001) , where 21 problem sets of rectangle data are presented in seven different-sized categories (each category has three problems of similar size and object dimension).”