On the new Algorithm for Solving Continuous Cutting Problem

Петунин, А. А.; Polishchuk, E. G.; Ukolov, Stanislav

doi:10.1016/j.ifacol.2019.11.552

Cited by 16 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Savo ruožtu toks gamybos proceso modifikavimas turi užtikrinti proceso tvarumo reikalavimus, o ypač tuos, kurie yra susiję su aplinkosauga (Petunin et al, 2019 Remiantis jais aplinkosauginiu aspektu svarbiausias yra pirmasis, kuris apibendrina ir taršą kietosiomis dalelėmis darbo vietoje.…”

Section: įVadasunclassified

Kietųjų dalelių taršos galandinimo proceso metu tyrimas

Matijošius

Rimkus

Juchnevičius

et al. 2021

DAV

View full text Add to dashboard Cite

Nuolat modernėjant pramonei vis labiau į akiratį patenka metalo apdirbimo darbinėje aplinkoje esantys organizmai ir jų galimai sukeliami apdirbimo procesų metu išsiskiriančių kietųjų dalelių, patekusių į gyvų organizmų vidų, neigiami padariniai. Smulkiausios kietosios dalelės, patekusios į žmogaus organizmą, patenka ne tik į plaučių bronchinio medžio smulkiausius taškus, tačiau gali užteršti ir kraujotaką, todėl tyrimo metu buvo nuspręsta identifikuoti kietųjų dalelių taršos pokytį galandinimo proceso metu, įvertinti darbinės aplinkos trūkumus ir pateikti efektyvius problemos sprendimo būdus.

show abstract

Section: įVadasunclassified

Kietųjų dalelių taršos galandinimo proceso metu tyrimas

Matijošius

Rimkus

Juchnevičius

et al. 2021

DAV

View full text Add to dashboard Cite

show abstract

“…Предлагаемый алгоритм решения задачи непрерывной резки (см. [15]) состоит из нескольких шагов, что хорошо соответствует самой природе решаемой задачи.…”

Section: рис 1 классификация задач резкиunclassified

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

Петунин¹,

Polishchuk²,

Ukolov³

2021

IZVESTIYA SFedU. ENGINEERING SCIENCES

View full text Add to dashboard Cite

show abstract

“…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%

“…In overwhelming part of articles on the research issue the discretization of the boundary contours is used [6][7][8][9][10][11][12][13], consequently the various mathematical models of discreet optimization may be used. We can only mention some articles where optimization algorithms are focused on finding solutions among continuum sets [14][15][16][17]. Generally it should be noted disadvantages of research about problems of special cutting techniques application and methods of their use in design of cutting path in CAM.…”

Section: Introductionmentioning

confidence: 99%

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

2021

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

On the new Algorithm for Solving Continuous Cutting Problem

Cited by 16 publications

References 26 publications

Kietųjų dalelių taršos galandinimo proceso metu tyrimas

Kietųjų dalelių taršos galandinimo proceso metu tyrimas

A New Algorithm for Constructing the Shortest Tour of a Finite Set of Disjoint Contours on a Plane

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

Contact Info

Product

Resources

About