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

【摘要】：針對(duì)產(chǎn)品拆卸序列規(guī)劃問(wèn)題,提出一種基于花朵授粉算法的求解拆卸序列規(guī)劃問(wèn)題的方法。結(jié)合智能優(yōu)化算法求解拆卸序列規(guī)劃問(wèn)題的特點(diǎn),采用遺傳算法的優(yōu)先關(guān)系保留交叉操作方式,對(duì)花朵授粉算法的授粉方式進(jìn)行了離散化處理。在建立離散花朵授粉算法的基礎(chǔ)上,構(gòu)建了評(píng)價(jià)拆卸序列質(zhì)量的適應(yīng)度函數(shù)模型。通過(guò)實(shí)例對(duì)離散花朵授粉算法在不同初始條件設(shè)置的情況下進(jìn)行了實(shí)驗(yàn)分析,并與遺傳算法進(jìn)行了比較,證明了所提算法的可行性與優(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.
【作者單位】： 裝甲兵工程學(xué)院兵器工程系;
【基金】：軍隊(duì)科研計(jì)劃項(xiàng)目~~
【分類號(hào)】：TP18
，

本文編號(hào)：1612314