摘要
维修拆卸序列规划是整个维修性设计的重要内容。为了能够以较高的效率求解出产品中零件的拆卸方案,依据产品的基本信息和零件之间的约束关系,建立拆卸Petri网可达图,将拆卸序列规划问题转化为对Petri网可达图最优路径的搜索和寻优问题。同时利用蚁群优化算法对组合优化具有高强适应性的特征,改进基本蚁群算法,对可达图模型进行路径寻优,得到最优或次优的拆卸序列。最后通过实例验证了该方法的有效性。
Maintenance disassembly sequence planning is an important facet of maintainability design. To tackle disassembly sequence planning problemefficiently, based on the product' s basic information and constraint relations between parts, disassembly Petri net reachable graph is presented firstly. Theproblem of disassembly sequence planning is transformed into that of searching optimal paths in the graph. At the same time an improved ant colonyoptimization algorithm is presented to search the optimal solutions. Finally, through examples verify the effectiveness of the method.
出处
《微型电脑应用》
2012年第2期59-61,64,共4页
Microcomputer Applications
关键词
拆卸序列规划
可达图
蚁群算法
Disassembly Sequence Planning
Reachable Graph
Ant Colony Algorithm
