Home / files / instances / TDSPP

Three-dimensional Strip Packing Problem - Instances

Citing this page:

Use the BibTeX entry:

@Misc{3dsp-instances-page,  
 author = {T. A. Queiroz, F. K. Miyazawa, Y. Wakabayashi and E. C. Xavier},  
 title = {Three-dimensional Strip Packing Problem -- Instances},  
 year = {2010},  
 note = {{\sl http://www.loco.ic.unicamp.br/instances/3dsp.html}}  
}  

Instance Set

These instances are the test problems used by T. A. Queiroz, F. K. Miyazawa, Y. Wakabayashi and E. C. Xavier for the Three-dimensional Strip Packing Problem [1]:

• Instances: 3dsp_strip[.zip] (8KB).

The format of each data file is:

        N               number of box types
        L W H           container length, width and height
        l w h d         (N lines, one line for each box type
        .               .
        .               .
        .               .)
        instance_name   instance name

The line for each box type contains 4 numbers: box length (l), box width (w), box height (h), box demand (d).

References

• [1] T. A. Queiroz and F. K. Miyazawa and Y. Wakabayashi and E. C. Xavier. Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2):200-212, 2012.