New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem

Résumé

In this article, we address the classical One-Dimensional Bin Packing Problem (1D-BPP), an N P-hard combinatorial optimization problem. We propose a new formulation of integer linear programming for the problem, which reduces the search space compared to those described in the literature, as well as two families of cutting planes. Computational experiments are conducted on the data-set found in BPPLib and the results show that it is possible to solve more instances and to decrease the computation time by using our new formulation.
Fichier principal
Vignette du fichier
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem.pdf (448.97 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt

Dates et versions

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

Identifiants

Citer

Khadija Hadj Salem, Yann Kieffer. New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem. Donghyun Kim; R. N. Uma; Zhipeng Cai; Dong Hoon Lee. Computing and Combinatorics. 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings, 12273, Springer, pp.423-434, 2020, Lecture Notes in Computer Science, 978-3-030-58149-7. ⟨10.1007/978-3-030-58150-3_34⟩. ⟨hal-03006106⟩
68 Consultations
306 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More