A Methodology for Assembly Sequence Optimization by Hybrid Cuckoo-Search Genetic Algorithm

摘要

In this paper, we have proposed and implemented a methodology for assembly sequence optimization by using a nature-inspired metaheuristic algorithm, known as hybrid cuckoo-search genetic algorithm (CSGA). The cost criteria for optimization in the present formulation takes into consideration the total assembly time and the number of reorientations during the assembly process. To demonstrate the application of the CSGA, an example assembly containing 19 parts has been presented and the results have been compared with those of another metaheuristic algorithm, Genetic Algorithm (GA). From the results, it has been observed that for the given problem, the CSGA not only produces optimal assembly sequences with costs comparable to that of GA, but the convergence of CSGA algorithm has been found to be faster than the GA algorithm.