自动生成优化的拆卸序列的初始群体

研究废弃产品的拆卸序列问题。首先，提出建立装配体的干涉一自由矩阵，描述零件相互之间的空间关系。然后，提出一种新的计算模型，据此计算各个零件从装配体上可以拆卸下来的方向，从而确定拆卸序列在几何上的可行性。最后，提出自动生成优化的拆卸序列的初始群体的计算方法，从而有效地提高遗传计算最优装配体拆卸序列的搜索效率。通过一系列的实例验证，证明了提出的这套方法切实可行。

The Initial Population of the Optimal Disassembling Sequence Generated Automatically

The disassembing sequence of discarded products has been discussed in the paper. Firstly, it is proposed to build Interference-Freeness Matrix for assembly in order to describe the relation of parts. And then a new algorithm is proposed to compute the directions for every part to be disassembled from assembly and to confirm whether a disassembling sequence is valid in geometry. At last, a new algorithm is proposed to generate automaticlly the optimal initial population for disassembling sequence, which improves the efficiency for Genetic Algorithms to search disassembling sequences of an assembly. The proposed methodology is demonstrated through a series of engineering examples. And these results are reliable and valid.