scholarly journals A Novel Methodology for Simultaneous Minimization of Manufacturing Objectives in Tolerance Allocation of Complex Assembly

2021 ◽  
Vol 11 (19) ◽  
pp. 9164
Author(s):  
Lenin Nagarajan ◽  
Siva Kumar Mahalingam ◽  
Sachin Salunkhe ◽  
Emad Abouel Nasr ◽  
Jõao Paulo Davim ◽  
...  
Keyword(s):  
Computation Time ◽  
Search Method ◽  
Tolerance Allocation ◽  
Process Selection ◽  
Machining Time ◽  
Whale Optimization ◽  
Selection For ◽  
The Given ◽  
Work First ◽  
Tolerance Cost

Tolerance cost and machining time play crucial roles while performing tolerance allocation in complex assemblies. The aim of the proposed work is to minimize the above-said manufacturing objectives for allocating optimum tolerance to the components of complex assemblies, by considering the proper process and machine selections from the given alternatives. A novel methodology that provides a two-step solution is developed for this work. First, a heuristic approach is applied to determine the best machine for each process, and then a combined whale optimization algorithm with a univariate search method is used to allocate optimum tolerances with the best process selection for each sub-stage/operation. The efficiency of the proposed novel methodology is validated by solving two typical tolerance allocation problems of complex assemblies: a wheel mounting assembly and a knuckle joint assembly. Compared with previous approaches, the proposed methodology showed a considerable reduction in tolerance cost and machining time in relatively less computation time.

scholarly journals A Novel Methodology for Simultaneous Minimization of Manufacturing Objectives in Tolerance Allocation of Complex Assembly

2021 ◽  
Author(s):  
Lenin Nagarajan ◽  
Siva Kumar Mahalingam ◽  
Ayyappan S ◽  
Eswara Prasath Natarajan
Keyword(s):  
Computation Time ◽  
Search Method ◽  
Tolerance Allocation ◽  
Process Selection ◽  
Machining Time ◽  
Whale Optimization ◽  
Selection For ◽  
The Given ◽  
Work First ◽  
Tolerance Cost

Abstract A novel methodology is presented in this work to minimize the manufacturing objectives, namely tolerance cost and machining time for allocating optimum tolerance to the components of complex assemblies with considering the proper process and machine selections from the given alternatives. A methodology that provides a two-step solution is developed for this work. First, a heuristic approach is applied to determine the best machine for each process, and then a combined Whale optimization algorithm with a univariate search method is used to allocate optimum tolerances with the best process selection for each sub-stage/operation. The efficiency of the proposed novel methodology is validated by solving two typical tolerance allocation problems of complex assemblies: a wheel mounting assembly and a knuckle joint assembly. Compared with previous approaches, the proposed methodology showed a considerable reduction in tolerance cost and machining time in relatively less computation time.

AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS

2011 ◽  
Vol 21 (06) ◽  
pp. 661-684
Author(s):  
HIROFUMI AOTA ◽  
TAKURO FUKUNAGA ◽  
HIROSHI NAGAMOCHI
Keyword(s):  
Approximation Algorithm ◽  
Convex Polygon ◽  
Computation Time ◽  
Approximation Ratio ◽  
Convex Polygons ◽  
The Given

This paper considers a problem of locating the given number of disks into a container so that the area covered by the disks is maximized. In the problem, the radii of the disks can be changed arbitrarily unless they overlap outside of the container, and the disks are allowed to overlap with each other. We present an approximation algorithm for this problem assuming that the container is a convex polygon. Our algorithm achieves approximation ratio (0.78 - ϵ) for any small ϵ > 0. Since the computation time of our algorithm depends on the number of corners of the convex polygon exponentially, we also give a heuristic to reduce the number of corners.

scholarly journals An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints

2011 ◽  
Vol 62 (1) ◽  
pp. 11-18 ◽  
Author(s):  
C. Christober ◽  
Asir Rajan
Keyword(s):  
Tabu Search ◽  
Unit Commitment ◽  
Computation Time ◽  
Evolutionary Programming ◽  
Search Method ◽  
Unit Commitment Problem ◽  
New Approach ◽  
Commitment Problem ◽  
Tabu Search Method ◽  
The Cost

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.

Sign in / Sign up

Export Citation Format

Share Document