Recursive circle packing problems

被引：9
|
作者：
Pedroso, Joao Pedro [1 ,2 ]
Cunha, Silvia [1 ,3 ]
Tavares, Joao Nuno [1 ,3 ]
机构：
[1] Univ Porto, Fac Ciencias, P-4169007 Oporto, Portugal
[2] INESC Porto, P-4200465 Oporto, Portugal
[3] Univ Porto, Ctr Matemat, P-4169007 Oporto, Portugal
来源：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2016年 / 23卷 / 1-2期
关键词：
packing problems; knapsack problems; heuristics; practice of OR; combinatorial optimization; integer programming; loading problems; local search; RECTANGULAR CONTAINER; UNEQUAL CIRCLES; SIZED CIRCLES; OPTIMIZATION; POLYGONS; STRIP;
D O I：
10.1111/itor.12107
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper presents a class of packing problems where circles may be placed either inside or outside other circles, the whole set being packed in a rectangle. This corresponds to a practical problem of packing tubes in a container. Before being inserted in the container, tubes may be put inside other tubes in a recursive fashion. A variant of the greedy randomized adaptive search procedure is proposed for tackling this problem, and its performance is assessed in a set of benchmark instances.
引用
收藏
页码：355 / 368
页数：14
相关论文
共 50 条
  • [1] Reformulation descent applied to circle packing problems
    Mladenovic, N
    Plastria, F
    Urosevic, D
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (09) : 2419 - 2434
  • [2] Formulation space search for circle packing problems
    Mladenovic, Nenad
    Plastria, Rank
    Urosevic, Dragan
    [J]. ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 212 - +
  • [3] On Riemann-Hilbert Problems in Circle Packing
    Elias Wegert
    David Bauer
    [J]. Computational Methods and Function Theory, 2009, 9 (2) : 609 - 632
  • [4] Minimizing the object dimensions in circle and sphere packing problems
    Birgin, E. G.
    Sobral, F. N. C.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (07) : 2357 - 2375
  • [5] A Reliable Area Reduction Technique for Solving Circle Packing Problems
    M. C. Markót
    T. Csendes
    [J]. Computing, 2006, 77 : 147 - 162
  • [6] A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies
    Hifi, Mhand
    M'Hallah, Rym
    [J]. ADVANCES IN OPERATIONS RESEARCH, 2009, 2009
  • [7] Polynomial-Time Approximation Schemes for Circle Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 713 - 724
  • [8] A reliable area reduction technique for solving circle packing problems
    Markót, MC
    Csendes, T
    [J]. COMPUTING, 2006, 77 (02) : 147 - 162
  • [9] Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition
    Ambros Gleixner
    Stephen J. Maher
    Benjamin Müller
    João Pedro Pedroso
    [J]. Annals of Operations Research, 2020, 284 : 527 - 555
  • [10] Improved interval methods for solving circle packing problems in the unit square
    Mihály Csaba Markót
    [J]. Journal of Global Optimization, 2021, 81 : 773 - 803
12345