Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
Optimization and Control
2013-12-16 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.1312.3836,
title = {Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression},
author = {Filipe Brandão and João Pedro Pedroso},
journal= {arXiv preprint arXiv:1312.3836},
year = {2013}
}
Comments
arXiv admin note: text overlap with arXiv:1310.6887 by other authors