为了能够以较高的效率求解出产品中目标零件的拆卸方案,基于产品中零件间的拆卸优先约束关系,提出并建立目标零件的拆卸层次信息图模型,将目标零件的拆卸序列规划问题转化为对该图模型中具备最优值的路径的搜索和寻优问题.同时,提出一种改进蚁群优化算法,以实现对目标零件拆卸层次信息图的构建和对拆卸方案的搜索与寻优.最后通过实例验证了该方法的可行性和计算效率.
To tackle selective disassembly sequence planning problem efficiently, disassembly hierarchy information graph (DHIG) based on precedence constraints is presented firstly. The problem of selective disassembly sequence planning is transformed into that of searching optimal paths in the graph. An improved ant colony optimization algorithm is presented to build the DHIG and search the optimal solutions. Finally, an example is used to verify the feasibility and calculating efficiency of the proposed method.