Proportional Packing of Circles in a Circular Container

被引：6
|
作者：
Romanova, T. E. [1 ]
Stetsyuk, P. I. [2 ]
Fischer, A. [3 ]
Yaskov, G. M. [1 ]
机构：
[1] Natl Acad Sci Ukraine, A Pidhornyi Inst Mech Engn Problems, Kharkiv, Ukraine
[2] Natl Acad Sci Ukraine, V M Glushkov Inst Cybernet, Kiev, Ukraine
[3] Tech Univ Dresden, Dresden, Germany
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2023年 / 59卷 / 01期
基金：
新加坡国家研究基金会;
关键词：
proportional packing; circles; circular container; pseudo-inclusion; optimization; EQUAL CIRCLES; R-ALGORITHMS; OPTIMIZATION;
D O I：
10.1007/s10559-023-00544-8
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The authors consider a problem of packing circles of given types in a circular container. Circles are allowed to cross the container boundary in a predefined neighborhood that depends on the circle type (pseudo-inclusion condition). A family of circles is placed in the container under the conditions of their non-intersection, pseudo-inclusion, and compliance with the given proportions of circle types (proportionality condition) in order to maximize the total number of circles. A mathematical model is constructed as a problem of mixed integer nonlinear programming. A heuristic algorithm is proposed that applies a nonlinear programming problem to pack a given number of circles in a circular container, maximizing the variable radii of the circles. The results of the computational experiments are given.
引用
收藏
页码：82 / 89
页数：8
相关论文
共 50 条
  • [1] Proportional Packing of Circles in a Circular Container
    T. E. Romanova
    P. I. Stetsyuk
    A. Fischer
    G. M. Yaskov
    Cybernetics and Systems Analysis, 2023, 59 : 82 - 89
  • [2] New heuristics for packing unequal circles into a circular container
    Huang, WQ
    Li, Y
    Li, CM
    Xu, RC
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) : 2125 - 2142
  • [3] A hybrid heuristic for packing unequal circles into a circular container
    Akeb, Hakim
    Li, Yu
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 922 - 927
  • [4] Solving the problem of packing equal and unequal circles in a circular container
    Grosso, A.
    Jamali, A. R. M. J. U.
    Locatelli, M.
    Schoen, F.
    JOURNAL OF GLOBAL OPTIMIZATION, 2010, 47 (01) : 63 - 81
  • [5] Greedy heuristic algorithm for packing equal circles into a circular container
    Chen, Mao
    Tang, Xiangyang
    Song, Ting
    Zeng, Zhizhong
    Peng, Xicheng
    Liu, Sanya
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 119 : 114 - 120
  • [6] Solving the problem of packing equal and unequal circles in a circular container
    A. Grosso
    A. R. M. J. U. Jamali
    M. Locatelli
    F. Schoen
    Journal of Global Optimization, 2010, 47 : 63 - 81
  • [7] Packing a fixed number of identical circles in a circular container with circular prohibited areas
    Lopez, C. O.
    Beasley, J. E.
    OPTIMIZATION LETTERS, 2019, 13 (07) : 1449 - 1468
  • [8] Packing a fixed number of identical circles in a circular container with circular prohibited areas
    C. O. López
    J. E. Beasley
    Optimization Letters, 2019, 13 : 1449 - 1468
  • [9] Iterated dynamic thresholding search for packing equal circles into a circular container
    Lai, Xiangjing
    Hao, Jin-Kao
    Yue, Dong
    Lu, Zhipeng
    Fu, Zhang-Hua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (01) : 137 - 153
  • [10] A formulation space search heuristic for packing unequal circles in a fixed size circular container
    Lopez, C. O.
    Beasley, J. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (01) : 64 - 73
12345