本文選題：虛擬單元調(diào)度 + 遺傳—蟻群算法　； 參考：《淮海工學(xué)院學(xué)報(bào)(自然科學(xué)版)》2016年04期

【摘要】：為提高虛擬單元調(diào)度效率,在虛擬單元構(gòu)建完成基礎(chǔ)上,綜合考慮生產(chǎn)資源的有限性約束,構(gòu)建以總流程時(shí)間最短為目標(biāo)的非線性整數(shù)規(guī)劃模型,并提出具有較好全局搜索能力及快速收斂性的遺傳—蟻群算法來求解調(diào)度模型.最后,將遺傳—蟻群算法應(yīng)用于船舶生產(chǎn)實(shí)際,結(jié)果顯示有效消除了等待時(shí)間,降低了各作業(yè)的總流程時(shí)間,驗(yàn)證了模型的可行性和有效性.
[Abstract]:In order to improve the efficiency of virtual cell scheduling, based on the completion of virtual cell construction and considering the limitation of production resources, a nonlinear integer programming model aiming at the shortest total process time is constructed. A genetic ant colony algorithm with good global searching ability and fast convergence is proposed to solve the scheduling model. Finally, the genetic ant colony algorithm is applied to ship production practice. The results show that the waiting time is effectively eliminated, the total process time of each operation is reduced, and the feasibility and validity of the model are verified.
【作者單位】： 江蘇科技大學(xué)經(jīng)濟(jì)管理學(xué)院;淮海工學(xué)院商學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(71271105) 教育部人文社會(huì)科學(xué)研究規(guī)劃基金項(xiàng)目(12YJA630036)
【分類號(hào)】：TP18
，

本文編號(hào)：1997406