Efficient algorithms for orthogonal packing problems

被引：7
|
作者：
Chekanin, A. V. [1 ]
Chekanin, V. A. [1 ]
机构：
[1] Moscow State Univ Technol STANKIN, Moscow 127994, Russia
来源：
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2013年 / 53卷 / 10期
关键词：
packing problem; orthogonal packing problem; distribution of resources; object representation model; decoder; heuristic; genetic algorithm; evolutionary algorithm; multimethod genetic algorithm; numerical experiment; 3-DIMENSIONAL BIN-PACKING; LOWER BOUNDS;
D O I：
10.1134/S0965542513100047
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The NP complete problem of the orthogonal packing of objects of arbitrary dimension is considered in the general form. A new model for representing objects in containers is proposed that ensures the fast design of an orthogonal packing. New heuristics for the placement of orthogonal packing are proposed. A single-pass heuristic algorithm and a multimethod genetic algorithm are developed that optimize an orthogonal packing solution by increasing the packing density. Numerical experiments for two- and three-dimensional orthogonal packing problems are performed.
引用
收藏
页码：1457 / 1465
页数：9
相关论文
共 50 条
  • [1] Efficient algorithms for orthogonal packing problems
    A. V. Chekanin
    V. A. Chekanin
    Computational Mathematics and Mathematical Physics, 2013, 53 : 1457 - 1465
  • [2] Approximation algorithms for orthogonal packing problems for hypercubes
    Harren, Rolf
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (44) : 4504 - 4532
  • [3] Efficient approximation algorithms for tiling and packing problems with rectangles
    Berman, P
    DasGupta, B
    Muthukrishnan, S
    Ramaswami, S
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 41 (02): : 443 - 470
  • [4] Packing problems with orthogonal rotations
    Miyazawa, FK
    Wakabayashi, Y
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 359 - 368
  • [5] Compaction algorithm for orthogonal packing problems
    Chekanin, Vladislav A.
    Chekanin, Alexander V.
    2017 INTERNATIONAL CONFERENCE ON STRUCTURAL, MECHANICAL AND MATERIALS ENGINEERING (ICSMME 2017), 2017, 248
  • [6] Training software for orthogonal packing problems
    Costa, Gianluca
    Delorme, Maxence
    Iori, Manuel
    Malaguti, Enrico
    Martello, Silvano
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 111 : 139 - 147
  • [7] Algorithms for packing and scheduling problems
    Monaci, Michele
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2003, 1 (01): : 85 - 87
  • [8] Algorithms for packing and scheduling problems
    Michele Monaci
    Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2003, 1 : 85 - 87
  • [9] An Efficient Model for the Orthogonal Packing Problem
    Chekanin, Vladislav A.
    Chekanin, Alexander V.
    ADVANCES IN MECHANICAL ENGINEERING, 2015, : 33 - 38
  • [10] Approximation Algorithms for Cycle Packing Problems
    Krivelevich, Michael
    Nutov, Zeev
    Yuster, Raphael
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 556 - 561
12345