Packing n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped

  • Authors:

  • I. V. Grebennik;A. V. Pankratov;A. M. Chugay;A. V. Baranov

  • Affiliations:

  • Kharkov National University of Radio Electronics, Kharkov, Ukraine;A. N. Podgorny Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, Kharkov, Ukraine;A. N. Podgorny Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, Kharkov, Ukraine;Kharkov National University of Radio Electronics, Kharkov, Ukraine

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A mathematical model is constructed and a method is developed for the solution of the packing problem for n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped. To search for an approximation to the global minimum, a combination of the sequentially-single placement method and a modification of the decremental neighborhood method is used. The offered approach contributes to the improvement of the results of packing oriented n-dimensional parallelepipeds.