Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Circular blanks are often cut from silicon steel plates to make stators and rotors of electric motors. The shearing and punching processes are often used to cut the blanks. First a guillotine shear cuts the plate into strips, and then a stamping press cuts the blanks from the strips. The unconstrained circle cutting problem discussed is the problem of cutting from a rectangular plate a number of circular blanks of given diameters and values, so as to maximize the value of blanks cut, where the shearing and punching processes are applied. Two algorithms based on dynamic programming are presented for generating cutting patterns, one is an exact algorithm and the other is a heuristic one. The computational results indicate that the exact algorithm is adequate for small and middle scale problems, the heuristic algorithm is much more time efficient, and can generate cutting patterns close to optimal.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297—306

    Article  MATH  Google Scholar 

  • Cui Y (2006) Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors. Eur J Oper Res 169(1):30—40

    Article  MATH  Google Scholar 

  • Hifi M, Hallah RM (2004) Approximate algorithms for constrained circular cutting problems. Comput Oper Res 31:675—694

    Article  MATH  Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems. Springer-Verlag, Berlin

    MATH  Google Scholar 

  • Locatelli M, Raber U (2002) Packing equal circles in a square: a deterministic global optimization approach. Discrete Appl Math 122:139—166

    Article  MATH  MathSciNet  Google Scholar 

  • Stoyan YG, Yaskov GN (1998) Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int Trans Oper Res 5:45—57

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Guangxi Normal University, Guilin, 541004, P R China

    Yaodong Cui & Qiang Wang

Authors
  1. Yaodong Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yaodong Cui.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cui, Y., Wang, Q. Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors. J Comb Optim 14, 35–44 (2007). https://doi.org/10.1007/s10878-006-9039-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-9039-z

Keywords

Search

Navigation