Highlights ► This problem arises in packing, transportation, and logistics. ► It considers both bin costs and item profits at the same time. ► It generalizes several bin packing and knapsack problems. ► Efficient lower and upper bounds are introduced. ► The proposed procedures solve a large set of instances.

    Abstract 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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The generalized bin packing problem


    Beteiligte:


    Erscheinungsdatum :

    2012-05-24


    Format / Umfang :

    16 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The generalized bin packing problem

    Baldi, Mauro Maria | Online Contents | 2012


    Improved Packing Representation Model for the Orthogonal Packing Problem

    Chekanin, A.V. / Chekanin, V.A. | British Library Conference Proceedings | 2013


    The Pallet-Packing Vehicle Routing Problem

    Zachariadis, Emmanouil E. | Online Contents | 2012


    The Pallet-Packing Vehicle Routing Problem

    Zachariadis, E.E. / Tarantilis, C.D. / Kiranoudis, C.T. | British Library Online Contents | 2012


    MPQ-trees for the Orthogonal Packing Problem

    Joncour, C. d. / Pêcher, A. / Valicov, P. | British Library Online Contents | 2012