This paper describes a hybrid approach to handle disassembly sequence planning for maintenance. The product under maintenance is first modeled using a novel hybrid graph known as Disassembly Constraint Graph (DCG) which embodies complete disassembly information and can be used to prune the search space of disassembly sequences. Subsequently, a novel Tabu-enhanced GA engine is invoked to generate the near optimal disassembly sequences. A case study was used to illustrate the effectiveness of the proposed approach. The details of the DCG, the TS-enhanced GA engine and the fitness function used are presented in this paper.

1.
Shyamsundar, N., and Gadh, R., 1996, “Selective Disassembly of Virtual Prototypes.” IEEE International Conference on Systems, Man and Cybernetics, pp. 3159–3164. IEEE, Piscataway, NJ.
2.
Gadh, R., Srinivasan, H., Shyamsundar, N., and Figueroa, R. 1998, “Virtual Disassembly–A Software Tool for Developing Product Dismantling and Maintenance Systems,” Annual Proceedings on Reliability and Maintainability Symposium, pp. 120–125, IEEE, Piscataway, NJ.
3.
Lambert, A. J. D., 1999, “Optimal Disassembly Sequence Generation for Combined Material Recycling and Part Reuse,” Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning, pp. 146–151, IEEE, Piscataway, NJ.
4.
Zhang, H. C., and Kuo, T. C., 1997, “A Graph-based Disassembly Sequence Planning for EOL Product Recycling,” Twenty-first IEEE/CPMT International Electronics Manufacturing Technology Symposium, pp. 140–151, Piscataway, New Jersey.
5.
Zussman
,
E.
, and
Zhou
,
M. C.
,
1999
, “
A Methodology for Modeling and Adaptive Planning of Disassembly Processes
,”
IEEE Trans. Rob. Autom.
,
15
(
1
), pp.
190
194
.
6.
Homem de Mello
,
L. S.
, and
Sanderson
,
A. C.
,
1990
, “
AND/OR Graph Representation of Assembly Plans
,”
IEEE Trans. Rob. Autom.
,
6
(
2
), pp.
188
199
.
7.
Lee, S., and Moradi, H., 1999, “Disassembly Sequencing and Assembly Sequence Verification Using Force Flow Networks,” Proceedings of the 1999 IEEE International Conference on Robotics & Automation, pp. 2762–2767, IEEE, Piscataway, NJ.
8.
Homem de Mello
,
L. S.
, and
Sanderson
,
A. C.
,
1991
, “
A Correct and Complete Algorithm for the Generation of Mechanical Assembly Sequences
,”
IEEE Trans. Rob. Autom.
,
7
(
2
), pp.
228
240
.
9.
Woo
,
T. C.
, and
Dutta
,
D.
,
1991
, “
Automatic Disassembly and Total Ordering in Three Dimensions
,”
J. Eng. Ind.
,
113
, pp.
207
213
.
10.
Chun
,
J. S.
,
Jung
,
H. K.
, and
Hahn
,
S. Y.
,
1998
, “
A Study on Comparison of Optimization Performances Between Immune Algorithm and other Heuristic Algorithms
,”
IEEE Trans. Magn.
,
34
(
5
), pp.
2972
2975
.
11.
Gao, Y., Shi, L., and Yao, P. J., 2000, Study on Multi-objective Genetic Algorithm, Proceedings of the 3rd World Congress on Intelligent Control and Automation pp. 646–650. Hefei, P. R. China.
12.
Perrard, C., Magerand, E., Bourjault, A., and Rit, J. F., 1996, “Extraction by Disassembly of a Single Part of a Mechanical System for its Maintenance,” Proceedings of 1996 IEEE Conference on Merging Technologies and Factory Automation, pp. 573–579, IEEE, Piscataway, NJ.
13.
Wilson, R. J., and Watkins, J. J., 1989, Graphs: An Introductory Approach: A First Course in Discrete Mathematics, New York, John Wiley & Sons, Inc.
14.
Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA, Addison Wesley.
15.
Glover
,
F.
,
1977
, “
Heuristics for Integer Programming Using Surrogate Constraints
,”
Decision Science
,
8
, pp.
156
166
.
16.
Glover
,
F.
,
1986
, “
Further Paths for Integer Programming and Links to Artificial Intelligence
,”
Computer and Operations Research
,
13
, pp.
533
549
.
17.
Glover, F., and Laguna, M., 1997, Tabu Search, Boston, Kluwer Academic Publishers.
18.
Glover
,
F.
,
1990
, “
Artificial Intelligence, Heuristic Frameworks and Tabu Search
,”
Managerial and Decision Economics
,
11
, pp.
365
375
.
19.
Davis, L., 1985, “Applying Adaptive Algorithms to Espistatic Domains,” Proceedings of the International Joint Conference on Artificial Intelligence, pp. 162–164, CA, Morgan Kaufmann Publishers.
You do not currently have access to this content.