A route planning strategy for the automatic garment cutter based on genetic algorithm

Yu, Wenchao; Lin-ji, LU

doi:10.1109/cec.2014.6900425

Cited by 12 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Dewil et al [7] presented and classified these methods based on the approach used to traverse the vertices of the polygons. They identified three categories: the touring polygons problem [16,17], traveling salesman problem (TSP) [18,19], generalized TSP (GTPS) [20,21], and TSP with neighborhoods (TSP-N) [22].…”

Section: Literature Reviewmentioning

confidence: 99%

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

Junior,

de Carvalho,

Santos

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

Efficiently cutting smaller two-dimensional parts from a larger surface area is a recurring challenge in many manufacturing environments. This point falls under the cut-and-pack (C&P) problems. This study specifically focused on a specialization of the cut path determination (CPD) known as the laser cutting path planning (LCPP) problem. The LCPP aims to determine a sequence of cutting and sliding movements for the head that minimizes the parts’ separation time. It is important to note that both cutting and glide speeds (moving the head without cutting) can vary depending on the equipment, despite their importance in real-world scenarios. This study investigates an adaptive biased random-key genetic algorithm (ABRKGA) and a heuristic to create improved individuals applied to LCPP. Our focus is on dealing with more meaningful instances that resemble real-world requirements. The experiments in this article used parameter values for typical laser cutting machines to assess the feasibility of the proposed methods compared to an existing strategy. The results demonstrate that solutions based on metaheuristics are competitive and that the inclusion of heuristics in the creation of the initial population benefits the execution of the evolutionary strategy in the treatment of practical problems, achieving better performance in terms of the quality of solutions and computational time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

Junior,

de Carvalho,

Santos

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Dewil et al [25] proposed grouping these methods according to the technique for traversing the vertices of the polygons. Three categories (here presented with examples of studies that employ such an approach) were identified by the authors: the touring polygons problem [26,27]), the traveling salesman problem (TSP) [28,29], the generalized TSP [30,31], and the TSP with neighborhoods [21]. Figure 2 presents a classification for CPD and the degree of generalization for this problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

et al. 2021

View full text Add to dashboard Cite

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut path (MTCP) problem, which aims to identify a sequence of cutting and sliding movements for the head device to minimize manufacturing time. Both cutting and slide speeds (just moving the head) vary according to equipment, despite their relevance in real-world scenarios. This study applied the MTCP problem on the practical scope and presents two metaheuristics for tackling more significant instances that resemble real-world requirements. The experiments presented in this study utilized parameter values from typical laser cutting machines to assess the feasibility of the proposed methods compared to existing commercial software. The results show that metaheuristic-based solutions are competitive when addressing practical problems, achieving increased performance regarding the processing time for 94% of the instances.

show abstract

“…• На практике задача оптимизации маршрута режущего инструмента зачастую сводится к дискретной оптимизации за счёт выбора конечного множества возможных точек врезки на контурах деталей с некоторым заранее заданным шагом ε, то есть сводится к задаче 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

A route planning strategy for the automatic garment cutter based on genetic algorithm

Cited by 12 publications

References 10 publications

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

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

Contact Info

Product

Resources

About