An approach to multi-criteria assembly sequence planning using genetic algorithms
- 261 Downloads
- 24 Citations
Abstract
This paper focuses on multi-criteria assembly sequence planning (ASP) known as a large-scale, time-consuming combinatorial problem. Although the ASP problem has been tackled via a variety of optimization techniques, these techniques are often inefficient when applied to larger-scale problems. Genetic algorithm (GA) is the most widely known type of evolutionary computation method, incorporating biological concepts into analytical studies of systems. In this research, an approach is proposed to optimize multi-criteria ASP based on GA. A precedence matrix is proposed to determine feasible assembly sequences that satisfy precedence constraints. A numerical example is presented to demonstrate the performance of the proposed algorithm. The results of comparison in the provided experiment show that the developed algorithm is an efficient approach to solve the ASP problem and can be suitably applied to any kind of ASP with large numbers of components and multi-objective functions.
Keywords
Assembly sequence planning Meta-heuristic Genetic algorithms Simulated annealingPreview
Unable to display preview. Download preview PDF.
References
- 1.Khosla PK, Mattikali R (1989) Determining the assembly sequence from a 3D model. J Mech Work Tech 20:153–162CrossRefGoogle Scholar
- 2.Wilson RH, Latombe JC (1994) Geometric reasoning about mechanical assembly. Artif Intell 71(2):371–396CrossRefMathSciNetGoogle Scholar
- 3.Romney B, Godard C, Goldwasser M, Ramkumar G (1995) An efficient system for geometric assembly sequence generation and evaluation. Proceedings of the ASME International Computers in Engineering Conference 699–712Google Scholar
- 4.De Mello LSH, Sanderson AC (1991) A correct and complete algorithm for the generation of mechanical assembly sequence. IEEE Trans Robot Autom 7:626–633CrossRefGoogle Scholar
- 5.Gottipolu RB, Ghosh K (1997) Representation and selection of assembly sequences in computer-aided assembly process planning. Int J Prod Res 35(12):3447–3465MATHCrossRefGoogle Scholar
- 6.Choi CK, Zha XF, Ng TL (1998) On the automatic generation of product assembly sequences. Int J Prod Res 36(3):617–633MATHCrossRefGoogle Scholar
- 7.Banerjee UR, Liu CR (1989) Design of an automated assembly environment. Comput Aided Des 21:561–569CrossRefGoogle Scholar
- 8.Hong DS, Cho HS (1999) A genetic-algorithm-based approach to the generation of robotic assembly sequences. Control Eng Pract 7(2):151–159CrossRefGoogle Scholar
- 9.Milner JM, Graves SC, Whitney F (1994) Using simulated annealing to select least-cost assembly sequences. Proc IEEE Int Conf Robot Autom 3:499–504Google Scholar
- 10.Motavalli S, Islam AU (1997) Multi-criteria assembly sequencing. Comput Ind Eng 32:743–751CrossRefGoogle Scholar
- 11.Bonneville F, Perrard C, Henrioud JM (1995) A genetic algorithm to generate and evaluate assembly plans. Proceedings of the IEEE Symposium on Emerging Technology and Factory Automation 231–239Google Scholar
- 12.Chen SF (1998) Assembly planning—a genetic approach. Proceedings of the 24th ASME Design Automation Conference, Atlanta, Georgia, 12–16 September Paper no. DETC98/DAC5798Google Scholar
- 13.Chen SF, Liu Y (2001) An adaptive genetic assembly sequence planner. Int J Comput Integr Manuf 14(5):489–500CrossRefGoogle Scholar
- 14.Romeo MM, Lee HS, Luong KA (2006) A genetic algorithm for the optimization of assembly sequences. Comput Ind Eng 50:503–527CrossRefGoogle Scholar
- 15.Guan Q, Lin JH, Zhong YF (2002) A concurrent hierarchical evolution approach to assembly process planning. Int J Prod Res 40(14):3357–3374MATHCrossRefGoogle Scholar
- 16.Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New YorkGoogle Scholar