基于遗传算法与Tabu搜索的拆卸序列优化算法

为研究废弃装配体的拆卸序列优化，首先提出了建立装配体的干涉-自由矩阵，作为描述其结构的数学模型．其次，运用遗传算法原理，提出面向装配体拆卸序列自动生成及优化的计算模型．依据初始输入的若干拆卸序列和其它控制参数，由程序搜寻几何上可行的最佳拆卸序列．这里是以装配体在拆卸过程中具有最少的换向次数为优化目标．最后，鉴于遗传计算的未熟早敛问题，提出建立Tabu搜索与遗传算法的组合优化算法．通过把Tabu搜索的集中与分散策略引入遗传算法，可望获得更加健壮的搜索行为．大量的实例验证表明，用这种方法解决装配体拆卸序列的优化问题，所生成的可行拆卸序列在适应度函数值、数量、分布范围等方面均优于单纯的由遗传算法生成的结果．

Optimizing Algorithm for Disassembly Sequence Based on Tabu Search and Genetic Algorithms

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.