Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly
The proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating the different bins’ components. Before that, the components are classified based on the range of tolerance values and grouped into different bins. Further, the manufa...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-10-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/11/19/9213 |
| _version_ | 1797516790953148416 |
|---|---|
| author | Siva Kumar Mahalingam Lenin Nagarajan Sachin Salunkhe Emad Abouel Nasr Jõao Paulo Davim Hussein M. A. Hussein |
| author_facet | Siva Kumar Mahalingam Lenin Nagarajan Sachin Salunkhe Emad Abouel Nasr Jõao Paulo Davim Hussein M. A. Hussein |
| author_sort | Siva Kumar Mahalingam |
| collection | DOAJ |
| description | The proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating the different bins’ components. Before that, the components are classified based on the range of tolerance values and grouped into different bins. Further, the manufacturing process of the components is selected from the given and known alternative processes. It is incredibly tedious to obtain the best combinations of bins and the best process together. Hence, a novel approach using the combination of the univariate search method and the harmony search algorithm is proposed in this work. Overrunning clutch assembly is taken as an example. The components of overrunning clutch assembly are manufactured with a wide tolerance value using the best process selected from the given alternatives by the univariate search method. Further, the manufactured components are grouped into three to nine bins. A combination of the best bins is obtained for the various assembly specifications by implementing the harmony search algorithm. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The results show that the contribution of the proposed novel methodology is legitimate in solving selective assembly problems. |
| first_indexed | 2024-03-10T07:05:47Z |
| format | Article |
| id | doaj.art-765bd5167f744d0ba86693688f885e3d |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T07:05:47Z |
| publishDate | 2021-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-765bd5167f744d0ba86693688f885e3d2023-11-22T15:49:23ZengMDPI AGApplied Sciences2076-34172021-10-011119921310.3390/app11199213Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear AssemblySiva Kumar Mahalingam0Lenin Nagarajan1Sachin Salunkhe2Emad Abouel Nasr3Jõao Paulo Davim4Hussein M. A. Hussein5Department of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600062, IndiaDepartment of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600062, IndiaDepartment of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600062, IndiaIndustrial Engineering Department, College of Engineering, King Saud University, Riyadh 11421, Saudi ArabiaDepartment of Mechanical Engineering, University of Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, PortugalMechanical Engineering Department, Faculty of Engineering, Helwan University, Cairo 11732, EgyptThe proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating the different bins’ components. Before that, the components are classified based on the range of tolerance values and grouped into different bins. Further, the manufacturing process of the components is selected from the given and known alternative processes. It is incredibly tedious to obtain the best combinations of bins and the best process together. Hence, a novel approach using the combination of the univariate search method and the harmony search algorithm is proposed in this work. Overrunning clutch assembly is taken as an example. The components of overrunning clutch assembly are manufactured with a wide tolerance value using the best process selected from the given alternatives by the univariate search method. Further, the manufactured components are grouped into three to nine bins. A combination of the best bins is obtained for the various assembly specifications by implementing the harmony search algorithm. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The results show that the contribution of the proposed novel methodology is legitimate in solving selective assembly problems.https://www.mdpi.com/2076-3417/11/19/9213selective assemblyoverrunning clutch assemblyunivariate search methodharmony search algorithm |
| spellingShingle | Siva Kumar Mahalingam Lenin Nagarajan Sachin Salunkhe Emad Abouel Nasr Jõao Paulo Davim Hussein M. A. Hussein Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly Applied Sciences selective assembly overrunning clutch assembly univariate search method harmony search algorithm |
| title | Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly |
| title_full | Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly |
| title_fullStr | Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly |
| title_full_unstemmed | Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly |
| title_short | Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly |
| title_sort | harmony search algorithm for minimizing assembly variation in non linear assembly |
| topic | selective assembly overrunning clutch assembly univariate search method harmony search algorithm |
| url | https://www.mdpi.com/2076-3417/11/19/9213 |
| work_keys_str_mv | AT sivakumarmahalingam harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly AT leninnagarajan harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly AT sachinsalunkhe harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly AT emadabouelnasr harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly AT joaopaulodavim harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly AT husseinmahussein harmonysearchalgorithmforminimizingassemblyvariationinnonlinearassembly |