Details

Autor(en) / Beteiligte

• Maiza, Mohamed
• Labed, Abdenour
• Radjef, Mohammed Said

Titel

Efficient algorithms for the offline variable sized bin-packing problem

Ist Teil von

• Journal of global optimization, 2013-11, Vol.57 (3), p.1025-1038

Ort / Verlag

Boston: Springer US

Erscheinungsjahr

2013

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• We addresses a variant of the classical one dimensional bin-packing problem where several types of bins with unequal sizes and costs are presented. Each bin-type includes limited and/or unlimited identical bins. The goal is to minimize the total cost of bins needed to store a given set of items, each item with some space requirements. Four new heuristics to solve this problem are proposed, developed and compared. The experiments results show that higher quality solutions can be obtained using the proposed algorithms.