基于量子遗传算法的拆卸序列规划  

Disassembly sequence planning based on quantum genetic algorithm

作　　者：张济涛[1] 樊静波[1] 高亮[2] 

机构地区：[1]宁夏大学机械工程学院,银川750021 [2]华中科技大学机械科学与工程学院,武汉430074

出　　处：《现代制造工程》2015年第4期110-115,共6页Modern Manufacturing Engineering

基　　金：欧盟第七框架计划项目(269122)

摘　　要：拆卸序列规划是再制造过程中的重要环节之一。为了高效求解拆卸序列规划问题,利用有向图建立了拆卸模型,并用优先矩阵描述了该模型。在此基础上,首次提出了一种基于量子遗传算法求解拆卸序列规划的方法,扩展了量子遗传算法应用领域,也提高了拆卸序列规划的效率。最后,用一个工程实例验证了方法的可行性。Disassembly sequence planning is an important part of the remanufacturing process .In order to efficiently solve the problem,a directed graph disassembly model was established ,with priority matrix describes the model .Further,a method based on quantum genetic algorithm for disassembly sequence planning was firstly proposed .It expands the application fields of quantum genetic algorithm,and improves the efficiency of disassembly sequence planning .Finally,a case study was given to illustrate the feasibility of the method .

关 键 词：再制造 拆卸序列规划 有向图 量子遗传算法 

分 类 号：TH16[机械工程—机械制造及自动化]