In this article, we address the classical One-Dimensional Bin Packing Problem (1D-BPP), an 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.
CITATION STYLE
Hadj Salem, K., & Kieffer, Y. (2020). New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12273 LNCS, pp. 423–434). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58150-3_34
Mendeley helps you to discover research relevant for your work.