iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1134/S0005117917050095
Mathematical models and routing algorithms for CAD technological preparation of cutting processes | Automation and Remote Control Skip to main content
Springer Nature Link
Log in

Mathematical models and routing algorithms for CAD technological preparation of cutting processes

  • Computer-Aided Information Control Systems, Process Control Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Resource-conscious technologies for cutting sheet material include the ICP and ECP technologies that allow for aligning fragments of the contours of cutouts. In this work, we show the mathematical model for the problem of cutting out parts with these technologies and algorithms for finding cutting tool routes that satisfy technological constraints. We give a solution for the problem of representing a cutting plan as a plane graph G = (V,F,E), which is a homeomorphic image of the cutting plan. This has let us formalize technological constraints on the trajectory of cutting the parts according to the cutting plan and propose a series of algorithms for constructing a route in the graph G = (V,F,E), which is an image of an admissible trajectory. Using known coordinates of the preimages of vertices of graph G = (V,F,E) and the locations of fragments of the cutting plan that are preimages of edges of graph G = (V,F,E), the resulting route in the graph G = (V,E) can be interpreted as the cutting tool’s trajectory.

The proposed algorithms for finding routes in a connected graph G have polynomial computational complexity. To find the optimal route in an unconnected graph G, we need to solve, for every dividing face f of graph G, a travelling salesman problem on the set of faces incident to f.

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

  1. Kantorovich, L.V. and Zalgaller, V.A., Ratsional’nyi raskroi promyshlennykh materialov (Rational Cutting of Industrial Materials), St. Petersburg: Nevskii Dialekt, 2012.

    Google Scholar 

  2. Kartak, V.M., Mesyagutov, M.A., Mukhacheva, E.A., and Filippova, A.S., Local Search of Orthogonal Packings Using the Lower Bounds, Autom. Remote Control, 2009, vol. 70, no. 6, pp. 1054–1066.

    Article  MathSciNet  MATH  Google Scholar 

  3. Filippova, A.S., A Survey of Methods for Solving Cutting–Packing Problems in the Ufa Science School of E.A. Mukhacheva, Proc. All-Russian Conf. Statistics. Modeling. Optimization, Chelyabinsk, Nov. 28–Dec. 3, 2011, Chelyabinsk: YuUrGU, 2011, pp. 73–85.

    Google Scholar 

  4. EURO Special Interest Group on Cutting and Packing. http://www.fe.up.pt/esicup

  5. Dewil, R., Vansteenwegen, P., Cattrysse, D., Laguna, M., and Vossen, T., An Improvement Heuristic Framework for the Laser Cutting Tool Path Problem, Int. J. Product. Res., 2015, vol. 53, no. 6, pp. 1761–1776.

    Article  Google Scholar 

  6. Xie, S.Q. and Gan, J., Optimal Process Planning for Compound Laser Cutting and Punch Using Genetic Algorithms, Int. J. Mechatron. Manuf. Syst., 2009, vol. 2, nos. 1/2, pp. 20–38.

    Google Scholar 

  7. Jing Y. and Zhige C., An Optimized Algorithm of Numberical Cutting-Path Control in Garment Manufacturing, Adv. Mater. Res., 2013, vol. 796, pp. 454–457.

    Article  Google Scholar 

  8. Murzakaev, R.T., Shilov, V.S., and Burylov, A.V., Using Metaheuristic Algorithms to Minimize the Free Movement Length of a Cutting Tool, Vest. PNIPU, Elektrotekh., Inf. Tekhnol., Sist. Upravlen., 2015, no. 14, pp. 123–136.

    Google Scholar 

  9. Lee, M.K. and Kwon, K.B., Cutting Path Optimization in CNC Cutting Processes Using a Two-Step Genetic Algorithm, Int. J. Product. Res., 2006, vol. 44, no. 24, pp. 5307–5326.

    Article  MATH  Google Scholar 

  10. Hoeft, J. and Palekar, U.S., Heuristics for the Plate-Cutting Traveling Salesman Problem, IIE Trans., 1997, vol. 29, no. 9, pp. 719–731.

    Google Scholar 

  11. Verkhoturov, M.A. and Tarasenko, P.Yu., Mathematical Modeling for the Optimization Problem for the Path of a Cutting Tool for Planar Profiled Cutting Based on Chain Cutting, Vest. UGATU, Upravlen, Vychisl. Tekh., Informatika, 2008, vol. 10, no. 2(27), pp. 123–130.

    Google Scholar 

  12. Ganelina, N.D. and Frolovskii, V.D., A Study of the Methods for Constructing a Shortest Traversal of Segments on a Plane, Sib. Zh. Vychisl. Mat., 2006, vol. 9, no. 3, pp. 241–252.

    Google Scholar 

  13. Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On the Problem of Routing the Tool Movement in Sheet Cutting Machines with Computerized Numerical Control, Nauchn.-Tekhn. Vedomosti SPbGPU, Ser. “Informatika. Telekommunikatsii. Upravlen.”, 2013, no. 169, pp. 103–111.

    Google Scholar 

  14. Garfinkel, R.S. and Webb, I.R., On Crossings, the Crossing Postman Problem, and the Rural Postman Problem, Networks, 1999, vol. 34(3), pp. 173–180.

    Article  MathSciNet  MATH  Google Scholar 

  15. Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Routing Algorithms for Systems of Technological Preparation for Cutting Processes, Proc. 15th Intl. Conf. Design Systems for Industrial Technological Preparation and Control over Stages of an Industrial Product Lifecycle (SAD/SAM/RDM–2015), Tolok, A.V., Ed., Moscow: OOO “Analitik,” 2015, p. 66. http://lab18.ipu.ru

    Google Scholar 

  16. Zykov, A.A., Osnovy teorii grafov (Fundamentals of Graph Theory), Moscow: Vuzovskaya Kniga, 2004.

    MATH  Google Scholar 

  17. Panyukova, T.A. and Panyukov, A.V., The Algorithm for Tracing of Flat Euler Cycles with Ordered Enclosing, Izv. Chelyabinsk. Nauchn. Tsentra UrO RAN, 2000, no. 4, pp. 18–22. URL: http://elibrary.ru/ item.asp?id=1614035

    MathSciNet  Google Scholar 

  18. Panioukova, T.A. and Panyukov, A.V., Algorithms for Construction of Ordered Enclosing Traces in Planar Eulerian Graphs, Proc. 5th Int. Workshop on Computer Science and Information Technologies (CSIT’2003), September 16–18, 2003, Ufa: Gos. Tekhn. Univ., 2003, vol. 1, pp. 134–138.

    Google Scholar 

  19. Panyukova, T.A. and Savitskiy, E.A., Algorithm for Checking the Cutting Route in a Cutting Plan for the Ordered Enclosing Condition, Proc. XII All-Russian Seminar on Control Problems, VSPU-2014, Moscow, June 16–19, 2014, Moscow: Inst. Probl. Upravlen,, 2014, pp. 9315–9318.

    Google Scholar 

  20. Fleichner, H., Beineke, L.W., and Wilson, R.J., Eulerian Graphs, in Selected Topics in Graph Theory 2, New York: Academic, 1983, pp. 17–53.

    Google Scholar 

  21. Fleischner, H., Eulerian Graphs and Related Topics, Ann. Discr. Math., 1991, no. 50, part 1, vol. 2.

    Google Scholar 

  22. Panyukova, T.A, Eulerian Cover with Ordered Enclosing for Flat Graphs, Electron. Notes Discr. Math., 2007, vol. 28, pp. 17–24.

    Article  MathSciNet  MATH  Google Scholar 

  23. Panyukova, T.A., Chain Sequences with Ordered Enclosing, J. Comput. Syst. Sci. Int., 2007, vol. 46, no. 1, pp. 83–92.

    Article  MathSciNet  MATH  Google Scholar 

  24. Panyukova, T.A., Chains with Ordered Enclosing in Planar Graphs, Diskret. Anal. Issled. Oper., 2006, vol. 13, no. 2, pp. 31–43.

    MathSciNet  MATH  Google Scholar 

  25. Panyukova, T.A., Optimal Eulerian Coverage for Planar Graphs, Diskret. Anal. Issled. Oper., 2011, vol. 18, no. 2, pp. 64–74.

    MathSciNet  MATH  Google Scholar 

  26. Panyukova, T.A., Optimizing Resource Use for Technological Preparation of the Cutting Process, Prikl. Informat., 2012, no. 3, pp. 20–32.

    Google Scholar 

  27. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

  28. Panyukova, T.A. and Savitskiy, E.A., A Program for Constructing Optimal Coverages with Ordered Enclosing for Multiconnected Graphs, Computer Programs. Databases. Integral Circuit Topologies. Official Bull. Rus. Agency of Patents and Trademarks, no. 8(126), Moscow: FIPS, 2011, reg. no. 2011617777, p. 150.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. South Ural State University (NRU), Chelyabinsk, Russia

    T. A. Makarovskikh, A. V. Panyukov & E. A. Savitskiy

Authors
  1. T. A. Makarovskikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Panyukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. A. Savitskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. A. Makarovskikh.

Additional information

Original Russian Text © T.A. Makarovskikh, A.V. Panyukov, E.A. Savitskiy, 2017, published in Avtomatika i Telemekhanika, 2017, No. 5, pp. 123–140.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Makarovskikh, T.A., Panyukov, A.V. & Savitskiy, E.A. Mathematical models and routing algorithms for CAD technological preparation of cutting processes. Autom Remote Control 78, 868–881 (2017). https://doi.org/10.1134/S0005117917050095

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117917050095

Keywords

Search

Navigation