【摘要】：為滿足混線生產(chǎn)車間物料配送準(zhǔn)時(shí)化的需求,以配送路徑最小為目標(biāo)函數(shù),滿足配送工具裝載量、工位時(shí)間窗等約束條件,分析并建立了車間物料配送路徑優(yōu)化問題的模型。基于蟻群算法對螞蟻選擇概率作改進(jìn),引入確定性和探索性搜索擴(kuò)大搜索空間,并結(jié)合遺傳算法里的相關(guān)操作,改善全局搜索的局限性和收斂速度,運(yùn)用改進(jìn)的蟻群算法對模型求解。最后通過某汽車后橋生產(chǎn)車間實(shí)際案例分析,驗(yàn)證了該算法的有效性。為制造企業(yè)車間物料配送優(yōu)化提供了可參考的模型和算法。
[Abstract]:In order to meet the demand of just-in-time distribution of materials in mixed-line workshop, taking the minimum distribution path as the objective function and satisfying the constraints such as the loading of distribution tools and the time window of station, the model of optimization of material distribution path in workshop is analyzed and established. The ant colony algorithm is used to improve the selection probability of ants, and the deterministic and exploratory search is introduced to expand the search space. Combined with the related operations in the genetic algorithm, the limitation and convergence rate of global search are improved. The improved ant colony algorithm is used to solve the model. Finally, the effectiveness of the algorithm is verified by an actual case study of a car rear axle workshop. This paper provides a reference model and algorithm for the optimization of material distribution in workshop of manufacturing enterprises.
【作者單位】： 南昌大學(xué)機(jī)電工程學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(61263045)
【分類號】：TB497;TP18
，

本文編號：2455851