A New Class of Irregular Packing Problems Reducible to Sphere Packing in Arbitrary Norms

被引:3
|
作者
Litvinchev, Igor [1 ]
Fischer, Andreas [2 ]
Romanova, Tetyana [3 ,4 ]
Stetsyuk, Petro [5 ]
机构
[1] Autonomous Univ Nuevo Leon, Fac Mech & Elect Engn, San Nicolas De Los Garza, Mexico
[2] Tech Univ Dresden, Fac Math, D-01062 Dresden, Germany
[3] A Pidhornyi Inst Mech Engn Problems, Natl Acad Sci Ukraine, UA-61046 Kharkiv, Ukraine
[4] Univ Leeds, Business Sch, Leeds Univ, Leeds LS2 9JT, England
[5] VM Glushkov Inst Cybernet, Natl Acad Sci Ukraine, UA-03187 Kiev, Ukraine
关键词
packing; generalized spheres; composed objects; arbitrary norms; mathematical modeling; nonlinear optimization; GLOBAL OPTIMIZATION; SHAPE;
D O I
10.3390/math12070935
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Packing irregular objects composed by generalized spheres is considered. A generalized sphere is defined by an arbitrary norm. For three classes of packing problems, balance, homothetic and sparse packing, the corresponding new (generalized) models are formulated. Non-overlapping and containment conditions for irregular objects composed by generalized spheres are presented. It is demonstrated that these formulations can be stated for any norm. Different geometrical shapes can be treated in the same way by simply selecting a suitable norm. The approach is applied to generalized spheres defined by Lp norms and their compositions. Numerical solutions of small problem instances obtained by the global solver BARON are provided for two-dimensional objects composed by spheres defined in Lp norms to demonstrate the potential of the approach for a wide range of engineering optimization problems.
引用
收藏
页数:17
相关论文
共 50 条
  • [31] Handling Lower Bound and Hill-Climbing Strategies for Sphere Packing Problems
    Hifi, Mhand
    Yousef, Labib
    [J]. RECENT ADVANCES IN COMPUTATIONAL OPTIMIZATION: RESULTS OF THE WORKSHOP ON COMPUTATIONAL OPTIMIZATION WCO 2014, 2016, 610 : 145 - 164
  • [32] Global optimization approach to unequal sphere packing problems in 3D
    Sutou, A
    Dai, Y
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2002, 114 (03) : 671 - 694
  • [33] Exactly solvable disordered sphere-packing model in arbitrary-dimensional Euclidean spaces
    Torquato, S
    Stillinger, FH
    [J]. PHYSICAL REVIEW E, 2006, 73 (03):
  • [34] New classes of lower bounds for bin packing problems
    Fekete, SP
    Schepers, J
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 257 - 270
  • [35] New Algorithms for Packing Problems and Applications to VLSI Layout
    [J]. Denshi Joho Tsushin Gakkai Shi, 6 (576):
  • [36] New lower bounds for bin packing problems with conflicts
    Khanafer, Ali
    Clautiaux, Francois
    Talbi, El-Ghazali
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 281 - 288
  • [37] A new approach for modeling and solving set packing problems
    Alidaee, Bahram
    Kochenberger, Gary
    Lewis, Karen
    Lewis, Mark
    Wang, Haibo
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (02) : 504 - 512
  • [38] Integrating irregular strip packing and cutting path determination problems: A discrete exact approach
    Oliveira, Larissa Tebaldi
    Silva, Everton Fernandes
    Oliveira, Jose Fernando
    Bragion Toledo, Franklina Maria
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
  • [39] A New Deterministic Algorithm for Two-dimensional Rectangular Packing Problems based on Polyomino Packing Models
    Hoshi, Fumiya
    Murai, Yasuyuki
    Tsuji, Hiroyuki
    Tokumasu, Shinji
    [J]. IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [40] New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
    Ortmann, Frank G.
    Ntene, Nthabiseng
    van Vuuren, Jan H.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (02) : 306 - 315