Effective methods for solving an orthogonal packing problem
Informacionnye tehnologii i vyčislitelnye sistemy, no. 2 (2014), pp. 37-45
Cet article a éte moissonné depuis la source Math-Net.Ru
The multidimensional packing task is considered at the article. Proposed by authors new packing model «virtual objects», used at planning any dimension orthogonal packing task, is investigated. New heuristics for solving the task are described. Computational experiments on standard rectangular two-dimension packing tasks are carried out and the results are dicussed.
Keywords:
combinatorial problem, optimization, packing task, orthogonal packing, packing model, multimethodical genetic algorithm, heuristics, computational experiment.
@article{ITVS_2014_2_a4,
author = {V. A. Chekanin and A. V. Chekanin},
title = {Effective methods for solving an orthogonal packing problem},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {37--45},
year = {2014},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2014_2_a4/}
}
V. A. Chekanin; A. V. Chekanin. Effective methods for solving an orthogonal packing problem. Informacionnye tehnologii i vyčislitelnye sistemy, no. 2 (2014), pp. 37-45. http://geodesic.mathdoc.fr/item/ITVS_2014_2_a4/