A Relaxation Scheme for TSP-Based 3D Printing Path Optimizer

摘要

Additive-layered manufacturing has gained attention in recent years as it has many advantages over conventional injection moulding methods. The optimization of printing trajectories can be formulated as a travelling salesman problem (TSP) and solved accordingly. However, computational complexities of ordinary TSP solvers can increase tremendously with the scale of the problem, which make them impractical. In this work, are laxation scheme for TSP-based 3D printing path optimizer is proposed. Simulation results show that the proposed scheme can significantly shorten the computational time of the optimization process with insignificant impact on solution quality.