基于蚂蚁算法的拆卸序列优化

Searching Optimized Disassembly Sequences by Ant Algorism

描述了蚂蚁算法的基本原理 ,并针对拆卸的特点提出了一套基于蚂蚁算法的拆卸 /装配序列优化的方案 .该方案运用了拆卸矩阵作为蚂蚁初始解的搜索空间 ,综合考虑拆卸零件重定位和拆卸工具的改变次数 ,将其作为拆卸 /装配序列质量的评价标准 ,自动生成优化的拆卸 /装配序列 .最后 ,通过实例验证了该方案的有效性 .

After describing the main principle of Ant Algorism, this paper proposes a detailed method that can generate optimized disassembly/assembly sequences automatically by ant colony systems. In this method, we use a disassembly/assembly matrix as the initial space in which ant search the possible solution. Moreover, we regard both the change times of disassembly-tool and relocation times of disassembly parts as the evaluation criterion of the disassembly/assembly sequence. Finally, an instance is used to verify the feasibility of this method.