Sequential optimization approach for nesting and cutting sequence in laser cutting

Sherif, S. Umar; Jawahar, N.; Balamurali, Mehala

doi:10.1016/j.jmsy.2014.05.011

Cited by 36 publications

(10 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• На практике задача оптимизации маршрута режущего инструмента зачастую сводится к дискретной оптимизации за счёт выбора конечного множества возможных точек врезки на контурах деталей с некоторым заранее заданным шагом ε, то есть сводится к задаче ECP [4][5][6] и её частному случаю -GTSP [7][8][9][10]. Задача непрерывной резки CCP тоже может сводиться к GTSP, в этом случае суммарная ошибка длины холостого хода оценивается как , где N -количество контуров.…”

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

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

“…With the help of which tool paths can be generated that are 4.2% faster than other which are generated by an existing tool path construction heuristic method. S Umar Sherif, N Jawahar, and Balamurali [7] Thepaper deals with generating an optimal sequence for cutting using a simutaled annealing algorithm (SAA). The proposed SAA is shown with the utilization of the optimum material.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimizing Tool Path Sequence Of Plasma Cutting Machine Using TSP Approach

Sonawane¹,

Patil²,

Bharsakade³

et al. 2020

E3S Web Conf.

View full text Add to dashboard Cite

The paper consists of optimizing the total distance traveled by the Plasma Cutting Tool Head. It is cross-functional implementation traveling salesman problem to the core manufacturing process of plasma cutting. This study contributes to reduce the total rapid traverse length (Total Through-Air Travelled Distance) by the cutting tool (Plasma Beam), which is totally a non-productive as well as non-value adding process contributing to the machine running costs and cycle time of the product directly and indirectly. For deriving this optimal sequence for the plasma cutting head, a heuristic algorithm is used. This algorithm calculates an optimal solution for a problem creating the best possible sequence. The greedy algorithm follows the problem-solving heuristics of making a locally optimal choice at every stage, finally integrating a globally optimal solution. Hence after deducing this optimal sequence and when accompanied by the Plasma Cutting tool, it resulted in the least distance traveled, contributing to minimizing cost and energy savings of the machine and simultaneously reducing the total traveled distance and similarly the cycle time.

show abstract

“…Sherif et al [69] consider minimizing the air movements for laser cutting excluding precedence constraints. They Fig.…”

Section: Ecpmentioning

confidence: 99%

“…Manber and Israni [64] H P, I, CC, Pi, Br Wah et al [65] G A P , A Moreira et al [66] H P , I , C C Imahori et al [67] H P , I , C C Rodriguez and Soeiro [68] MA P ,A Kolakowska et al [70] CP P, A, Timed constraints Sherif et al [69] S A P , A Dewil et al [ [78] H / G A P , A , ( B r )…”

Section: Referencementioning

confidence: 99%

A review of cutting path algorithms for laser cutters

Dewil

Vansteenwegen

Cattrysse

2016

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper presents a review of the literature on generating cutting paths for laser cutting machines. Firstly, the cutting path problem is defined including all relevant technical side constraints which exist plentifully in laser cutting. Secondly, a former classification method is updated to include all types of cutting path problems. Thirdly, a comprehensive review of solution methods and related applications is presented. Throughout the literature review, trends in research in cutting path generation and interesting areas for future research are identified.

show abstract

Sequential optimization approach for nesting and cutting sequence in laser cutting

Cited by 36 publications

References 40 publications

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

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

Optimizing Tool Path Sequence Of Plasma Cutting Machine Using TSP Approach

A review of cutting path algorithms for laser cutters

Contact Info

Product

Resources

About