Price-and-verify:a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition

Gleixner, Ambros and Maher, Stephen and Muller, Benjamin and Pedroso, João Pedro (2020) Price-and-verify:a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition. Annals of Operational Research, 284 (2). pp. 527-555.

Full text not available from this repository.

Abstract

Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig–Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e., packings of circles into other circles, and by dynamically generating packings of circles into rectangles. We use column generation techniques to design a “price-and-verify” algorithm that solves this reformulation to global optimality. Extensive computational experiments on a large test set show that our method not only computes tight dual bounds, but often produces primal solutions better than those computed by heuristics from the literature.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Operational Research
Subjects:
ID Code:
145661
Deposited By:
Deposited On:
21 Aug 2020 08:35
Refereed?:
Yes
Published?:
Published
Last Modified:
08 Sep 2020 13:50