13 DEZEMBRO / QUARTA FEIRA / 11:01
FCUP PT 
 EN
 
 
APRESENTAÇÃO
PESSOAS
ENSINO
INVESTIGAÇÃO
BIBLIOTECA
NOTÍCIAS
CONTACTOS

Technical Report: DCC-2013-13

Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression

Filipe Brandão, João Pedro Pedroso

DCC-FC & INESC Porto, Universidade do Porto
e-mail: {fdabrandao,jpp}@dcc.fc.up.pt
December 2013

Abstract

The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc-flow formulation with graph compression, for solving MVBP by simply representing all the patterns in a very compact graph. As a proof of concept we report computational results on a variable-sized bin packing data set.

Keywords: Multiple-choice Vector Bin Packing, Arc-flow Formulation, Integer Programming.


FCUP 2017