Branch and price for submodular bin packing - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue EURO Journal on Computational Optimization Année : 2023

Branch and price for submodular bin packing

Résumé

The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular. SMBP is equivalent to chance-constrained and robust bin packing problems under various conditions. SMBP is a hard binary nonlinear programming optimization problem. In this paper, we propose a branch-andprice algorithm to solve this problem. The resulting price subproblems are submodular knapsack problems, and we propose a tailored exact branch-andcut algorithm based on a piece-wise linear relaxation to solve them. To speed up column generation, we develop a hybrid pricing strategy to replace the exact pricing algorithm with a fast pricing heuristic. We test our algorithms on instances generated as suggested in the literature. The computational results show the efficiency of our branch-and-price algorithm and the proposed pricing techniques.
Fichier principal
Vignette du fichier
2204.00320(1).pdf (438.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04272674 , version 1 (06-11-2023)

Identifiants

Citer

Liding Xu, Claudia d'Ambrosio, Sonia Haddad Vanier, Emiliano Traversi. Branch and price for submodular bin packing. EURO Journal on Computational Optimization, 2023, 11 (100074), pp.arXiv:2204.00320v2. ⟨10.1016/j.ejco.2023.100074⟩. ⟨hal-04272674⟩
14 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More