Abstract

In this paper, we propose two efficient algorithms for optimal allocation of tolerance among the components of complex assembly with large number of constraints and entities. Basic concepts of hierarchical interval constraint networks have been used for deriving the objective functions and constraint functions of the problem. The optimization problem is then solved by two different algorithms and the results are compared. The first algorithm is based on Lagrange multipliers and the second one is developed based on an iterative relative sensitivity analysis procedure. The relative sensitivity analysis algorithm can practically handle any number of constraints and entities with required level of accuracy, whereas the Lagrange multiplier algorithm is more suitable for simple problems. The proposed algorithms accept any type of cost-tolerance relationship for modeling. The algorithms are illustrated using two examples. The first example is the tolerance design of a tank, which is solved by both algorithms, and the results are compared. A second example of a movable double bearing assembly has been discussed to show that the relative sensitivity analysis algorithm can handle complex tolerance design problems, which is difficult or inaccurate to solve by Lagrange multiplier algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.