Home / files / instances / TDCSPwVBS

Three-dimensional Cutting Stock Problem with Variable Bin Sizes - Instances


Citing this page:

Use the BibTeX entry:

@Misc{3dcsvb-instances-page,  
 author = {T. A. Queiroz, F. K. Miyazawa, Y. Wakabayashi and E. C. Xavier},  
 title = {Three-dimensional Cutting Stock Problem with Variable Bin Sizes -- Instances},  
 year = {2010},  
 note = {{\sl http://www.loco.ic.unicamp.br/instances/3dcsvb.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 Cutting Stock Problem with Variable Bin Sizes [1]:

The format of each data file is:

        N               number of box types
        M               number of container types
        L W H           container length, width and height
        cl cw ch cv     (M lines, one line for each container type
        .               .
        .               .
        .               .)
        bl bw bh bd     (N lines, one line for each box type
        .               .
        .               .
        .               .)
        instance_name   instance name

The line for each container type contains 4 numbers: container length (cl), container width (cw), container height (ch), container value (cv).

The line for each box type contains 4 numbers: box length (bl), box width (bw), box height (bh), box demand (bd).


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.