本文關(guān)鍵詞： 自動(dòng)化立體倉(cāng)庫(kù) 揀選作業(yè)調(diào)度優(yōu)化 Petri網(wǎng) 改進(jìn)遺傳算法 Flexsim仿真　出處：《重慶大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

【摘要】：企業(yè)將降低人工和材料作為第一利潤(rùn)源泉,擴(kuò)大市場(chǎng)銷售作為為第二利潤(rùn)源泉,而把降低物流費(fèi)用作為第三利潤(rùn)源泉。隨著生產(chǎn)制造系統(tǒng)的迅速發(fā)展,其系統(tǒng)的高效率與物流系統(tǒng)的低效率越來(lái)越不匹配。在企業(yè)生產(chǎn)制造過(guò)程中,自動(dòng)化立體倉(cāng)庫(kù)在物料及成品的物流過(guò)程中扮演非常重要的角色,立體倉(cāng)庫(kù)是一個(gè)作業(yè)任務(wù)隨機(jī)的復(fù)雜系統(tǒng),若對(duì)自動(dòng)化立體倉(cāng)庫(kù)的生產(chǎn)調(diào)度不合理,將極大地降低倉(cāng)庫(kù)的運(yùn)行效率,從而影響整個(gè)企業(yè)的運(yùn)行效率。當(dāng)自動(dòng)化立體倉(cāng)庫(kù)面臨高強(qiáng)度與大批量快速作業(yè)時(shí),作業(yè)若僅依照作業(yè)到達(dá)的順序執(zhí)行,忽略存在的沖突及共享資源競(jìng)爭(zhēng)等情況,導(dǎo)致系統(tǒng)有效作業(yè)運(yùn)行時(shí)間、堆垛機(jī)的運(yùn)行效率無(wú)法達(dá)到最優(yōu),將很大程度上降低系統(tǒng)整體運(yùn)作效率,所以對(duì)作業(yè)調(diào)度進(jìn)行優(yōu)化特別重要,所以本文針對(duì)作業(yè)調(diào)度優(yōu)化問(wèn)題主要完成了以下工作:①針對(duì)自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)調(diào)度的復(fù)雜性,本文通過(guò)對(duì)自動(dòng)化立體倉(cāng)庫(kù)的組成及作業(yè)過(guò)程進(jìn)行了深入分析,隨著揀選作業(yè)任務(wù)的增加,調(diào)度組合呈指數(shù)增長(zhǎng),從物理的層面闡述了揀選作業(yè)調(diào)度優(yōu)化問(wèn)題,并提出揀選作業(yè)調(diào)度過(guò)程中可變時(shí)間因素概念。②針對(duì)自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)調(diào)度優(yōu)化問(wèn)題,論文采用賦量Petri網(wǎng)方法對(duì)其建立綜合模型及揀選作業(yè)調(diào)度Petri網(wǎng)模型,提出作業(yè)調(diào)度優(yōu)化的可變部分時(shí)間消耗及固定時(shí)間部分消耗的數(shù)學(xué)表達(dá),從數(shù)學(xué)的層面研究揀選作業(yè)調(diào)度優(yōu)化問(wèn)題。③針對(duì)自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)調(diào)度面對(duì)調(diào)度組合呈指數(shù)增長(zhǎng)難以快速優(yōu)質(zhì)尋優(yōu)的問(wèn)題,本文在揀選作業(yè)調(diào)度Petri網(wǎng)模型基礎(chǔ)上,設(shè)計(jì)了基于Petri網(wǎng)與改進(jìn)遺傳算法結(jié)合算法對(duì)其進(jìn)行優(yōu)化調(diào)度,并采用揀選作業(yè)調(diào)度算例比較所設(shè)計(jì)的算法與標(biāo)準(zhǔn)遺傳算法優(yōu)化效果,驗(yàn)證了所設(shè)計(jì)的算法對(duì)于自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)調(diào)度優(yōu)化效果更優(yōu)。④針對(duì)揀選作業(yè)調(diào)度過(guò)程建立Flexsim仿真模型,設(shè)計(jì)3組實(shí)驗(yàn)進(jìn)行對(duì)比分析,3組實(shí)驗(yàn)中巷道堆垛機(jī)采用不同的調(diào)度策略,通過(guò)對(duì)統(tǒng)計(jì)數(shù)據(jù)的分析驗(yàn)證所設(shè)計(jì)的基于Petri網(wǎng)與改進(jìn)遺傳算法結(jié)合算法對(duì)揀選作業(yè)調(diào)度優(yōu)化過(guò)程的有效性,并對(duì)比標(biāo)準(zhǔn)遺傳算法優(yōu)化的優(yōu)勢(shì)。
[Abstract]:Enterprises will reduce labor and materials as the first source of profit, expand market sales as the second source of profit, and reduce logistics costs as the third source of profit. The high efficiency of the system and the low efficiency of the logistics system are more and more unmatched. In the manufacturing process of the enterprise, the automated warehouse plays a very important role in the logistics process of materials and finished products. Stereo warehouse is a complex system with random job tasks. If the production scheduling of automated warehouse is not reasonable, the efficiency of warehouse operation will be greatly reduced. This affects the efficiency of the whole enterprise. When the automated warehouse is faced with high intensity and large quantity of fast work, if the jobs are executed only according to the order of the jobs' arrival, the conflicts and the competition of shared resources are ignored, and so on. As a result of the effective operation time of the system, the efficiency of the stacker can not reach the optimum, which will greatly reduce the overall operational efficiency of the system, so it is very important to optimize the job scheduling. So this paper mainly completes the following work: 1 aiming at the complexity of sorting job scheduling in automated stereoscopic warehouse. This paper deeply analyzes the composition and operation process of automated three-dimensional warehouse. With the increase of job picking tasks, scheduling combination increases exponentially. The optimization problem of picking job scheduling is expounded from the physical aspect. The concept of variable time factor in the process of sorting job scheduling is proposed. 2. Aiming at the optimization problem of sorting job scheduling in automated stereoscopic warehouse, a comprehensive model and a Petri net model of picking job scheduling are established by the method of Petri net. The mathematical expressions of variable partial time consumption and fixed time partial consumption for job scheduling optimization are presented. This paper studies the optimization problem of picking job scheduling from the mathematical level. 3 in view of the problem that the scheduling of picking jobs in automated stereoscopic warehouses is difficult to find optimization quickly and high quality in the face of exponential growth of scheduling combinations, this paper is based on the Petri net model of picking job scheduling. The optimal scheduling algorithm based on Petri net and improved genetic algorithm is designed, and the optimization effect of the algorithm is compared with that of standard genetic algorithm by picking job scheduling example. It is verified that the designed algorithm is more effective in optimizing the scheduling of picking jobs in automated warehouse. 4. The Flexsim simulation model is established for the scheduling process of picking jobs. Three groups of experiments were designed to compare and analyze the different scheduling strategies used in the tunnel stacker in three groups of experiments. The effectiveness of the proposed algorithm based on Petri net and improved genetic algorithm is verified by analyzing the statistical data, and the superiority of the standard genetic algorithm is compared with that of the standard genetic algorithm.
【學(xué)位授予單位】：重慶大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：F274

【相似文獻(xiàn)】

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

1 舒展 ,佟毅純;建設(shè)銀行國(guó)際卡系統(tǒng)作業(yè)調(diào)度和文件傳輸解決方案[J];中國(guó)金融電腦;2004年04期

2 楊朋;繆立新;秦磊;;多載具自動(dòng)化存取系統(tǒng)作業(yè)調(diào)度優(yōu)化[J];計(jì)算機(jī)集成制造系統(tǒng);2013年07期

3 潘全科,王化明,孫志峻,朱劍英;基于生產(chǎn)成本的作業(yè)調(diào)度[J];南京航空航天大學(xué)學(xué)報(bào);2004年01期

4 王新穎;;化工原料生產(chǎn)間歇作業(yè)調(diào)度建模[J];科技創(chuàng)新導(dǎo)報(bào);2010年25期

5 聶峰;程珩;;多功能穿梭車優(yōu)化調(diào)度研究[J];物流技術(shù);2008年10期

6 谷利民;鄭江;;應(yīng)用架構(gòu)管理的利器[J];金融電子化;2007年05期

7 ;[J];;年期

相關(guān)會(huì)議論文 前3條

1 裴爾明;Karim Bernardet;于傳松;孫功星;;基于Agent技術(shù)“推拉”結(jié)合的網(wǎng)格作業(yè)調(diào)度系統(tǒng)[A];第十四屆全國(guó)核電子學(xué)與核探測(cè)技術(shù)學(xué)術(shù)年會(huì)論文集（2）[C];2008年

2 劉禮;楊裔;火久元;劉海迪;李振芳;李廉;;數(shù)學(xué)網(wǎng)絡(luò)集成環(huán)境作業(yè)調(diào)度系統(tǒng)模型[A];2006年全國(guó)理論計(jì)算機(jī)科學(xué)學(xué)術(shù)年會(huì)論文集[C];2006年

3 裴爾明;Karim Bernardet;于傳松;孫功星;;基于Agent技術(shù)“推拉”結(jié)合的網(wǎng)格作業(yè)調(diào)度系統(tǒng)[A];第十四屆全國(guó)核電子學(xué)與核探測(cè)技術(shù)學(xué)術(shù)年會(huì)論文集（下冊(cè)）[C];2008年

相關(guān)重要報(bào)紙文章 前1條

1 陳超;有效作業(yè)調(diào)度實(shí)現(xiàn)高效生產(chǎn)[N];中國(guó)計(jì)算機(jī)報(bào);2004年

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

1 鄒敢;柔性搬運(yùn)系統(tǒng)的智能作業(yè)調(diào)度方法研究[D];昆明理工大學(xué);2014年

2 顧學(xué)民;分布式制造環(huán)境下的作業(yè)調(diào)度研究[D];西北工業(yè)大學(xué);2006年

3 梁毅;面向網(wǎng)絡(luò)計(jì)算的作業(yè)調(diào)度系統(tǒng)關(guān)鍵技術(shù)研究[D];中國(guó)科學(xué)院研究生院（計(jì)算技術(shù)研究所）;2005年

4 顧濤;集群MapReduce環(huán)境中任務(wù)和作業(yè)調(diào)度若干關(guān)鍵問(wèn)題的研究[D];南開(kāi)大學(xué);2014年

5 高昊江;板料加工車間物流智能控制及倉(cāng)儲(chǔ)管理系統(tǒng)研究[D];華中科技大學(xué);2007年

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

1 干一宏;面向航天制造企業(yè)的車間作業(yè)調(diào)度與指導(dǎo)技術(shù)研究[D];南京理工大學(xué);2015年

2 代應(yīng)祥;基于Hadoop的作業(yè)調(diào)度策略研究[D];電子科技大學(xué);2015年

3 周凱;高性能計(jì)算中作業(yè)調(diào)度技術(shù)與集群管理系統(tǒng)的研究[D];江蘇科技大學(xué);2015年

4 侯明霞;云計(jì)算環(huán)境下作業(yè)調(diào)度策略研究[D];電子科技大學(xué);2014年

5 王海明;基于Hadoop的作業(yè)調(diào)度方案研究[D];東北大學(xué);2013年

6 燕明磊;Hadoop平臺(tái)下基于遺傳算法的作業(yè)調(diào)度的研究與改進(jìn)[D];西安工程大學(xué);2015年

7 趙新;基于排隊(duì)網(wǎng)的拉式作業(yè)調(diào)度系統(tǒng)建模與仿真[D];沈陽(yáng)工業(yè)大學(xué);2016年

8 謝楊;自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)調(diào)度優(yōu)化研究[D];重慶大學(xué);2015年

9 羅惠星;基于批量作業(yè)調(diào)度的算法研究[D];上海師范大學(xué);2015年

10 林薇;多目標(biāo)多約束環(huán)境下的生產(chǎn)計(jì)劃與作業(yè)調(diào)度方法研究[D];東華大學(xué);2008年

，

本文編號(hào)：1555888