Expand description
Cutting sequence optimization.
Determines the optimal order to cut contours, minimizing non-cutting (rapid) travel distance while respecting precedence constraints.
§Algorithms
- Nearest Neighbor (NN): Greedy construction heuristic that always selects the closest uncut contour that doesn’t violate precedence.
- Constrained 2-opt: Local search improvement that reverses sub-sequences only when no precedence constraints are violated.
§References
- Dewil et al. (2016), Section 4: “Construction heuristics”
Structs§
- Sequence
Result - Result of sequence optimization.
Functions§
- optimize_
sequence - Optimizes the cutting sequence using Nearest Neighbor + constrained 2-opt.
- optimize_
sequence_ with_ adjacency - Optimizes the cutting sequence with optional common-edge adjacency bonus.