【摘要】：針對(duì)準(zhǔn)時(shí)化順序供應(yīng)的混流裝配生產(chǎn)線物料補(bǔ)給問題進(jìn)行數(shù)學(xué)規(guī)劃建模,通過決策各次物料補(bǔ)給作業(yè)的發(fā)車時(shí)間和料箱標(biāo)號(hào)使線邊物料的庫存成本最小.為了解決這一復(fù)雜的混合優(yōu)化問題,給出了問題的性質(zhì)分析,并將該問題轉(zhuǎn)化為求解最優(yōu)料箱配送序列的組合優(yōu)化問題.在此基礎(chǔ)上,構(gòu)建反向動(dòng)態(tài)規(guī)劃求解算法以獲得該問題的最優(yōu)解,并證明該算法具有指數(shù)級(jí)別的時(shí)間復(fù)雜度.為了求解中大規(guī)模調(diào)度問題,構(gòu)建了改進(jìn)蜂群算法,通過在鄰域搜索部分融合基于分布估計(jì)算法的個(gè)體更新機(jī)制來強(qiáng)化基本蜂群算法的收斂性能.最后通過仿真實(shí)驗(yàn)驗(yàn)證了所提出算法的可行性和有效性.
[Abstract]:The material supply problem of the mixed-flow assembly line supplied in the on-time order is modeled by the mathematical programming, and the inventory cost of the line-edge material is minimized by making the departure time and the material box label of each sub-material supply operation. In order to solve this complex hybrid optimization problem, the property analysis of the problem is given, and the problem is transformed into a combinatorial optimization problem for solving the optimal material box distribution sequence. On this basis, a reverse dynamic programming algorithm is constructed to obtain the optimal solution of the problem, and it is proved that the algorithm has the time complexity of the exponential level. In order to solve the problem of large-scale scheduling, an improved colony algorithm is built, and the convergence performance of the basic bee colony algorithm is enhanced by combining the individual updating mechanism based on the distribution estimation algorithm in the neighborhood search part. Finally, the feasibility and effectiveness of the proposed algorithm are verified by the simulation experiment.
【作者單位】： 同濟(jì)大學(xué)機(jī)械與能源工程學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(71471135,61273035)
【分類號(hào)】：TB497;TP18
，

本文編號(hào)：2425931