桂林电子科技大学学报2012，Vol.32Issue(2)：129-133,5.
基于加权启发式遗传算法的装配序列规划
Assembly sequence planning based on weighted heuristic genetic algorithm
摘要
Abstract
During the process of solving the assembly sequence planning problem! traditional genetic algorithm will generate a large number of useless initial assembly sequences which affect the solution rate and lead to low quality of planning solutions. Both a heuristic operator and a breadth-first search strategy, which is based on undirected graph, are added into to the initial process of genetic algorithm, so that the feasible degree and the fitness of individuals are ensured. Furthermore, according to the features of assembly sequence planning problem, operators including selection, crossover and mutation are re-designed. Experimental results show that the improved algorithm have better stability and efficiency compared with traditional genetic algorithm, and the algorithm implementation process need not any manual information, therefore the whole assembly process is more automated.关键词
遗传算法/装配序列规划/广度优先搜索策略/无向图/加权启发因子Key words
genetic algorithm/ assembly sequence planning/ breadth-first search strategy/ undirected graph/ weighted heuristic factor分类
信息技术与安全科学引用本文复制引用
刘亚杰,古天龙,徐周波..基于加权启发式遗传算法的装配序列规划[J].桂林电子科技大学学报,2012,32(2):129-133,5.基金项目
广西研究生教育创新计划(2011105950812M23) （2011105950812M23）
