An Experimental Study on Symmetry Breaking Constraints Impact for the One Dimensional Bin-Packing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

An Experimental Study on Symmetry Breaking Constraints Impact for the One Dimensional Bin-Packing Problem

Résumé

We consider the classical One-Dimensional Bin Packing Problem (1D-BPP), an N P-hard optimization problem, where, a set of weighted items has to be packed into one or more identical capacitated bins. We give an experimental study on using symmetry breaking constraints for strengthening the classical integer linear programming proposed to optimally solve this problem. Our computational experiments are conducted on the data-sets found in BPPLib and the results have confirmed the theoretical results.
Fichier principal
Vignette du fichier
19_WCO2020.pdf (212.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03006103 , version 1 (18-02-2021)

Identifiants

Citer

Khadija Hadj Salem, Yann Kieffer. An Experimental Study on Symmetry Breaking Constraints Impact for the One Dimensional Bin-Packing Problem. 13th International Workshop on Computational Optimization (Fedcsis-WCO 2020), Sep 2020, Sofia, Bulgaria. pp.317-326, ⟨10.15439/2020f19⟩. ⟨hal-03006103⟩
105 Consultations
263 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More