Skip to Main content Skip to Navigation
Conference papers

A special case of Variable-Sized Bin Packing Problem with Color Constraints

Abstract : The Variable-Sized Bin Packing Problem with Color Constraints (VSBPP-CC) is a generalization of the classical one-dimensional Bin Packing Problem, where bins of different capacities are available for packing a set of items each characterized by a weight and a color. The objective is to pack all the items while minimizing the total residual capacity, and such that each bin contains at most two different colors. In this paper we consider a special case of VSBPP-CC where each color is assigned to only one item. We first describe the problem, its practical context and survey related works. We then propose several original mathematical formulations for the problem. Preliminary computational results show the efficiency of our formulations, mainly the so-called matching formulation, in solving CSPLIB-based instances.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03524199
Contributor : Frédéric Pruvost Connect in order to contact the contributor
Submitted on : Thursday, January 13, 2022 - 10:19:15 AM
Last modification on : Thursday, May 19, 2022 - 4:53:25 PM

Identifiers

Collections

Citation

Igor Crevits, Said Hanafi, A.Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut. A special case of Variable-Sized Bin Packing Problem with Color Constraints. Proceedings of 6th International Conference on Control, Decision and Information Technologies, Apr 2019, Paris, France. pp.1150-1154, ⟨10.1109/CoDIT.2019.8820707⟩. ⟨hal-03524199⟩

Share

Metrics

Record views

4