Optimizing Algorithm for Disassembly Sequence Based on Tabu Search and Genetic Algorithms
Article
Figures
Metrics
Preview PDF
Reference
Related
Cited by
Materials
Abstract:
In order to optimize disassembly sequence about wornout or malfunctioning products,firstly,it is proposed to build Interference-Freeness Matrix for describing the structure of assembly.Secondly,computing model of automatic generating and optimizing disassembly sequence of assembly is proposed based on Genetic Algorithms.Then,after inputing some disassembly sequences and other controlling parameters,the program can search optimizing disassembly(sequences) valid in geometry.Minimal reorientation number of times during disassembling assembly is assigned as optimizing objective.At last,because the neighborhood may converge too fast and limit the search to a local optimum prematurely during the process of Genetic Algorithms(GAs),the authors combine the strengths of GAs and Tabu search and presented the detailed flow chart of the hybrid approach.More robust search behavior can possibly be obtained by incorporating the(Tabu's) intensification and diversification strategies into GAs.The details of the hybrid approach and a case study are presented here.Much engineering examples is tested to demonstrate the approach.The results given show that the valid disassembly sequences obtained are superior to those derived from GAs alone in fitness value,number and distribution.
