.png){kind=icon}
.png){kind=icon}
Return
Discrete cutting path problems: a general solution framework and industrial applications
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2024.2365360.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The optimal tool routing for cutting machines, also known as cutting path optimisation is an important problem in production research. This problem is relevant in various manufacturing environments such as aeronautic, automotive, garment and semiconductor industries. In this paper, we introduce a general solution framework for the discrete Cutting Path Problem which includes: (i) the universal approach to reduce numerous settings of this problem to the appropriate auxiliary instances of the well-known Precedence Constrained Generalized Traveling Salesman Problem; (ii) the proposition of efficient solution methods for finding (sub-) optimal solutions. We carry out extensive computational experiments in order to evaluate performance of the proposed framework and the obtained results demonstrate its efficiency for real-life industrial instances.
Keywords:
Cutting path problem
endpoint cutting problem
precedence constrained generalised travelling salesman problem
branch-and-cut algorithm
adaptive large neighbourhood search
industry
innovation and infrastructure
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
View more organizations