基于改进遗传算法的装配序列优化
|
摘要
针对机械产品的装配序列优化问题,利用产品装配优先关联矩阵,生成可行装配序列作为初始种群。在遗传算法中加入参考集,并结合分散搜索算法的"分散,收敛,集聚"的智能迭代机制,避免了搜索的随机性,以装配的连续性为目标进行优化,不断更新参考集,最终求得最优解。通过特定的交叉和变异使解不断向最优方向发展。最后,以三级减速器为实例分析,验证了改进遗传算法的有效性和可行性。
According to the assembly sequence optimization problem of mechanical products,the assembly sequence is used as initial population,and the reference set is added to the genetic algorithm,and the intelligent iterative mechanism of the decentralized search algorithm is used to avoid the random nature of the search.The continuous optimization of the assembly,the optimal solution is obtained. Finally,the effectiveness and feasibility of the improved genetic algorithm is verified through the analysis of the three stage reducer.
According to the assembly sequence optimization problem of mechanical products,the assembly sequence is used as initial population,and the reference set is added to the genetic algorithm,and the intelligent iterative mechanism of the decentralized search algorithm is used to avoid the random nature of the search.The continuous optimization of the assembly,the optimal solution is obtained. Finally,the effectiveness and feasibility of the improved genetic algorithm is verified through the analysis of the three stage reducer.
引文
[1]阎树田,贾晓锋,贺成柱,等.基于改进遗传算法的装配序列优化[J].机械制造与自动化,2014,43(6):46-49.
[2]MASEHIAN E,AKBARIPOUR H,MOHABBATI KALEJAHI N.Landscape analysis and efficient metaheuristics for solving the nqueens problem[J].Comput Optim Appl,2013,56(3):735-764.
[3]谢龙,付宜利,马玉林.基于复合装配图进行装配序列规划的研究[J].计算机集成制造系统,2004,10(8):997-1002.
[4]陈天凡.基于遗传算法的装配工艺规划[D].南京:东南大学,2006:9-10.
[5]周鼎.基于装配过程模型的装配序列生成及其优化研究[D].武汉:武汉大学,2008:31-35.
[6]陈颖悦,吴豪杰.基于改进遗传算法的拆卸序列优化研究[J].厦门理工学院学报,2014(5):72-77.
[7]李明宇.复杂产品的装配序列规划方法研究[D].武汉:华中科技大学,2013:58.
[8]RASHID M F F,HUTABARAT W,TIWARI A.A review on assembly sequence planning and assembly line balancing optimisation using soft computing approaches[J].International Journal of Advanced Manufacturing Technology,2012,59(1-4):335-349.
[9]张丹.航天产品虚拟装配工艺设计技术及其应用基础研究[D].南京:南京航空航天大学,2010:87-90.
[10]WANG L,HOU Y,LI X,et al.An enhanced harmony search algorithm for assembly sequence planning[J].International Journal of Modelling Identification&Control,2013,18(1):18-25.
[2]MASEHIAN E,AKBARIPOUR H,MOHABBATI KALEJAHI N.Landscape analysis and efficient metaheuristics for solving the nqueens problem[J].Comput Optim Appl,2013,56(3):735-764.
[3]谢龙,付宜利,马玉林.基于复合装配图进行装配序列规划的研究[J].计算机集成制造系统,2004,10(8):997-1002.
[4]陈天凡.基于遗传算法的装配工艺规划[D].南京:东南大学,2006:9-10.
[5]周鼎.基于装配过程模型的装配序列生成及其优化研究[D].武汉:武汉大学,2008:31-35.
[6]陈颖悦,吴豪杰.基于改进遗传算法的拆卸序列优化研究[J].厦门理工学院学报,2014(5):72-77.
[7]李明宇.复杂产品的装配序列规划方法研究[D].武汉:华中科技大学,2013:58.
[8]RASHID M F F,HUTABARAT W,TIWARI A.A review on assembly sequence planning and assembly line balancing optimisation using soft computing approaches[J].International Journal of Advanced Manufacturing Technology,2012,59(1-4):335-349.
[9]张丹.航天产品虚拟装配工艺设计技术及其应用基础研究[D].南京:南京航空航天大学,2010:87-90.
[10]WANG L,HOU Y,LI X,et al.An enhanced harmony search algorithm for assembly sequence planning[J].International Journal of Modelling Identification&Control,2013,18(1):18-25.