2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) 2016
DOI: 10.1109/cyberc.2016.80
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Abstract-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, a relaxation scheme for TSP-based 3D printing path optimizer is proposed. Simulatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
3
1

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…Their simulation results show that their algorithms can provide decent solutions to RPP with relatively low computational complexities. Recently, Fok et al formulated the nozzle motion planning problem as a TSP and proposed a relaxation scheme for shortening the processing time without causing significant impact to the model print time [27]. However, different from ACO, Christofides' and Frederickson's algorithms cannot be benefited from parallel processing.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Their simulation results show that their algorithms can provide decent solutions to RPP with relatively low computational complexities. Recently, Fok et al formulated the nozzle motion planning problem as a TSP and proposed a relaxation scheme for shortening the processing time without causing significant impact to the model print time [27]. However, different from ACO, Christofides' and Frederickson's algorithms cannot be benefited from parallel processing.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this work, we adopt the nozzle motion model in [8] for calculating t d (v i , v j ) in (1). Such model considers the acceleration and deceleration of the nozzle and thus allows its velocity to be varied while traversing an edge.…”
Section: ) Motion Modelmentioning
confidence: 99%
“…The filling density was set to be 10% of the total volume. The print plans were further optimized using the relaxation scheme proposed in [8]. Nevertheless, for comparison purposes, the path optimization module in each set of simulations is replaced with different combinations of Frederickson's algorithm, 2-opt, and the proposed refinement process.…”
Section: A Simulation Settingsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to minimize the amount of materials used to form the supporting structures, they proposed an algorithm which can select an appropriate orientation according to the model to be built. In [5], Fok et al proposed a print plan optimizer based on a deterministic method by which sub-optimum solutions were obtained with a reasonable computational cost. Recently, they formulated the nozzle path planning problem in 3D printing applications into a URPP [6].…”
Section: Introductionmentioning
confidence: 99%