Assembly planning is the problem of finding the best or optimal sequence to assemble a product, starting from its design data. It is still solved manually in most advanced assembly plants, despite the large amount of related research. One of the main reasons might be the use of exact- and/or linear-solution approaches. This paper introduces a different approach by applying a modified genetic algorithm (GA). A “best” solution is generated without searching the complete candidate space, while search is performed on a sequence population basis. The GA is modified to cope with sequence nonlinearity and constraints. [S1087-1357(00)70401-1]

Issue Section:
Technical Papers
Keywords:
assembly planning, optimisation, industrial plants, scheduling, genetic algorithms
Topics:
Manufacturing, Algorithms
1.
Homen de Mello
,
L. S.
, and
Sanderson
,
A.
,
1991
, “
A Correct and Complete Algorithm for the Generation of Mechanical Assembly Sequences
,”
IEEE Trans. Rob. Autom.
,
7
, No.
2
, pp.
228
–
240
.
2.
De Fazio
,
T. L.
, and
Whitney
,
D. E.
,
1988
, “
Simplified Generation of All Mechanical Assembly Sequences
,”
IEEE J. Rob. Autom.
,
RA-4
, No.
6
, pp.
705
–
708
.
3.
Lee, S., 1992, “Backward Assembly Planning with Assembly Cost Analysis,” Proceedings of the IEEE International Conference on Robotics and Automation, Nice, France, pp. 2382–2391.
4.
Heemsherk
, Jr.,
C. J. M.
,
1989
, “
The Use of Heuristics In Assembly Sequence Planning
,”
Ann. CIRP
,
38
, No.
1
, pp.
37
–
40
.
5.
Woo, T. C., 1987, “Automatic Disassembly and Total Ordering in Three Dimensions,” Proceedings of International Conference on Intelligent and Integrated Manufacturing Analysis and Synthesis, pp. 291–303.
6.
Milner, J. M., et al., 1994, “Using Simulated Annealing to Select Least-Cost Assembly Sequences,” Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2058–2063.
7.
Chen, C. L. P., 1990, “Neural Computation for Planning AND/OR Precedence-Constraint Robot Assembly Sequences,” Proceedings of International Conference on Neural Networks, 1, pp. 127–142.
8.
Hong, D. S., and Cho, H. S., 1993, “Optimization of Robotic Assembly Sequences Using Neural Network,” Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 232–239.
9.
Ling, Z. K., 1996, “Assembly Modeling and Sequence Planning Based on the Kinematics of Features,” Proceedings of ASME 22nd Design Automation Conference, Irvine, USA, CD-ROM paper no. 96-DETC/DAC-1282.
10.
Sebaaly, M. F., and Fujimoto, H., 1996, “A New Crossover Operator for Assembly Sequence Planning with Genetic Algorithms,” Proceedings of the 5th ASME Flexible Assembly Conference, Irvine, USA, CD-ROM paper no. 96-DETC/FA.
11.
De Fazio, T. L., et al., 1997, “A Design-specific Approach to Design-for-Assembly (DFA) for Complex Mechanical Assemblies,” Proceedings of the IEEE International Symposium on Assembly and Task Planning, Marina del Rey, CA, USA, pp. 152–158.
12.
Wolter, J., et al., 1992, “Mating Constraint Languages for Assembly Sequence Planning,” Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2382–2391.
13.
Penev
,
K. D.
, and
de Ron
,
A. J.
,
1996
, “
Determination of a Disassembly Strategy
,”
Int. J. Prod. Res.
,
34
, No.
2
, pp.
495
–
506
.
14.
Bourjault, A., 1984, Contribution a Une Approche-Methodologique de l’assemblage Automatise: Elaboration automatiques des Sequences Operatoires, Thesis to obtain Grade de Docteur en Sciences Physiques at L’Universite de Franche-Comte, France.
15.
Abell et al., 1991, “Computer Aids for Finding, Representing, Choosing Amongst, and Evaluating the Assembly Sequences of Mechanical Products,” (Ch. 15) “Computer-aided Mechanical Assembly Planning,” L. S. Homem de Mello and S. Lee, Eds. Kluwer Academic Publishers.
16.
Davis, L., 1991, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.
17.
Goldberg, D., 1989, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Pub. Inc.
Copyright © 2000
 by ASME
You do not currently have access to this content.