本文選題：立體倉(cāng)庫(kù) + 取料垛機(jī)��； 參考：《南昌大學(xué)》2017年碩士論文

【摘要】：在國(guó)內(nèi),一些制造企業(yè)已經(jīng)采用了自動(dòng)化立體倉(cāng)庫(kù)來管理自家的產(chǎn)品,同時(shí)采用了多系統(tǒng)集成的信息管理平臺(tái),給企業(yè)帶來了極大的管理方便。然而,某制造企業(yè)為了減少多個(gè)半成品物料競(jìng)爭(zhēng)同一個(gè)加工機(jī)床的情況發(fā)生,引進(jìn)了柔性自動(dòng)化生產(chǎn)線。該企業(yè)還配置一個(gè)立體倉(cāng)庫(kù),通過緩存待加工物料,減少物料在車間來回搬運(yùn)的時(shí)間。但是在立體倉(cāng)庫(kù)中執(zhí)行搬運(yùn)過程的取料垛機(jī)的運(yùn)行效率不高,引起了機(jī)床加工效率不高,進(jìn)而影響到了整個(gè)柔性自動(dòng)化生產(chǎn)線的生產(chǎn)效率。針對(duì)該企業(yè)取料垛機(jī)運(yùn)行低效的問題,本文依據(jù)實(shí)際車間情況,分析了此問題產(chǎn)生的原因在于垛機(jī)沒有充分利用本身的待工時(shí)間進(jìn)行有效的 準(zhǔn)備工作‖,沒有合理利用緩沖層的空閑貨位。為了優(yōu)化取料垛機(jī)的運(yùn)動(dòng)軌跡,減少垛機(jī)不必要的待工時(shí)間,本文在充分考慮垛機(jī)運(yùn)行軌跡和緩沖層貨位的合理利用的情況下,確立了優(yōu)化目標(biāo)為使得垛機(jī)的有效運(yùn)行時(shí)間最小,找到了實(shí)現(xiàn)途徑為優(yōu)選目標(biāo)貨位,明確了優(yōu)化策略為比較垛機(jī)當(dāng)前指令下的可選數(shù)與下一個(gè)指令的可選數(shù)之和的大小。通過建立相關(guān)的蟻群算法模型和貪婪算法模型,改善了這兩種算法的不足之處,提高了蟻群算法的收斂速度以及避免了貪婪算法陷入 死循環(huán)‖。最后,通過實(shí)例數(shù)據(jù)結(jié)果,驗(yàn)證了改進(jìn)后的算法對(duì)取料垛機(jī)運(yùn)動(dòng)軌跡優(yōu)化問題的有效性和可行性。
[Abstract]:In China, some manufacturing enterprises have adopted automated warehouse to manage their own products, and adopted multi-system integrated information management platform, which brings great management convenience to enterprises. However, in order to reduce the competition of many semi-finished materials with the same machine tool, a manufacturing enterprise introduced a flexible automatic production line. The enterprise also has a three-dimensional warehouse to cache materials to be processed to reduce the time to move materials back and forth in the workshop. However, the efficiency of the stacker, which carries out the handling process in the three-dimensional warehouse, is not high, which leads to the low efficiency of machine tool processing and thus affects the production efficiency of the whole flexible automatic production line. In view of the inefficient operation of the feeding and stacking machine in this enterprise, according to the actual situation of the workshop, this paper analyzes the reason for this problem is that the stacking machine does not make full use of its waiting time to carry out effective preparation work. There is no reasonable use of free space in the buffer layer. In order to optimize the moving track of the palletizing machine and reduce the unnecessary waiting time of the palletizing machine, this paper takes fully into account the running track of the palletizing machine and the reasonable utilization of the cargo position in the buffer layer. The optimization goal is established to minimize the effective running time of the palletizing machine, the way to realize the optimal selection of the target cargo is found, and the optimization strategy is to compare the number of selections under the current instruction of the palletizing machine and the sum of the selectable numbers of the next instruction. By establishing the relevant ant colony algorithm model and greedy algorithm model, the shortcomings of the two algorithms are improved, the convergence speed of the ant colony algorithm is improved and the greedy algorithm is avoided from falling into a dead cycle. Finally, the effectiveness and feasibility of the improved algorithm for the optimization of the movement trajectory of the palletizing machine are verified by the example data.
【學(xué)位授予單位】：南昌大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TH165.1

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 程啟清;王建生;王書付;;基于蟻群算法的孔群加工路徑優(yōu)化研究[J];機(jī)械研究與應(yīng)用;2016年05期

2 杜長(zhǎng)海;;基于混合蛙跳思想的蟻群算法及路徑優(yōu)化研究[J];自動(dòng)化技術(shù)與應(yīng)用;2016年04期

3 任永強(qiáng);汪超;洪婉君;王鵬;;基于遺傳算法的立體倉(cāng)庫(kù)堆垛機(jī)路徑規(guī)劃[J];物流科技;2015年08期

4 陳立;謝富強(qiáng);張亮;;基于消除交叉點(diǎn)的蟻群算法錫焊機(jī)器人路徑優(yōu)化[J];計(jì)算機(jī)系統(tǒng)應(yīng)用;2015年07期

5 曾強(qiáng);張澤斌;楊龍飛;;有容量限制的自動(dòng)化立體倉(cāng)庫(kù)堆垛機(jī)路徑規(guī)劃優(yōu)化方法[J];機(jī)械設(shè)計(jì)與制造;2015年01期

6 姜金貴;張鵬飛;;基于改進(jìn)蟻群算法的城市內(nèi)澇救援路徑優(yōu)化[J];計(jì)算機(jī)應(yīng)用;2014年07期

7 許川佩;蔡震;胡聰;;基于蟻群算法的數(shù)字微流控生物芯片在線測(cè)試路徑優(yōu)化[J];儀器儀表學(xué)報(bào);2014年06期

8 饒衛(wèi)振;金淳;;求解大規(guī)模CVRP問題的快速貪婪算法[J];管理工程學(xué)報(bào);2014年02期

9 薛明;;淺析自動(dòng)化立體倉(cāng)庫(kù)的應(yīng)用及發(fā)展[J];物流技術(shù);2014年02期

10 彭燁;涂海寧;顧嘉;;基于改進(jìn)捕食搜索算法的堆垛機(jī)揀選路徑優(yōu)化[J];制造業(yè)自動(dòng)化;2013年19期

相關(guān)碩士學(xué)位論文 前10條

1 鮑文杰;多態(tài)蟻群算法在TSP問題應(yīng)用中的改進(jìn)與優(yōu)化[D];浙江師范大學(xué);2016年

2 王云飛;基于蟻群算法的武警巡邏路徑優(yōu)化問題研究[D];國(guó)防科學(xué)技術(shù)大學(xué);2014年

3 潘t，

本文編號(hào)：2029265