Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem

François Clautiaux 1, 2 Ruslan Sadykov 1, 2 François Vanderbeck 2, 1 Quentin Viaud 2, 1
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : The two-dimensional knapsack problem consists in packing a set of small rectangular items into a given large rectangle while maximizing the total reward associated with selected items. We restrict our attention to packings that emanate from a k-stage guillotine-cut process. We introduce a generic model where a knapsack solution is represented by a flow in a directed acyclic hypergraph. This hypergraph model derives from a forward labeling dynamic programming recursion that enumerates all non-dominated feasible cutting patterns. To reduce the hypergraph size, we make use of further dominance rules and a filtering procedure based on Lagrangian reduced costs fixing of hyperarcs. Our hypergraph model is (incrementally) extended to account for explicit bounds on the number of copies of each item. Our exact forward labeling algorithm is numerically compared to solving the max-cost flow model in the base hyper-graph with side constraints to model production bounds. Benchmarks are reported on instances from the literature and on datasets derived from a real-world application.
Type de document :
Article dans une revue
Discrete Optimization, Elsevier, 2018
Liste complète des métadonnées

https://hal.inria.fr/hal-01426690
Contributeur : François Vanderbeck <>
Soumis le : mercredi 4 janvier 2017 - 18:07:53
Dernière modification le : lundi 19 février 2018 - 11:17:55
Document(s) archivé(s) le : mercredi 5 avril 2017 - 15:15:29

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01426690, version 1

Collections

Citation

François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud. Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discrete Optimization, Elsevier, 2018. 〈hal-01426690〉

Partager

Métriques

Consultations de la notice

518

Téléchargements de fichiers

267