Library of Sample Image Instances for the Cutting Path Problem

Петунин, А. А.; Khalyavka, Alexander; Khachay, Michael; Kudriavtsev, Andrei; Chentsov, P. A.; Polishchuk, E. G.; Ukolov, Stanislav

doi:10.1007/978-3-030-68821-9_21

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance evaluation of multi-contour technique application for selected group of parts compared with standard cutting technique application was completed at the example of two nesting maps contained real parts. The examples of nesting maps were taken from open library CPPLib [18]. As a base of compared the algorithm CCP-Relax is used for cutting path generation using standard cutting technique [19].…”

Section: Computing Experimentsmentioning

confidence: 99%

Application of Multi-Contour Cutting in Algorithms for Solving the Cutting Path Problem

2021

Self Cite

View full text Add to dashboard Cite

The cutting path problem for CNC sheet metal cutting equipment is considered in this article. The method of multi-contour cutting application is described for solving Cutting Path Problem (CPP). The method is to be combine contours in «blocks» (groups) and cutting of several contours is performed by using special cutting techniques (common cut, «chained» cutting) in order to reduce values of cutting tool length and number of piercings compared with standard cutting technique (where only idle path is minimized) The article presents results of solving cutting path problem computing experiments using proposed method (multi-contour cutting with common cut) and algorithm CCP-Relax (in which the standard cutting technique is used). The examples of testing are performed by using several instances from Library CPPLib.

show abstract

Section: Computing Experimentsmentioning

confidence: 99%

Application of Multi-Contour Cutting in Algorithms for Solving the Cutting Path Problem

2021

Self Cite

View full text Add to dashboard Cite

show abstract

Применение Мультиконтурной Резки В Алгоритмах Построения Кратчайшего Пути Режущего Инструмента

Таваева

2021

Моделирование

View full text Add to dashboard Cite

В статье рассматривается проблема маршрутизации режущего инструмента машин листовой резки с числовым программным управлением (далее по тексту ЧПУ). Даны классификация задач маршрутизации и описание алгоритмов решения. В работе предложен подход к решению задачи прерывистой резки (Intermittent Cutting Problem, ICP) с точки зрения применения мультиконтурной резки, когда несколько контуров вырезаются одним движением режущего инструмента. Предлагаемый в статье метод заключается в следующем: контуры деталей объединяются в «блоки», при этом вырезка контуров происходит с применением совмещенного реза с использованием зачастую одной точки врезки. В статье выделены три группы деталей (прямоугольные, треугольные и детали с наружным контуром типа трапеция), для которых применим предлагаемый метод. При этом допускается наличие отверстий и пазов внутри деталей. Детали изготавливаются из листового материала на технологическом оборудовании с ЧПУ. Приведены некоторые результаты численных экспериментов в сравнении с решением задачи с помощью алгоритма CCP-Relax, где применяется стандартная резка контуров. Расчет был выполнен для раскройных карт, взятых из открытой библиотеки тестовых примеров CPPLib. The cutting path problem for sheet cutting machines with computer numerical control (further - CNC) is considered in this article. The classification of routing problem is given and description of algorithms for solving this problem is given too. The method of Intermittent Cutting Problem is proposed. This method based on application of multi-contour cutting techniques, namely common cut (when several contours are cut by one motion of cutter). The proposed method is to be combined parts in «blocks» and cutting of contours is performed by common cut application usually with one piercing. The three classes of parts (rectangular, triangular and parts with outer contour type like trapezium) are highlighted for which the proposed method is applicable. At the same time presence of inner contours is allowed. The some results of computing experiments are given compared with problem solution obtained by CCP-Relax algorithm (where the standard cutting technique is used). The calculation was performed for nesting maps from open library CPPLib.

show abstract

Library of Sample Image Instances for the Cutting Path Problem

Cited by 2 publications

References 12 publications

Application of Multi-Contour Cutting in Algorithms for Solving the Cutting Path Problem

Application of Multi-Contour Cutting in Algorithms for Solving the Cutting Path Problem

Применение Мультиконтурной Резки В Алгоритмах Построения Кратчайшего Пути Режущего Инструмента

Contact Info

Product

Resources

About