發(fā)布時間：2018-03-31 19:33

  本文選題：裝配序列　切入點：螢火蟲優(yōu)化算法　出處：《火力與指揮控制》2017年11期

【摘要】：為了解決機(jī)械產(chǎn)品裝配序列優(yōu)化問題,提出了一種基于多群體改進(jìn)螢火蟲優(yōu)化算法的裝配序列規(guī)劃方法。建立了裝配序列規(guī)劃的數(shù)學(xué)模型,針對螢火蟲算法收斂效率低的不足,借鑒混合蛙跳算法族群劃分思想對螢火蟲算法進(jìn)行了改進(jìn),引用局部搜索與全局信息交換機(jī)制提升了算法性能;根據(jù)裝配序列規(guī)劃問題離散型的特點,定義了新的離散編碼方式和粒子更新策略。通過實例仿真結(jié)果表明,改進(jìn)后的螢火蟲優(yōu)化算法簡單有效、穩(wěn)定性好、求解精度高,能夠穩(wěn)定快速地給出裝配序列最優(yōu)方案。
[Abstract]:In order to solve the problem of assembly sequence optimization of mechanical products, an assembly sequence planning method based on multi-group improved firefly optimization algorithm is proposed.The mathematical model of assembly sequence planning is established. Aiming at the low convergence efficiency of the firefly algorithm, the hybrid leapfrog algorithm is improved based on the idea of population division.The local search and global information exchange mechanism are used to improve the performance of the algorithm, and a new discrete coding scheme and particle update strategy are defined according to the characteristics of discrete type of assembly sequence planning problem.The simulation results show that the improved firefly optimization algorithm is simple and effective, has good stability, high precision, and can provide the optimal assembly sequence scheme stably and quickly.
【作者單位】： 空軍工程大學(xué)防空反導(dǎo)學(xué)院;
【分類號】：TP18
，

本文編號：1692169