摘要
拆卸是产品回收利用中的一个重要环节,拆卸规划的目的是找到最优的顺序,以使拆卸代价最小或者代价效益比最低。这里使用遗传算法来规划拆卸序列,产生满足约束条件的效率最好的顺序。最后算法在一个实际装配体上得到了验证。
Disassembly plays an important role in product recovery.The objective of disassembly process planning is to find optimal or near optimal sequence,which minimize the cost of disassembly or obtain the best cost/benefit ratio for disassembly.This paper use GA to deal such kind of problem,which can generate an optimal sequence under constraint of disassembly priority.The ASlgorithm proved to be effective and valid through an example from literature.
出处
《机械设计与制造》
2002年第3期72-74,共3页
Machinery Design & Manufacture
关键词
拆卸序列规划
遗传算法
环境意识制造
产品回收
绿色制造
Disassembly process planning,Genetic algorithms
Environmentally conscious manufacturing
Product recovery
