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.
Domaines
Recherche opérationnelle [math.OC]Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|