Skip to main content
SpringerLink
Log in

Using a tabu search approach for solving the two-dimensional irregular cutting problem

  • Various Applications
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, a new approach to cutting a rectangular sheet of material into pieces of arbitrary shapes is presented. The proposed method consists of two stages. After the generation of an initial solution, a tabu search is applied for finding a final cutting pattern. The presentation of the main ideas of the method is followed by a description of an implementation and some experimental results.

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. A. Albano and G. Sapuppo, Optimal allocation of two-dimensional shapes using heuristic search methods, IEEE Trans. Systems, Man and Cybernetics SMC-10(1980).

    Google Scholar 

  2. R.C. Art, Jr., An approach to the two-dimensional irregular cutting stock problem, IBM Report 320-2006, Cambridge (1966).

  3. J. Błażewicz, M. Drozdowski, B. Soniewicki and R. Walkowiak, Two-dimensional cutting problem: Basic complexity results and algorithms for irregular shapes, Found. Contr. Eng. 14(1989).

  4. J. Błażewicz, M. Drozdowski, B. Soniewicki and R. Walkowiak, Decision Support System for cutting irregular shapes — implementation and experimental comparison, Found. Comp. Dec. Sci. 15(1990).

  5. M.R. Garey and D.S. Johnson, “Strong” NP-completeness results, motivation, examples and implications, J. ACM 25(1978).

  6. F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.

    Google Scholar 

  7. O. Gurel, Circular graph of marker layout, IBM Data Processing Division, New York Scientific Center, Report No. 320-2965 (1969).

  8. A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Ann. Math. Art. Int. 1(1990) 111–121.

    Google Scholar 

  9. J. Nelissen, Die Optimierung zweidimensionaler Zuschnittprobleme, Schriften zur Informatik und Angewandten Mathematik Rheinisch-Westfälische-Technische Hochschule Aachen, No. 150 (1991).

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Technical University of Poznań, 60-965, Poznań, Poland

    J. Błażewicz, P. Hawryluk & R. Walkowiak

Authors
  1. J. Błażewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Hawryluk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Walkowiak
    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

Błażewicz, J., Hawryluk, P. & Walkowiak, R. Using a tabu search approach for solving the two-dimensional irregular cutting problem. Ann Oper Res 41, 313–325 (1993). https://doi.org/10.1007/BF02022998

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02022998

Keywords

Search

Navigation