Efficient algorithms for orthogonal packing problems |
| |
Authors: | A. V. Chekanin V. A. Chekanin |
| |
Affiliation: | 1. Moscow State University of Technology “STANKIN”, Vadkovskii per. 1, Moscow, 127994, Russia
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |