2019
DOI: 10.33889/ijmems.2019.4.4-079
|View full text |Cite
|
Sign up to set email alerts
|

Subassembly Detection and Optimal Assembly Sequence Generation through Elephant Search Algorithm

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 integ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…The memorybased dominance rule could be utilized for removing duplicate sub-problems, where cyclic Best-First Search could be resorted to in order to accelerate the process of coming up with highquality, complete solutions [42]. In [43], the Elephant Search Algorithm has been used for optimizing the number of RA levels in the context of Optimal Assembly Sequence Planning. Hybrid Cuckoo-Bat Algorithm, Ant Colony Optimization, Grey Wolf Optimization, Advanced Immune System and Hybrid Ant-Wolf Algorithm are other instances of optimization approaches that have been applied to the problems of Optimal Assembly Sequence Planning in the literature [30], along with Bidirectional Ant Colony Optimization as an alternative approach with a relatively higher efficiency than the aforementioned algorithms [44].…”
Section: Sequence Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…The memorybased dominance rule could be utilized for removing duplicate sub-problems, where cyclic Best-First Search could be resorted to in order to accelerate the process of coming up with highquality, complete solutions [42]. In [43], the Elephant Search Algorithm has been used for optimizing the number of RA levels in the context of Optimal Assembly Sequence Planning. Hybrid Cuckoo-Bat Algorithm, Ant Colony Optimization, Grey Wolf Optimization, Advanced Immune System and Hybrid Ant-Wolf Algorithm are other instances of optimization approaches that have been applied to the problems of Optimal Assembly Sequence Planning in the literature [30], along with Bidirectional Ant Colony Optimization as an alternative approach with a relatively higher efficiency than the aforementioned algorithms [44].…”
Section: Sequence Planningmentioning
confidence: 99%
“…In this context, the number of assembly levels directly affects the assembly cost and time. To this end, parallel assembly possibilities need to be detected through sub-assembly identification techniques [43]. Numerous studies have attempted to reduce the computational time required for the complex ASP or DSP of products consisting of a large number of parts.…”
Section: F Alleviating the Computational Burdenmentioning
confidence: 99%
“…It is particularly adept at compressing time to observe certain phenomena over long periods or expand time to observe a complex phenomenon in detail and experimenting with new or unknown situations about which only limited information is available. Such wide use gave birth of several software packages which the programming requires (Maria, 1997;Bahubalendruni et al, 2019).…”
Section: Introductionmentioning
confidence: 99%