Portal de Periódicos da CAPES

The generalized bin packing problem

2012; Elsevier BV; Volume: 48; Issue: 6 Linguagem: Inglês

10.1016/j.tre.2012.06.005

1878-5794

Mauro Maria Baldi, Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei,

Computational Geometry and Mesh Generation

In the Generalized Bin Packing Problem (GBPP), given two sets of compulsory and non-compulsory items characterized by volume and profit and a set of bins with given volume and cost, we want to select the subset of profitable non-compulsory items to be loaded together with the compulsory ones into the appropriate bins in order to minimize the total net cost. Lower and upper bounds to the GBPP are given. The results of extensive computational experiments show that the proposed procedures are efficient and the bounds are tight.