Home / files / instances / TDUNGKP

Two-dimensional Unconstrained Non-guillotine Knapsack Problem - Instances

Citing this page:

Use the BibTeX entry:

@Misc{2dungk-instances-page,  
 author = {T. A. Queiroz, F. K. Miyazawa and Y. Wakabayashi},  
 title = {Two-dimensional Unconstrained Non-guillotine Knapsack Problem -- Instances},  
 year = {2010},  
 note = {{\sl http://www.loco.ic.unicamp.br/instances/2dungk.html}}  
}  

Instance Set

These instances are the test problems used by T. A. Queiroz, F. K. Miyazawa and Y. Wakabayashi for the Two-dimensional Unconstrained Non-guillotine Knapsack Problem [1]:

• Instances: 2dungk_knapsack[.zip] (24KB).

The format of each data file is:

        N               number of item types
        L W             bin length and width
        l w v           (N lines, one line for each item type
        .               .
        .               .
        .               .)
        instance_name   instance name

The line for each item type contains 3 numbers: item length (l), item width (w) and item value (v).

If item value is equal to zero, then the item value is precisely its area.

References

• [1] T. A. Queiroz and F. K. Miyazawa and Y. Wakabayashi. Heurísticas para o Problema da Mochila 2D Não-Guilhotinada Ilimitada. XXXVI Conferência Latino-americana de Informática, 1-14, 2010.