Efficient algorithms for orthogonal packing problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 53 (2013) no. 10, pp. 1639-1648
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{ZVMMF_2013_53_10_a4,
author = {A. V. Chekanin and V. A. Chekanin},
title = {Efficient algorithms for orthogonal packing problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1639--1648},
publisher = {mathdoc},
volume = {53},
number = {10},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2013_53_10_a4/}
}
TY - JOUR AU - A. V. Chekanin AU - V. A. Chekanin TI - Efficient algorithms for orthogonal packing problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2013 SP - 1639 EP - 1648 VL - 53 IS - 10 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2013_53_10_a4/ LA - ru ID - ZVMMF_2013_53_10_a4 ER -
A. V. Chekanin; V. A. Chekanin. Efficient algorithms for orthogonal packing problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 53 (2013) no. 10, pp. 1639-1648. http://geodesic.mathdoc.fr/item/ZVMMF_2013_53_10_a4/