Abstract
This paper deals with the problem of packing of rectangles in a given rectangle. Genetic algorithms are proposed for solving the problem. Some details of realization of the approach proposed are given and a high efficiency of the method of genetic algorithms is illustrated by two examples.
Similar content being viewed by others
REFERENCES
Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods in Geometric Design [in Russian], Naukova Dumka, Kiev (1986).
J. Y. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan, Michigan (1975).
D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Boston (1989).
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin (1996).
A. A. Lipnitskii and B. Ye. Neselovskii, “Optimization of arrangements on a plane with the help of genetic algorithms,” in: Proc. 8th Byelorus. Math. Conf., Vol. 3, Minsk (2000).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lipnitskii, A.A. Use of Genetic Algorithms for Solution of the Rectangle Packing Problem. Cybernetics and Systems Analysis 38, 943–946 (2002). https://doi.org/10.1023/A:1022916710264
Issue Date:
DOI: https://doi.org/10.1023/A:1022916710264