Abstract
Consideration was given to different formulations of the rectangle packing problem for which methods of information coding exist. Information is used by the decoder algorithms to design the permissible packings and their esquisses. The decoders are single-pass heuristics of polynomial complexity. Decoder design relied on the block representations of packing. The existing decoders such as the bottom-left, sequence pair, block design, and substitution were presented along with new modifications of the block approach to the deterministic heuristics. The results of numerical experiment and comparative analysis of decoder operation were presented in conclusion.
Similar content being viewed by others
References
Dykhoff, H.A., A Typology of Cutting and Packing Problems, Eur. J. Oper. Res., 1990, vol. 44, pp. 145–159.
Murata, H., Fujiyoshi, K., Nakatane, S., and Kajitani, Y., Rectangle-Packing-Based Module Placement, Proc. IEEE ACM Int. Conf. Computer-Aided Design, 1995, pp. 472–479.
Imahori, S., Studies on Local Search Algorithms for Cutting and Packing Problems, in Department Appl. Math. Physics Graduate School Inf., Kyoto 606–8501, Japan, 2004.
Baker, B.S., Coffman, E.G., and Rives, R.L., Ortogonal Packing in Two Dimensions, SIAM J. Comput., 1980, no. 9, pp. 846–855.
Berkey, J.O. and Wang, P.Y., Two-dimensional Finite Bin Packing Algorithms, J. Oper. Res. Soc., 1987, vol. 38, pp. 423–429.
Chazelle, B., The Bottom-Left Bin Packing Heuristic: An Efficient Implementation, IEEE Trans. Comput., 1983, vol. 32(8), pp. 697–707.
Mukhacheva, E.A., Mukhacheva, A.C., and Chiglintsev, A.V., Genetic Algorithm of Block Structure in the Problems of Two-dimensional Packing, Inf. Tekhnol., 1999, no. 11, pp. 13–18.
Jakobs, S., On the Genetic Algorithms for the Packing of Polygons, Eur. J. Oper. Res., 1996, vol. 88, pp. 165–181.
Liu, D. and Teng, H., An Improved BL-algorithm for Genetic Algorithm of the Orthogonal Packing of Rectangles, Eur. J. Oper. Res., 1999, vol. 112, pp. 413–420.
Hopper, E. and Turton, B., A Review of the Application of Meta-heuristic Algorithms to 2D Regular and Irregular Strip Packing Problems, Artificial Intelligence Rev., 2001, vol. 16, pp. 257–300.
Mukhacheva, E.A. and Mukhacheva, A.C., Problem of Rectangle Packing: Methods of Local Search of the Optimum on the Basis of Block Structures, Avtom. Telemekh., 2004, no. 2, pp. 101–112.
Mukhacheva, E.A. and Mukhacheva, A.C., L.V. Kantorovich and the Cutting-packing Problems: New Approaches to Combinatorial Problems of Linear Cutting and Rectangular Packing, Teoriya predstavlenii, dinamicheskie sistemy. XI spets. vypusk. Zap. nauch. seminarov POMI (Theory of Representations, Dynamic Systems. XI Special Issue. Notes of the POMI Seminars), 2004, vol. 312, pp. 239–256.
Hopper, E. and Turton, B., The manuscript at the site http://home.t-online.de/home/villahost/eva.
Mukhacheva, A.C., Technology of the Block Structures of Local Search of Optimum in the Problems of Rectangular Packing, Inf. Tekhnol., 2004, no. 5 (Suppl.), pp. 18–32.
Mukhacheva, A.C., Mukhacheva, E.A., and Chiglintsev, A.V., The Problem of Orthogonal Packing in the Half-infinite Strip: Numerical Experiment with E. Hopper Wasteless Problems, Inf. Tekhnol., 2005, no. 7, pp. 45–55.
Author information
Authors and Affiliations
Additional information
Original Russian Text © E.A. Mukhacheva, D.A. Nazarov, A.S. Filippova, 2006, published in Avtomatika i Telemekhanika, 2006, No. 6, pp. 161–173.
This work was supported by the Foundation of the President of the Russian Federation, project no. MK 145.2003.01.
This paper was recommended for publication by A.I. Kibzun, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Mukhacheva, E.A., Nazarov, D.A. & Filippova, A.S. Design of rectangular packings using decoders of block structure. Autom Remote Control 67, 977–988 (2006). https://doi.org/10.1134/S0005117906060117
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0005117906060117