Show simple item record

AuthorSerairi M.
AuthorHaouari M.
Available date2019-11-04T05:19:28Z
Publication Date2018
Publication NameRAIRO - Operations Research
ResourceScopus
ISSN0399-0559
URIhttp://dx.doi.org/10.1051/ro/2017019
URIhttp://hdl.handle.net/10576/12257
AbstractWe address the two-dimensional bin packing problem with fixed orientation. This problem requires packing a set of small rectangular items into a minimum number of standard two-dimensional bins. It is a notoriously intractable combinatorial optimization problem and has numerous applications in packing and cutting. The contribution of this paper is twofold. First, we propose a comprehensive theoretical analysis of lower bounds and we elucidate dominance relationships. We show that a previously presented dominance result is incorrect. Second, we present the results of an extensive computational study that was carried out, on a large set of 500 benchmark instances, to assess the empirical performance of the lower bounds. We found that the so-called Carlier-Clautiaux-Moukrim lower bounds exhibits an excellent relative performance and yields the tightest value for all of the benchmark instances.
SponsorAcknowledgements. This work was carried out in the framework of the Labex MS2T, which was funded by the French Government, through the program -Investments for the future-managed by the National Agency for Research (Reference ANR-11-IDEX-0004-02).
Languageen
PublisherEDP Sciences
SubjectDominance results
Dual feasible functions
Lower bounds
Two-dimensional bin packing
TitleA theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
TypeArticle
Pagination391-414
Issue Number2
Volume Number52


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record