Abstract
Datum-hierarchy (rooted) trees provide a highly efficient and sound basis for tolerance analysis and automated process planning. This paper builds on the previous work by the authors and shows that it is possible to optimise the structure a datum-hierarchy trees automatically. A process planner specifies an initial tree, which is improved upon by using an evolutionary algorithm and is checked against manufacturing and design constraints. A cost function that takes into account machine changes, datum changes and the sum of tolerance stacks drives the mutation process to generate "minimum cost" trees. Experiments were conducted on four industrial parts to demonstrate the feasibility of the approach. The results demonstrate that the method can reduce machine and datum changes and the sum of tolerance stacks. They also show that the order of priority of the cost criteria has a significant effect on the final shape of the trees.
| Original language | English |
|---|---|
| Pages (from-to) | 44-48 |
| Number of pages | 5 |
| Journal | International Journal of Advanced Manufacturing Technology |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2001 |
Fingerprint
Keywords
- Datum-hierarchy tree
- Minimising tolerance stack-ups
- Optimising process planning
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering
Cite this
Controlling tolerance stacks for efficient manufacturing. / Thimm, G.; Britton, G. A.; Cheong, F. S.
In: International Journal of Advanced Manufacturing Technology, Vol. 18, No. 1, 2001, p. 44-48.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Controlling tolerance stacks for efficient manufacturing
AU - Thimm, G.
AU - Britton, G. A.
AU - Cheong, F. S.
PY - 2001
Y1 - 2001
N2 - Datum-hierarchy (rooted) trees provide a highly efficient and sound basis for tolerance analysis and automated process planning. This paper builds on the previous work by the authors and shows that it is possible to optimise the structure a datum-hierarchy trees automatically. A process planner specifies an initial tree, which is improved upon by using an evolutionary algorithm and is checked against manufacturing and design constraints. A cost function that takes into account machine changes, datum changes and the sum of tolerance stacks drives the mutation process to generate "minimum cost" trees. Experiments were conducted on four industrial parts to demonstrate the feasibility of the approach. The results demonstrate that the method can reduce machine and datum changes and the sum of tolerance stacks. They also show that the order of priority of the cost criteria has a significant effect on the final shape of the trees.
AB - Datum-hierarchy (rooted) trees provide a highly efficient and sound basis for tolerance analysis and automated process planning. This paper builds on the previous work by the authors and shows that it is possible to optimise the structure a datum-hierarchy trees automatically. A process planner specifies an initial tree, which is improved upon by using an evolutionary algorithm and is checked against manufacturing and design constraints. A cost function that takes into account machine changes, datum changes and the sum of tolerance stacks drives the mutation process to generate "minimum cost" trees. Experiments were conducted on four industrial parts to demonstrate the feasibility of the approach. The results demonstrate that the method can reduce machine and datum changes and the sum of tolerance stacks. They also show that the order of priority of the cost criteria has a significant effect on the final shape of the trees.
KW - Datum-hierarchy tree
KW - Minimising tolerance stack-ups
KW - Optimising process planning
UR - http://www.scopus.com/inward/record.url?scp=0034813373&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034813373&partnerID=8YFLogxK
U2 - 10.1007/s001700170092
DO - 10.1007/s001700170092
M3 - Article
VL - 18
SP - 44
EP - 48
JO - International Journal of Advanced Manufacturing Technology
JF - International Journal of Advanced Manufacturing Technology
SN - 0268-3768
IS - 1
ER -