Skip to main content
SpringerLink
Log in

The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Orthogonal packing of rectangles in a semi-infinite strip and its representation by block structures, which reduces the problem to a special linear cutting problem, are studied. Schemes for constructing local optimum search methods and deterministic and probabilistic algorithms are designed. The results of a numerical experiment corroborating the effectiveness of new methods are given.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Dyckhoff, H., Cutting and Packing in Production and Distribution, Heidelberg: Physica, 1992.

    Google Scholar 

  2. Hinxman, A., The Trim-Loss and Assortment Problems: A Survey, Eur.J.Oper.Res., 1980, vol. 11, pp. 863-888.

    Google Scholar 

  3. Kantorovich, L.V. and Zalgaller, V.A., Raschet ratsional'nogo raskroya materialov (A Rational Cutting Method), Leningrad: Lenizdat, 1951.

    Google Scholar 

  4. Gilmory, P. and Gomory, R., Multistage Cutting Stock Problem of Two and More Dimensions, Oper.Res., 1965, vol. 13, no. 1, pp. 94-120.

    Google Scholar 

  5. Terno, J., Lindeman, R., and Scheithauer, G., Zuschnitprobleme und ihre praktische Losung, Leipzig: Teubner, 1987.

    Google Scholar 

  6. Romanovskii, I.V., Algoritmy resheniya extremal'nykh zadach (Algorithms for Solving Extremal Problems), Moscow: Nauka, 1977.

    Google Scholar 

  7. Mukhacheva, E.A., Ratsional'nyi raskroi promyshlennykh materialov: primenenie ACY (Rational Industrial Stock Cutting: Use of Automatic Control Systems), Moscow: Mashinostroenie, 1984.

    Google Scholar 

  8. Belov, G. and Scheithauer, G., A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths, Eur.J.Oper.Res., 2002, 141(2), pp. 274-294.

    Google Scholar 

  9. Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations, Chichester: Wiley, 1990.

    Google Scholar 

  10. Katsev, S.V., A Class of Discrete Minimax Problems, Kibernetika, 1979, no. 5, pp. 139-141.

  11. Gimadi, E.H. and Zalyubovskii, V.V., The Bin Packing Problem: An Asymptotically Exact Approach, Izv.Vuzov., Mat., 1997, no. 12, pp. 25-33.

  12. Coffman, E., Garey, M., and Jchonson, D., Approximation Algorithms for Bin-Packing. An Updated Survey, in Algorithm Design for Computer System Design, Ausiello, G., Lucertini, M., and Serafini, P., Eds., Berlin, 1984, pp. 49-106.

  13. Mukhacheva, E.A. and Valeeva, A.F., A Dynamic Selection Method for the Two-Dimensional Packing Problem, Inf.Tekhnologii, 2000, no. 5, pp. 30-37.

  14. Stoyan, Yu.G. and Gil', N.I., Metody i algoritmy razmesheniya ploskikh geometricheskikh ob"ektov (Methods and Alogirthms for Packing Plane Geometric Objects), Kiev: Naukova Dumka, 1976.

    Google Scholar 

  15. Kochetov, Yu.A., Probabilistic Local Search Methods for Discrete Optimization, in Diskretnaya matematiki i ee prilozheniya, Sb.lektsii molodezhnykh i nauchnykh shkol (Discrete Mathematics and Its Application. Collected Lectures of Young Scientists and Scientific Schools), Moscow: Mosk. Gos. Univ., 2001, pp. 87-117.

    Google Scholar 

  16. Aarts, E. and Lenstra, J., Local Search in Combinatorial Optimization, New York: Wiley, 1996.

    Google Scholar 

  17. Falkenauer, E., A Hybrid Grouping Genetic Algorithm for Bin Packing, J.Heuristics, 1998, vol. 2, no. 1, pp. 5-30.

    Google Scholar 

  18. Liu, D. and Teng, H., An Improved BL-Algorithm for Genetic Algorithm of Orthogonal Packing of Rectangles, Eur.J.Oper.Res., 1999, vol. 112, pp. 413-420.

    Google Scholar 

  19. Norenkov, I.P., Heuristics and Their Combinations in Genetic Discrete Optimization, Inf.Tekhnologii, 1999, no. 1, pp. 2-7.

  20. Goncharov, E.N. and Kochetov, Yu.A., Behavior of Probabilistic Greedy Algorithms for Multistage Packing Problems, Discret.Analiz Issled.Oper., 1999, ser. 2, vol. 6, no. 1, pp. 12-32.

    Google Scholar 

  21. Mukhacheva, A.S., Chilintsev, A.V., Smagin, M.A., and Mukhacheva, E.A., Two-Dimensional Packing Problems: Design of Genetic Algorithms from Mixed Local Optimal Solution Methods, Inf.Tekhnologii, 2001, no. 9.

  22. Mukhacheva, E.A., Belov, G.N., Kartak, V.M., and Mukhacheva, A.S., Linear One-Dimensional Cutting-Packing Problems: Numerical Experiments with Sequential Value Correction Method (SVC) and a Modified Branch-and-Bound Method (MBB), Pesquisa Operacional, 2000, vol. 20, no. 2, pp. 153-168.

    Google Scholar 

  23. Mukhacheva, E.A. and Mukhacheva, A.S., A Reconstruction Method for Rectangular Packing, Inf.Tekhnologii, 2000, no. 4, pp. 30-36.

Download references

Author information

Authors and Affiliations

  1. Ufa State Aviation Engineering University, Ufa, Russia

    E. A. Mukhacheva & A. S. Mukhacheva

Authors
  1. E. A. Mukhacheva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Mukhacheva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mukhacheva, E.A., Mukhacheva, A.S. The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures. Automation and Remote Control 65, 248–257 (2004). https://doi.org/10.1023/B:AURC.0000014721.38981.bb

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000014721.38981.bb

Keywords

Search

Navigation