Title
Cardinality reasoning for bin-packing constraint: application to a tank allocation problem
Abstract
Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality Constraint (GCC) available in most of the CP solvers. The BinPacking constraint was introduced by Shaw and mainly uses an independent knapsack reasoning in each bin to filter the possible bins for each item. This paper considers the use of a cardinality/flow reasoning for improving the filtering of a bin-packing constraint. The idea is to use a GCC as a redundant constraint to the BinPacking that will count the number of items placed in each bin. The cardinality variables of the GCC are then dynamically updated during the propagation. The cardinality reasoning of the redundant GCC makes deductions that the bin-packing constraint cannot see since the placement of all items into every bin is considered at once rather than for each bin individually. This is particularly well suited when a minimum loading in each bin is specified in advance. We apply this idea on a Tank Allocation Problem (TAP). We detail our CP model and give experimental results on a real-life instance demonstrating the added value of the cardinality reasoning for the bin-packing constraint.
Year
DOI
Venue
2012
10.1007/978-3-642-33558-7_58
CP
Keywords
Field
DocType
possible bin,cardinality reasoning,independent knapsack reasoning,bin-packing constraint,redundant constraint,cardinality variable,tank allocation problem,redundant gcc,binpacking constraint,cp model,flow reasoning
Mathematical optimization,Bin,Computer science,Constraint programming,Cardinality,Filter (signal processing),Knapsack problem,Constraint logic programming,Bin packing problem,Distributed computing
Conference
Citations 
PageRank 
References 
5
0.47
4
Authors
5
Name
Order
Citations
PageRank
Pierre Schaus112724.63
Jean-charles Régin2131296.59
Rowan Van Schaeren3241.20
Wout Dullaert443925.70
Birger Raa51589.82