Effective location of micro joints and generation of tool path using heuristic and genetic approach for cutting sheet metal parts

Kandasamy, Vijay Anand; Udhayakumar, S.

doi:10.1007/s12289-019-01488-1

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike discontinuous cutting, which uses algorithms such as simulated annealing [10], genetic [11], cuckoo [12] and ant [13], continuous cutting requires the tool to cut all contours at once during the cutting process. Regarding the processing of continuous cutting, many scholars have studied it.…”

Section: Introductionmentioning

confidence: 99%

Optimization Cutting Trajectory for Ring Knife Sponge Cutting via S-Shaped Sequencing Algorithm Based on Region Segmentation

Xie,

Zhu

2023

IEEE Access

View full text Add to dashboard Cite

Continuous cutting of sponge samples is a key technique for efficient cutting with sponge ring cutters. However, existing methods are not suitable for complex-shaped and large quantities of sponge samples. To address this issue, this paper proposes a S-shaped Sequencing Algorithm Based on Region Segmentation. Firstly, the algorithm separates the sample set into multiple molecular regions using the inflexion point samples. Then, global and local sorting are performed on each molecular region to determine the optimized search sequence. Next, entry and exit points are defined, and pre-generated processing paths for the samples within the region are created. Path collisions are identified and eliminated, resulting in the optimal cutting sequence for the samples within the molecular region. Experimental results demonstrate that this algorithm effectively reduces the empty travel distance and collision occurrences during the cutting process. Compared to manual methods, this algorithm can reduce the empty travel distance by 14-25%. In the next step, the algorithm will generate processing code to facilitate the practical application of the algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimization Cutting Trajectory for Ring Knife Sponge Cutting via S-Shaped Sequencing Algorithm Based on Region Segmentation

Xie,

Zhu

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…A model based on graph theory is presented in Makarovskikh et al (2017) to solve the ICP and the ECP; the authors use a group of algorithms to find the cutting pattern. Finally, in Kandasamy and Udhayakumar (2019), the problem of cutting the sheet metal parts is solved by introducing the concept of microjoints. The authors develop a genetic algorithm seeking to minimize the tool time in the air and locate the microjoints in the plate efficiently.…”

Section: Introductionmentioning

confidence: 99%

Modeling and solving the endpoint cutting problem

Cuellar‐Usaquén

Palacio

Ospina

et al. 2021

Int Trans Operational Res

View full text Add to dashboard Cite

The material cutting process consists of two NP-hard problems: first, it is necessary to find the optimal cutting pattern to minimize the waste area. Second, it is necessary to find the cutting sequence over the plate to extract the pieces in the shortest possible time. The structure of the cutting path problem can vary according to the technology used in the process. In industries where material can be considered a commodity, the cutting path is decisive due to the need to operate economically and efficiently. These types of minimization demand exact models that use nonconventional formulation techniques in search of computational efficiency and for heuristic processes to be specialized so that a good solution is guaranteed. In this paper, three different approaches were proposed. First, a novel and accurate formulation was presented based on a network flow structure. Second, a reactive GRASP algorithm with solution filtering was designed, using seven operators executed under two randomly selected local search philosophies. Finally, four warm-start variants were designed hybridizing the GRASP algorithm subprocedures with the exact model. The approaches are compared through benchmarking; for this, a set of instances composed of cutting patterns taken from the solution of classical instances of the two-dimensional cutting problem was created and made available. The obtained results show that all three approaches solve the problem successfully. Additionally, the computing time is analyzed, illustrating the pros and cons of each approach. Given the cutting path, including the quality of the pieces is left as a future work proposal.

show abstract

Discrete cutting path problems: a general solution framework and industrial applications

Khachai,

Battaïa,

Petunin

et al. 2024

International Journal of Production Research

View full text Add to dashboard Cite

Effective location of micro joints and generation of tool path using heuristic and genetic approach for cutting sheet metal parts

Cited by 4 publications

References 19 publications

Optimization Cutting Trajectory for Ring Knife Sponge Cutting via S-Shaped Sequencing Algorithm Based on Region Segmentation

Optimization Cutting Trajectory for Ring Knife Sponge Cutting via S-Shaped Sequencing Algorithm Based on Region Segmentation

Modeling and solving the endpoint cutting problem

Discrete cutting path problems: a general solution framework and industrial applications

Contact Info

Product

Resources

About