首页 | 官方网站   微博 | 高级检索  
     


Concurrent multi-objective tolerance allocation of mechanical assemblies considering alternative manufacturing process selection
Authors:K Sivakumar  C Balamurugan  S Ramabalan
Affiliation:1. Department of Mechanical Engineering, Bannari Amman Institute of Technology, Sathyamangalam, 638 401, Erode District, Tamil Nadu, India
2. Department of Mechanical Engineering, M.A.M. College of Engineering, Tiruchirappalli, 621105, Tamil Nadu, India
3. Department of Mechanical Engineering, EGS Pillay Engineering College, Nagapattinam, 611002, Tamil Nadu, India
Abstract:Concurrent design of tolerances by considering both the manufacturing cost and quality loss of each component by alternate processes of the assemblies may ensure the manufacturability, reduce the manufacturing costs, decrease the number of fraction nonconforming (or defective rate), and shorten the production lead time. Most of the current tolerance design research does not consider the quality loss. In this paper, a novel multi-objective optimization method is proposed to enhance the operations of the non-traditional algorithms (Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO)) and systematically distribute the tolerances among various the components of mechanical assemblies. The problem has a multi-criterion character in which three objective functions, one constraint, and three variables are considered. The average fitness factor method and normalized weighted objective function method are used to select the best optimal solution from Pareto-optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto-optimal fronts. Two more multi-objective performance measures namely optimizer overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto-optimal fronts and results obtained from various techniques are compared and analysed. Both NSGA-II and MOPSO algorithms are best for this problem.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号