本文選題：拆卸序列規(guī)劃　切入點：花朵授粉算法　出處：《計算機集成制造系統(tǒng)》2016年12期 　論文類型：期刊論文

【摘要】：針對產(chǎn)品拆卸序列規(guī)劃問題,提出一種基于花朵授粉算法的求解拆卸序列規(guī)劃問題的方法。結合智能優(yōu)化算法求解拆卸序列規(guī)劃問題的特點,采用遺傳算法的優(yōu)先關系保留交叉操作方式,對花朵授粉算法的授粉方式進行了離散化處理。在建立離散花朵授粉算法的基礎上,構建了評價拆卸序列質量的適應度函數(shù)模型。通過實例對離散花朵授粉算法在不同初始條件設置的情況下進行了實驗分析,并與遺傳算法進行了比較,證明了所提算法的可行性與優(yōu)越性。
[Abstract]:Aiming at the product disassembly sequence planning problem, a method based on flower pollination algorithm is proposed to solve the disassembly sequence planning problem, which combines the characteristics of intelligent optimization algorithm to solve the disassembly sequence planning problem. In this paper, the priority relation of genetic algorithm (GA) is used to preserve the cross operation mode, and the pollination method of the flower pollination algorithm is discretized, and the discrete flower pollination algorithm is established based on the discrete flower pollination algorithm. A fitness function model for evaluating the quality of disassembly sequence is constructed. The discrete flower pollination algorithm is experimentally analyzed under different initial conditions and compared with genetic algorithm. The feasibility and superiority of the proposed algorithm are proved.
【作者單位】： 裝甲兵工程學院兵器工程系;
【基金】：軍隊科研計劃項目~~
【分類號】：TP18
，

本文編號：1612314