Abstract
In view of the disadvantages of the current cutting path optimization methods of sheet metal parts, a new method based on ant colony algorithm was proposed in this paper. The cutting path optimization problem of sheet metal parts was taken as the research object. The essence and optimization goal of the optimization problem were presented. The traditional serial cutting constraint rule was improved. The cutting constraint rule with cross cutting was proposed. The contour lines of parts were discretized and the mathematical model of cutting path optimization was established. Thus the problem was converted into the selection problem of contour lines of parts. Ant colony algorithm was used to solve the problem. The principle and steps of the algorithm were analyzed.
The Challenge of Empty Travel in CNC Cutting
In CNC laser cutting, efficiency is primarily determined by the total time the machine spends in operation. While cutting speeds are high, a significant portion of time is lost to "empty travel"—the distance the laser head moves while turned off between the end of one cut and the start of the next.
Traditionally, this is modeled as a Traveling Salesman Problem (TSP) where each part is treated as a single node. This approach relies on a "serial cutting" constraint, requiring the laser to finish the entire perimeter of one part before moving to the next. However, this self-imposed restriction often results in suboptimal paths.
Breaking the Serial Constraint: The Cross-Cutting Rule
This research proposes a "cross-cutting" strategy that allows the laser head to transfer between the contours of different parts before a single part is completed. By allowing the laser to "weave" through the nest of parts, the search space for optimization expands, enabling much more efficient routes.
To implement this, the authors discretize the contour lines of all parts into a set of line segments. The problem then shifts from ordering parts to ordering these discrete segments. This transformation allows the algorithm to find shortcuts that traditional part-by-part methods would miss.
Solving with Ant Colony Optimization (ACO)
To navigate the resulting complex combinatorial space, the study employs Ant Colony Optimization. This metaheuristic uses "virtual ants" to explore sequences of line segments. Paths that minimize empty travel distance are reinforced with higher "pheromone" scores, leading the colony to converge on a near-optimal path over multiple iterations.
The model explicitly accounts for the laser's cycle starting and ending at a home position (Point O), ensuring the optimization covers the entire machine operation cycle.
Key Results and Future Directions
Theoretical proofs using two-part examples demonstrate that the empty travel distance for serial cutting is mathematically longer than the proposed cross-cutting path. The authors provide a 12-step implementation framework for the ACO, including specific formulas for heuristic factors and pheromone updates.
While the mathematical foundation is robust, future work should address more complex geometries, such as parts with internal holes or shared edges (common line cutting). Additionally, empirical validation on physical CNC machines will be necessary to quantify the real-world productivity gains.
Summary updated