Abstract
In laser sheet metal cutting processes, the rationality and efficiency of tool path planning determine the machining efficiency and cost. For parts with complex topological structures, the machining process is subject to process sequences such as inner-before-outer. This study focuses on such path planning problems with strict job precedence orders. We model it as the precedence constrained generalized traveling salesman problem and propose an effective adaptive iterated local search algorithm to solve it with large instances. The algorithm combines the variable neighborhood descent to find high-quality local optima and a simulated annealing-based adaptive acceptance criterion to escape local optima and generate diversified solutions. We present the computational results of 39 benchmark instances. The experimental results indicate that the algorithm is significantly superior to an iterated local search algorithm and the Gurobi solver in terms of solution quality, validating the effectiveness of the AILS algorithm in solving large sheet metal cutting path planning problems.
| Original language | English |
|---|---|
| Title of host publication | 2026 International Conference on Intelligent Manufacturing and Automation, IMA 2026 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 86-90 |
| Number of pages | 5 |
| ISBN (Electronic) | 9798331562250 |
| DOIs | |
| Publication status | Published - 19 May 2026 |
| Externally published | Yes |
| Event | 2026 International Conference on Intelligent Manufacturing and Automation, IMA 2026 - Nanjing, China Duration: 16 Jan 2026 → 18 Jan 2026 |
Publication series
| Name | 2026 International Conference on Intelligent Manufacturing and Automation, IMA 2026 |
|---|
Conference
| Conference | 2026 International Conference on Intelligent Manufacturing and Automation, IMA 2026 |
|---|---|
| Country/Territory | China |
| City | Nanjing |
| Period | 16/01/26 → 18/01/26 |
Bibliographical note
Publisher Copyright:©2026 IEEE.
Funding
This work is partially supported by the National Natural Science Foundation Program of China (Grant No. 62403123). The Fundamental Research Funds for the Central Universities, China (Grant No. MCCSE2024B03).
Keywords
- Iterated local search
- Path planning
- Traveling salesman
Fingerprint
Dive into the research topics of 'Adaptive Iterated Local Search for Path Planning with Job Priority Constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver