SADYKOV, Ruslan; VANDERBECK, François

doi:10.1287/ijoc.1120.0499

Métadonnées

Licence d’utilisation du document

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

VANDERBECK, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

Langue

Article de revue

Ce document a été publié dans

INFORMS Journal on Computing. 2013, vol. 25, n° 2, p. 244-255

Institute for Operations Research and the Management Sciences (INFORMS)

Résumé en anglais

In the the bin packing problem with conflicts, one has to pack items in the minimum number of bins while avoiding joint assignments of items that are in conflict. Our study shows a comparatively good performance of a generic Branch-and-Price algorithm for this problem. We made use of our black box solver BaPCod, relying on its generic branching scheme and primal heuristics, while developing a specific pricing oracle. For the case where the conflict graph is an interval graph, we propose a fast dynamic programming algorithm for pricing, while for the general case we use a classic depth-first-search branch-and-bound approach. The algorithm is tested on instances from the literature where the conflict graph is an interval graph, as well as on newly generated instances with an arbitrarily conflict graph. The computational results show that the generic algorithm outperforms special purpose algorithms of the literature, closing all open instances in one hour of CPU time.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Bin Packing with conflicts: a generic branch-and-price algorithm

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche