Path optimization in 3D printer: Algorithms and experimentation system

Abstract

3d Printers create an object by printing thousands of successive thin layers. Each layer is created by the printing tool which moves on the selected paths. The ability to reduce the total length of printing paths results in lower overall time needed for printing process. In this paper there are presented two hybrid algorithms for that purpose, Greedy Two Opt and Greedy Annealing. Both of them based on the same assumption that it is profitable to select initial solution with fast algorithm and after that, to try to improve it by further exploration of the solution space with the other one. The simulations made with the designed experimentation system confirmed good properties of the implemented algorithms.