摘要
研究了设备维修拆卸工序的规划问题。提出了拆卸优先度的概念,并给出了使用拆卸优先度表示设备维修拆卸信息的方法。对指定的拆卸目标部件,为了加快遗传算法的寻优过程,提出了由信息表生成拆卸树的方法以及拆卸树的裁剪方法,以提供合适的初始种群。应用例子表明了提出的方法的可行性和有效性。
A so called disassembly precedence measure was put forward and was used to derive the information table which expressed the information of disassembly sequence. For a given device to be disassembled, a disassembly tree, containing the initial disassembly sequence for genetic algorithm, could be derived very easily from the information table. A case study is used to illustrate the feasibility and the effectiveness of the proposed approach.
出处
《计算机应用》
CSCD
北大核心
2006年第3期720-722,726,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(60404011)
关键词
工序规划
遗传算法
维修
sequence planning
genetic algorithms
maintenance