Abstract
Most of the engineering products are made with multiple components. The products with multiple subassemblies offer greater flexibility for parallel assembly operation and also disassembly operation during its end of life. Assembly cost and time can be minimized by reducing the number of assembly levels. In this paper, Elephant search algorithm is used to perform Optimal Assembly Sequence Planning (OASP) in order to minimize the number of assembly levels. Subassembly identification technique is used as an integral part of algorithm to identify the parallel assembly possibilities. The proposed method is implemented on industrial products and a detailed comparative assessment has been made with suitable product illustrations to corroborate the efficiency.
Highlights
There is an ever increasing demand for producing new products and supplying into market on-time towards fulfilling the customer needs, which made the industries to look towards new fabrication techniques and assembling methods
Dini has proposed a solution while implementing the Genetic Algorithm (GA), the solution has 12 total assembly levels with 4 identified stable subassemblies (Dini and Santochi, 1992)
Trigui solved the product with disassembly sequence planning approach and obtained a feasible solution with 7 assembly levels (Trigui et al, 2017)
Summary
There is an ever increasing demand for producing new products and supplying into market on-time towards fulfilling the customer needs, which made the industries to look towards new fabrication techniques and assembling methods. The journey of Artificial Intelligence (AI) based Optimal Assembly Sequence Planning (OASP) started with Genetic Algorithms (GA) and Simulated Annealing (SA) in the early 90’s.
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Mathematical, Engineering and Management Sciences
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.
