A Genetic Algorithm for Product Disassembly Sequence Planning

This paper's concern is on product's disassembly sequence planning which is a complex NP-hard problem. Disassembly feasibility information graph (DFIG) is presented for describing product's disassembly operations (sequences) information. Based on the DFIG, the problem of disassembly sequence planning is transformed into a problem of searching optimum path. A genetic algorithm is introduced to search for feasible and optimum solution of product disassembly sequence with a well efficiency. Finally, a simply case example is used to illustrate the method

[1]  J.-M. Henrioud,et al.  Assembly sequences, assembly constraints, precedence graphs , 2003, Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003..

[2]  Brahim Rekiek,et al.  Assembly planning with an ordering genetic algorithm , 2001 .

[3]  D. R. Brough,et al.  ASSEMBLY/DISASSEMBLY SEQUENCE PLANNING , 1992 .

[4]  Ke Chen,et al.  Systematic generation of assembly precedence graphs , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Tom V. Mathew.  Genetic Algorithm , 2022 .

[6]  Marco Santochi,et al.  A disassembly planning software system for the optimization of recycling processes , 2001 .

[7]  Charles R. McLean,et al.  Disassembly of products , 1996 .

[8]  Brahim Rekiek,et al.  An ordering genetic algorithm for assembly planning , 1999 .