Efficient algorithms for the offline variable sized bin-packing problem

Mohamed Maiza (), Abdenour Labed and Mohammed Radjef

Journal of Global Optimization, 2013, vol. 57, issue 3, 1025-1038

Abstract: 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. Copyright Springer Science+Business Media New York 2013

Keywords: Bin-packing problem; Heuristics; Monotonicity constraint (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9989-x (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:57:y:2013:i:3:p:1025-1038

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9989-x

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().