计算机集成制造系统 ›› 2020, Vol. 26 ›› Issue (10): 2753-2761.DOI: 10.13196/j.cims.2020.10.015

• 当期目次 • 上一篇    下一篇

基于个体扰动变异粒子群算法的线缆布线顺序规划方法

郭学鹏1,朱永国1+,王发麟1,宋利康2,陈大伟3   

  1. 1.南昌航空大学航空制造工程学院
    2.江西洪都航空工业集团有限责任公司经理部
    3.辽阳海关
  • 出版日期:2020-10-31 发布日期:2020-10-31
  • 基金资助:
    国家自然科学基金资助项目(51865037);航空科学基金资助项目(2019ZE056004);江西省教育厅科学技术研究资助项目(GJJ180539);江西省自然科学基金资助项目(20181BAB206029);南昌航空大学博士启动资金资助项目(EA201803301)。

Method of cable routing sequence planning based on individual perturbation mutation particle swarm optimization

  • Online:2020-10-31 Published:2020-10-31
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.51865037),the Aeronautical Science Foundation,China(2019ZE056004),the Science and Technology Research Program of Jiangxi Provincial Education Department,China(No.GJJ180539),the Natural Science Foundation of Jiangxi Province,China(No.20181BAB206029),and the Doctoral Start-up Fund of Nanchang Hang Kong University,China(No.EA201803301).

摘要: 复杂机电产品传统线缆布线以实物样机为基础,依据经验、参考设计接线表进行线缆布线效率低、易反复。为此,提出一种基于个体扰动变异粒子群算法的线缆布线顺序规划方法。首先建立了面向虚拟环境的线缆布线顺序可行性数学模型,完成了算法适应度函数的定义;然后,为适应线缆布线顺序规划的离散性,对基本粒子群算法进行了整数离散化;为避免基本粒子群算法易陷入局部最优和早熟收敛,将个体扰动变异搜索机制引入基本粒子群算法以改进粒子的位置,提高粒子全局搜索能力和局部寻优能力;最后,将该算法应用到某型相控阵雷达的线缆布线顺序规划中。实例证明该算法能求解出满足布线工艺的相控阵雷达线缆布线顺序,且算法精度和效率均高于基本粒子群算法。

关键词: 线缆, 布线, 顺序规划, 虚拟装配, 粒子群算法, 个体扰动变异

Abstract: Aiming at problem that the traditional cable routing of complex electromechanical products based on the physical prototype,which was inefficient and repetitive by experience and reference design wiring table,a cable routing sequence planning method based on the individual perturbation mutation particle swarm algorithm was proposed.A mathematical model for the cable routing sequence feasibility for virtual environment was established to define the algorithm fitness function.To accommodate the discreteness of cable routing sequence planning,the integer discretization for basic particle swarm algorithm was made.To avoid falling into local optimal and premature convergence of the basic particle swarm optimization algorithm,can be improved by introducing the individual perturbation mutation search mechanism was introduced to improve the particle position for raising the global search ability and local optimization ability of the particle.The proposed algorithm was applied to the cable routing sequence planning of phased array radar.The example proved that the algorithm could solve the cable routing sequence of phased array radar which met the wiring process,and the accuracy and efficiency of the algorithm based on individual perturbation mutation particle swarm optimization were higher than that of the basic particle swarm optimization algorithm.

Key words: cable, wiring, sequential planning, virtual assembly, particle swarm optimization algorithm, individual perturbation mutation

中图分类号: