Skip to main content
Log in

Use of Genetic Algorithms for Solution of the Rectangle Packing Problem

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods in Geometric Design [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  2. J. Y. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan, Michigan (1975).

    Google Scholar 

  3. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Boston (1989).

    Google Scholar 

  4. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin (1996).

    Google Scholar 

  5. 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).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022916710264

Navigation