Skip to main content
SpringerLink
Log in

Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The optimal path to be followed by an automatic cutter to cut a set of shapes arranged on a material is termed as the cutting path determination problem. The shapes are often considered as polygons. Each polygon can be either cut entirely (complete cutting approach) or partially (partial cutting approach) before cutting the next polygon. This work solves the cutting path determination problem using the partial cutting approach. The proposed approximation algorithm uses the concepts of ma tching, s panning tree, and tri angulation, and is hence termed as MASTRI. The MASTRI algorithm has a time complexity of O(n logn) where n is the total number of vertices of all the polygons. The cutting path computed by the MASTRI algorithm is guaranteed to be within a factor of 3/2 of optimum travel distance of the cutter. No other algorithm has been developed for the partial cutting approach which runs in polynomial time. The MASTRI algorithm is evaluated on 285 input problems, of which 192 problems are randomly generated, and 93 problems are taken from literature. The experimental analysis shows that the MASTRI algorithm computes the cutting path in a very short amount of time. The comparison of MASTRI algorithm with existing works in the literature shows that the MASTRI algorithm gives a shorter cutting path in less time. The MASTRI algorithm can be used for computing cutting path in industries like sheet metal cutting.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Availability of data and material

Not applicable

Code availability

Not applicable

References

  1. Afifi AA, Hayhurst DR, Khan WA (2011) Non-productive tool path optimisation of multi-tool part programmes. Int J Adv Manuf Technol 55(9-12):1007–1023

    Article  Google Scholar 

  2. Afifi AA, Khan WA, Hayhurst DR (2012) Adaptation of the simulated annealing optimization algorithm to achieve improved near-optimum objective function values and computation times for multiple component manufacture. Int J Adv Manuf Technol 60(5-8):437–451

    Article  Google Scholar 

  3. Ahadi A, Mozafari A, Zarei A (2014) Touring a sequence of disjoint polygons: Complexity and extension. Theor Comput Sci 556:45–54

    Article  MathSciNet  Google Scholar 

  4. Alatartsev S, Mersheeva V, Augustine M, Ortmeier F (2013) On optimizing a sequence of robotic tasks. In: 2013 IEEE/RSJ International conference on intelligent robots and systems. IEEE, pp 217–223

  5. Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discret Appl Math 55(3):197–218

    Article  MathSciNet  Google Scholar 

  6. Balamurali M, Jawahar N, Balaji S, Manichandran T (2019) Realization of effective laser blanking process by heat zone spread resistance coating and optimization methods. Mater Res Express 6(4):046416

    Article  Google Scholar 

  7. Chentsov PA, Petunin AA (2016) Tool routing problem for CNC plate cutting machines. IFAC-PapersOnLine 49(12):645–650

    Article  Google Scholar 

  8. Chew LP (1989) Constrained delaunay triangulations. Algorithmica 4(1-4):97–108

    Article  MathSciNet  Google Scholar 

  9. Cormen TH, Leiserson CE, Rivest RL (2009) Introduction to algorithms. MIT Press, Cambridge

    MATH  Google Scholar 

  10. Dewil R, Vansteenwegen P, Cattrysse D (2011) Cutting path optimization using tabu search. In: Key engineering materials, vol 473. Trans Tech Publications, pp 739–748

  11. Dewil R, Vansteenwegen P, Cattrysse D (2012) Heuristics for laser cutting tool path generation. Appl Math Optim Model 10:210–216

    Google Scholar 

  12. Dewil R, Vansteenwegen P, Cattrysse D, Laguna M, Vossen T (2015) An improvement heuristic framework for the laser cutting tool path problem. Int J Prod Res 53(6):1761–1776

    Article  Google Scholar 

  13. Dewil R, Vansteenwegen P, Cattrysse D (2016) A review of cutting path algorithms for laser cutters. Int J Adv Manuf Technol 87(5-8):1865–1884

    Article  Google Scholar 

  14. Dillencourt MB (1990) Toughness and delaunay triangulations. Discre Comput Geom 5(6):575–601

    Article  MathSciNet  Google Scholar 

  15. Drake DE, Hougardy S (2003) A simple approximation algorithm for the weighted matching problem. Inf Process Lett 85(4):211–213

    Article  MathSciNet  Google Scholar 

  16. Dror M, Efrat A, Lubiw A, Mitchell JS (2003) Touring a sequence of polygons. In: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp 473–482

  17. Elbassioni K, Fishkin AV, Sitters R (2009) Approximation algorithms for the euclidean traveling salesman problem with discrete and continuous neighborhoods. Int J Comput Geom Appl 19(02):173–193

    Article  MathSciNet  Google Scholar 

  18. Silva EF (2018) The cutting path determination problem: solutions’ layouts. https://doi.org/https://data.mendeley.com/datasets/vffwyvbdzy/1, mendeley Data, V1, https://doi.org/10.17632/vffwyvbdzy.1

  19. Fleischner H (1990) Eulerian graphs and related topics, vol 1. Elsevier, New York

    MATH  Google Scholar 

  20. Garfinkel RS, Webb IR (1999) On crossings, the crossing postman problem, and the rural postman problem. Int J Netw 34(3):173–180

    MathSciNet  MATH  Google Scholar 

  21. Gibbons A (1985) Algorithmic graph theory. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  22. Goodrich MT, Tamassia R (2015) Algorithm design and applications. Wiley, Hoboken

    MATH  Google Scholar 

  23. Hajad M, Tangwarodomnukun V, Jaturanonda C, Dumkum C (2019) Laser cutting path optimization using simulated annealing with an adaptive large neighborhood search. Int J Adv Manuf Technol 103 (1-4):781–792

    Article  Google Scholar 

  24. Han GC, Na SJ (1998) Global torch path generation for 2-D laser cutting process using simulated annealing. Intell Autom Soft Comput 4(2):97–108

    Article  Google Scholar 

  25. Lee MK, Kwon KB (2006) Cutting path optimization in CNC cutting processes using a two-step genetic algorithm. Int J Prod Res 44(24):5307–5326

    Article  Google Scholar 

  26. Oliveira LT, Silva EF, Oliveira JF, Toledo FMB (2020) Integrating irregular strip packing and cutting path determination problems: A discrete exact approach. Comput Ind Eng 149:106757

    Article  Google Scholar 

  27. Onwubolu G, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 42(3):473–491

    Article  Google Scholar 

  28. Pan X, Li F, Klette R (2010) Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. Department of Computer Science, University of Auckland.

  29. Petunin A (2019) General model of tool path problem for the CNC sheet cutting machines. IFAC-PapersOnLine 52(13):2662–2667

    Article  Google Scholar 

  30. Petunin A, Polishchuk E, Ukolov S (2019) On the new algorithm for solving continuous cutting problem. IFAC-PapersOnLine 52(13):2320–2325

    Article  Google Scholar 

  31. Petunin A, Chentsov P, Polishchuk E, Ukolov S, Martynov V (2020) Optimum routing algorithms for control programs design in the cam systems for CNC sheet cutting machines. In: AIP conference proceedings, vol 2312. AIP Publishing LLC, p 020005

  32. Petunin AA (2015) Modeling of tool path for the cnc sheet cutting machines. In: AIP conference proceedings, vol 1690. AIP Publishing LLC, p 060002

  33. Petunin AA, Stylios C (2016) Optimization models of tool path problem for CNC sheet metal cutting machines. IFAC-PapersOnLine 49(12):23–28

    Article  Google Scholar 

  34. Rodrigues AM, Ferreira JS (2012) Cutting path as a rural postman problem: solutions by memetic algorithms. Int J Comb Optim Probl Inform 3(1):31–46

    Google Scholar 

  35. Sherif SU, Jawahar N, Balamurali M (2014) Sequential optimization approach for nesting and cutting sequence in laser cutting. J Manuf Syst 33(4):624–638

    Article  Google Scholar 

  36. Shipacheva E, Petunin A, Berezin I (2017) A genetic algorithm used for solving one optimization problem. In: AIP conference proceedings, vol 1915. AIP Publishing LLC, p 040052

  37. Silva EF, Oliveira LT, Oliveira JF, Toledo FMB (2019) Exact approaches for the cutting path determination problem. Comput Oper Res 112:104772

    Article  MathSciNet  Google Scholar 

  38. Sonawane S, Patil P, Bharsakade R, Gaigole P (2020) Optimizing tool path sequence of plasma cutting machine using TSP approach. In: E3S web of conferences, EDP sciences, vol 184, p 01037

  39. Tavaeva A, Petunin A, Krotov V (2017) About effectiveness of special cutting techniques application during development of automatic methods of tool path optimization applied to CNC thermal cutting machines. In: Computer Science and Information Technologies (CSIT’2017), pp 221–226

  40. Tavaeva A, Petunin A, Polishchuk E (2019a) Methods of cutting cost minimizing in problem of tool route optimization for CNC laser machines. In: International conference on industrial engineering. Springer, pp 447–455

  41. Tavaeva A, Petunin A, Ukolov S, Krotov V (2019b) A cost minimizing at laser cutting of sheet parts on CNC machines. In: International conference on mathematical optimization theory and operations research. Springer, pp 422–437

  42. Toledo FM, Carravilla MA, Ribeiro C, Oliveira JF, Gomes AM (2013) The dotted-board model: a new mip model for nesting irregular shapes. Int J Prod Econ 145(2):478–487

    Article  Google Scholar 

  43. Van Kreveld M, Schwarzkopf O, de Berg M, Overmars M (2000) Computational geometry algorithms and applications. Springer, New York

    MATH  Google Scholar 

  44. Yang WB, Zhao YW, Jie J, Wang WL (2010) An effective algorithm for tool-path airtime optimization during leather cutting. In: Advanced materials research, vol 102. Trans Tech Publications, pp 373–377

  45. Ye J, Chen ZG (2013) An optimized algorithm of numerical cutting-path control in garment manufacturing. In: Advanced materials research, vol 796. Trans Tech Publications, pp 454– 457

  46. Yu W, Lu L (2014) A route planning strategy for the automatic garment cutter based on genetic algorithm. In: IEEE congress on evolutionary computation (CEC). IEEE, pp 379–386

Download references

Acknowledgements

We would like to thank Dr. Franklina M B Toledo, Dr. Tavaeva A F, and Dr. Alexander Petunin for helping with the datasets.

Authors’ contributions

Neeta A. Eapen: conceptualization, methodology, software, writing—original draft preparation

Robert B. Heckendorn: conceptualization, methodology, writing—review and editing

Funding

No funding was received to assist with the preparation of this manuscript.

Author information

Authors and Affiliations

  1. National Institute of Technology Calicut, Kerala, India

    Neeta A. Eapen

  2. University of Idaho, Moscow, USA

    Neeta A. Eapen & Robert B. Heckendorn

Authors
  1. Neeta A. Eapen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert B. Heckendorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neeta A. Eapen.

Ethics declarations

Ethical approval

Not applicable

Conflict of interest

The authors declare no competing interests.

Consent to participate

Not applicable

Consent for publication

The authors declare that the JAMT journal has the consent to publish this manuscript.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eapen, N.A., Heckendorn, R.B. Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm. Int J Adv Manuf Technol 113, 3667–3679 (2021). https://doi.org/10.1007/s00170-021-06842-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-021-06842-9

Keywords

Search

Navigation