Efficient algorithms for the offline variable sized bin-packing problem

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, eac...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization 2013-11, Vol.57 (3), p.1025-1038
Main Authors: Maiza, Mohamed, Labed, Abdenour, Radjef, Mohammed Said
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Bins
Computer Science
Costs
Heuristic
Laboratories
Linear programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Packing problem
Real Functions
Stores
Studies
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-012-9989-x