.png){kind=icon}
返回
Heuristic approaches for the cutting path problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2023.121567.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the extensive application of laser cutting, the proper planning of the cutting path has a significate impact on industrial production, like clothing, metalware, and furniture. This paper proposes heuristic approaches for the two-dimensional cutting path problem, which aims to find the shortest path to cut pieces from the master plate. Two cutting methods, the arc routing method, and the node routing method, are studied based on whether the piece must be cut separately. A two-step heuristic approach is proposed for the arc routing method. A model based on a generalized traveling salesman problem (GTSP) and a variable neighborhood search (VNS) is introduced for the node routing method. The results show that the proposed two-step heuristic quickly finds the optimal or near-optimal solution. CPLEX using the GTSP model can solve small-size instances, while the VNS can find the solution with good quality in a reasonable time for medium-size instances. In addition, the model and approaches are also tested on larger instances with more than 250 pieces and 20,000 nodes. The results show that the proposed heuristics can handle these instances within a reasonable time.
Keyword:
Cutting path
Mathematical models
Heuristic algorithms
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Data mining based framework to assess solution quality for the rectangular 2D strip-packing problem
OAAI
OAAI分享收藏Cutting path optimization in CNC cutting processes using a two-step genetic algorithm使用两步遗传算法在数控切割过程中优化切割路径
PREAI
分享收藏Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏Staphylococcal superantigen-like protein 13 activates neutrophils via Formyl Peptide Receptor 2
OAAI
IF0
OAAI分享收藏
查看更多内容