Thumbnail

A branch-and-price algorithm for the temporal bin packing problem

Dell’Amico, Mauro; Furini, Fabio; Iori, Manuel (2019), A branch-and-price algorithm for the temporal bin packing problem, Computers and Operations Research, 114, p. 104825. 10.1016/j.cor.2019.104825

View/Open
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Computers and Operations Research
Volume
114
Publisher
Elsevier
Pages
104825
Publication identifier
Metadata
Show full item record
Author(s)
Dell’Amico, Mauro
Furini, Fabio
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Iori, Manuel
Abstract (EN)
We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items while respecting the bin capacity at any time instant. A polynomial-size formulation, an exponential-size formulation, and a number of lower and upper bounds are studied. A branch-and-price algorithm for solving the exponential-size formulation is introduced. An overall algorithm combining the different methods is then proposed and tested through extensive computational experiments.
Subjects / Keywords
Bin packing problem; Branch-and-price algorithm; Temporal bin packing problem