Subassembly detection and optimal assembly sequence generation through Elephant search algorithm

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bahubalendruni, M. V. A. R., Sudhakar, U., & Lakshmi, K. V. V. (2019). Subassembly detection and optimal assembly sequence generation through Elephant search algorithm. International Journal of Mathematical, Engineering and Management Sciences, 4(4), 998–1007. https://doi.org/10.33889/IJMEMS.2019.4.4-079

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free