A special case of Variable-Sized Bin Packing Problem with Color Constraints - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-03524199 , version 1 (13-01-2022)

Identifiants

Citer

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⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More