Home / files / instances / SPPwUC

Strip Packing Problem with Unloading Constraints - Instances

Citing this page:

Use the BibTeX entry:

@Misc{spu2d-instances-page,  
 author = {J. L. M. da Silveira, E. C. Xavier and F. K. Miyazawa},  
 title = {Strip Packing Problem with Unloading Constraints -- Instances},  
 year = {2011},  
 note = {{\sl http://www.loco.ic.unicamp.br/instances/spu2d.html}}  
}  

Instance Set

These instances are the test problems used by J. L. M. da Silveira, E. C. Xavier and F. K. Miyazawa for the Strip Packing Problem with Unloading Constraints [1]:

• Instances: spu2d_instances[.zip] (3.1MB).

The format of each data file is:

        instance_name         instance name (except for 2lcvrp set)
        C                     number of clients (classes)
        N                     number of items
        H W                   bin height and width (width used only)
        c s h1 w1 ... hs ws   (C lines, one line for each client
        .                     .
        .                     .
        .                     .)

The line for each client contains the index of the client (c), the number of items for the client (s), and the list of items with height and width.

References

• [1] J. L. M. da Silveira and F. K. Miyazawa and E. C. Xavier. Heuristics for the strip packing problem with unloading constraints. Computers & Operations Research, 40(4):991-1003, 2013.