Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem

  • Pierre Schaus
  • Jean-Charles Régin
  • Rowan Van Schaeren
  • Wout Dullaert
  • Birger Raa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7514)

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.

Keywords

Tank Allocation Constraint Programming Load Planning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shaw, P.: A Constraint for Bin Packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Dupuis, J., Schaus, P., Deville, Y.: Consistency Check for the Bin Packing Constraint Revisited. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 117–122. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Cambazard, H., O’Sullivan, B.: Propagating the Bin Packing Constraint Using Linear Programming. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 129–136. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    OscaR (Scala in OR) Solver, https://bitbucket.org/oscarlib/oscar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Pierre Schaus
    • 1
  • Jean-Charles Régin
    • 2
  • Rowan Van Schaeren
    • 3
  • Wout Dullaert
    • 4
  • Birger Raa
    • 5
  1. 1.ICTEAMUniversité catholique de LouvainBelgium
  2. 2.University of NiceFrance
  3. 3.Antwerp Maritime AcademyBelgium
  4. 4.VU University Amsterdam and University of AntwerpNetherlands
  5. 5.University of GentBelgium

Personalised recommendations