期刊文献+

基于改进自适应遗传算法的点焊机器人TSP路径规划 被引量:6

TSP Path Planning of Spot-Welding Robot Based on Improved Adaptive Genetic Algorithms
下载PDF
导出
摘要 基于TSP问题建立焊点路径数学模型。同时为改善遗传算法自身收敛速度慢问题,采取适应度计算评估、适应度比例选择步骤;为了提高计算速度与避免局部最优缺陷,采用自适应交叉、变异算子,以及加入进化逆转步骤操作来提升算法全局计算和搜索能力。最后利用RobotStuidio仿真软件建立点焊工艺加工站,进一步检验算法在实际编程中的应用。 The mathematical model of solder joint path is established based on TSP problem.In order to improve the slow convergence speed of the genetic algorithm itself,the steps of fitness calculation evaluation and fitness proportion selection are adopted;in order to avoid the defects of local optimum,adaptive crossover,mutation operator and evolutionary reverse operation are adopted to enhance the global search ability of the algorithm.Finally,the spot-welding process processing station is established by using RobotStuidio simulation software to further verify the application of the algorithm in practical programming.
作者 赵铁军 罗羽枭 ZHAO Tiejun;LUO Yuxiao(School of Mechanical Engineering, Shenyang University of Technology, Shenyang 110870,China)
出处 《机械工程师》 2019年第10期7-9,共3页 Mechanical Engineer
关键词 点焊路径规划 TSP问题 自适应遗传算法 RobotStuidio仿真 spot-welding path planning TSP problem adaptive genetic algorithm RobotStuidio simulation0引言
  • 相关文献

参考文献6

二级参考文献77

  • 1龚志辉,黄星梅.二维矩形件优化排样算法的改进研究[J].湖南大学学报(自然科学版),2003,30(S1):47-49. 被引量:34
  • 2丁刚,徐敏强,侯立国.基于过程神经网络的航空发动机排气温度预测[J].航空动力学报,2009,24(5):1035-1039. 被引量:23
  • 3Garey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP-Completeness[M].San Francisco:Freeman W H,1979.
  • 4Lawer E,Lenstra J,Ronnooy K A,et al.The Traveling Salesman Problem[M].New York:Wiley-International Publication,1985.
  • 5Hopfield J J,Tank D W.Neural Computation of Decision in Optimization Problem[J].Biol Cybern,1985,52(1):141-152.
  • 6Wilson V,Pawlay G S.On the Stability of the TSP Problem Algorithm of Hopfield and Tank[J].Biol Cybern,1988,58(1):63-70.
  • 7Xu X,Tsai W T.Effective Neural Algorithms for the Traveling Salesman Problem[J].Neural Network,1991,4(1):193-205.
  • 8Wang S,Tsai C M.Hopfield Nets with Time-varying Energy Function for Solving the Traveling Salesman Problem[A].Int J Conf on Neural Networks[C].Seattle,Washington,1991:807-812.
  • 9Aiyer S V B,Niranjan M,Fallside F.A Theoretical Investigation into the Performance of the Hopfield Model[J].IEEE Trans on Neural Networks,1990,1(2):204-215.
  • 10Ackley D H,Hinton G E,Sejnowski T J.A Learning Algorithm for Boltzmann Machines[J].Cognitive Science,1985,9(1):147-169.

共引文献174

同被引文献44

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部