本文選題：自動(dòng)化立體倉(cāng)庫(kù) + 貨位分配　； 參考：《重慶工商大學(xué)》2015年碩士論文

【摘要】：在現(xiàn)代物流系統(tǒng)中,自動(dòng)化立體倉(cāng)庫(kù)作為其中的重要組成部分,集存儲(chǔ)、搬運(yùn)和配送于一體,在現(xiàn)代化企業(yè)中發(fā)揮了重大的作用。自動(dòng)化立體庫(kù)是一個(gè)綜合復(fù)雜的自動(dòng)化系統(tǒng),它的存取作業(yè)調(diào)度問題直接影響著整體系統(tǒng)的工作效率。為了有效地管理和提高系統(tǒng)整體的作業(yè)效率,必須對(duì)其存取作業(yè)調(diào)度進(jìn)行優(yōu)化,從而減少貨物的移動(dòng)距離和存取時(shí)間,以此最終提高企業(yè)經(jīng)濟(jì)效益。因此,本文對(duì)自動(dòng)化立體倉(cāng)庫(kù)存取作業(yè)調(diào)度兩階段優(yōu)化的研究有著重要的理論意義和實(shí)際應(yīng)用價(jià)值。本文的研究就以下幾方面開展:闡述了選題的背景、相關(guān)文獻(xiàn)綜述和主要內(nèi)容,即研究的主要問題和工作。并詳細(xì)地介紹了相關(guān)理論,主要包括自動(dòng)化立體倉(cāng)庫(kù)方面的理論和求解算法等。這些理論研究都為之后開展研究工作建立良好基礎(chǔ)。重點(diǎn)研究自動(dòng)化立體倉(cāng)庫(kù)存取作業(yè)調(diào)度兩階段的優(yōu)化。存取作業(yè)調(diào)度包括兩個(gè)過程,第一個(gè)過程是貨位分配,第二個(gè)過程是存取作業(yè)路徑。所以兩階段優(yōu)化的過程為,第一階段對(duì)貨位分配的優(yōu)化研究,第二階段在貨位分配的基礎(chǔ)上進(jìn)行存取作業(yè)路徑優(yōu)化研究。首先分別描述了貨位分配和存取作業(yè)路徑問題,然后第一階段提出了貨位分配的數(shù)學(xué)模型,針對(duì)該模型給出了求解的算法。第二階段是在貨位分配的基礎(chǔ)上以最小化堆垛機(jī)對(duì)周期內(nèi)全部物料完成存取作業(yè)的總時(shí)間作為優(yōu)化目標(biāo),以分類存儲(chǔ)的堆垛機(jī)復(fù)合和單一作業(yè)共同執(zhí)行的方式為研究對(duì)象,提出了存取作業(yè)路徑優(yōu)化的模型。針對(duì)該模型,提出了兩種算法,一種是基于尋找離原點(diǎn)(出入庫(kù)臺(tái))最近且時(shí)間最短貨位策略的遺傳算法,另一種是基于尋找離原點(diǎn)(出入庫(kù)臺(tái))最近且時(shí)間最短貨位策略的遺傳退火算法,分別給出兩種算法的實(shí)現(xiàn)步驟,為解決實(shí)際問題提供了理論方法。最后通過MATLAB對(duì)算法運(yùn)行求解,FLEXSIM仿真軟件對(duì)優(yōu)化模型進(jìn)行可視化仿真研究。針對(duì)某個(gè)仿真算例,按照兩階段優(yōu)化的思路,先進(jìn)行貨位分配優(yōu)化,根據(jù)確定的貨位,進(jìn)行第二階段的存取作業(yè)調(diào)度研究,基于已提出的模型和算法,給出了六種仿真方案。經(jīng)過仿真結(jié)果分析可知,兩階段優(yōu)化模型是有效的,并通過多次運(yùn)行模型驗(yàn)證表明所提的方法是有效的。
[Abstract]:As an important part of modern logistics system, automated warehouse plays an important role in modern enterprises by integrating storage, transportation and distribution. Automated stereo library is a complex automation system, its access job scheduling problem directly affects the working efficiency of the whole system. In order to effectively manage and improve the operation efficiency of the whole system, it is necessary to optimize the scheduling of the access jobs so as to reduce the moving distance and access time of the goods, and finally improve the economic benefits of the enterprises. Therefore, this paper has important theoretical significance and practical application value to the research of two-stage optimization of access job scheduling in automated warehouse. The research in this paper is carried out in the following aspects: the background of the topic, the relevant literature review and main contents, namely the main problems and work of the research. The related theories are introduced in detail, including the theory and algorithm of automated warehouse. These theoretical studies have established a good foundation for the later research work. This paper focuses on the optimization of two stages of access job scheduling in automated warehouse. Access job scheduling consists of two processes: the first is the allocation of cargo spaces and the second is the access job path. So the process of two-stage optimization is as follows: the first stage is the optimization of the allocation of cargo space, the second stage is on the basis of the allocation of the cargo location, and the second stage is based on the optimization of the access operation path. Firstly, the location assignment and access operation path problems are described respectively. Then, in the first stage, the mathematical model of cargo location assignment is proposed, and the algorithm for solving this model is given. The second stage is to minimize the total time for the stacker to complete the access operation of all the materials in the cycle on the basis of the distribution of the cargo position. The research object is the combination of the classified storage stacker and the single job as the research object. A model of access job path optimization is proposed. For this model, two algorithms are proposed, one is genetic algorithm based on finding the nearest and shortest time position strategy to the origin. The other is based on the genetic annealing algorithm, which is based on finding the nearest and shortest time position strategy from the origin. The implementation steps of the two algorithms are given respectively, which provide a theoretical method for solving the practical problems. Finally, the optimization model is visualized and simulated by MATLAB with FLEXSIM simulation software. Aiming at a certain simulation example, according to the idea of two-stage optimization, this paper first optimizes the allocation of cargo space, and according to the determined location, carries out the second stage access job scheduling research. Based on the proposed model and algorithm, six simulation schemes are presented. The simulation results show that the two-stage optimization model is effective and the proposed method is proved to be effective by several running models.
【學(xué)位授予單位】：重慶工商大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：F252.1

【參考文獻(xiàn)】

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

1 陳東;劉希玉;;遺傳算法在貨位分配中的應(yīng)用研究[J];電腦知識(shí)與技術(shù)(學(xué)術(shù)交流);2007年08期

2 陳璐;陸志強(qiáng);;自動(dòng)化立體倉(cāng)庫(kù)中的儲(chǔ)位分配及存取路徑優(yōu)化[J];管理工程學(xué)報(bào);2012年01期

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

1 曹少寧;Z市煙草公司物流配送中心規(guī)劃[D];首都經(jīng)濟(jì)貿(mào)易大學(xué);2008年

2 孔祥卓;基于FLEXSIM的自動(dòng)化立體倉(cāng)庫(kù)揀選作業(yè)優(yōu)化及仿真[D];沈陽(yáng)工業(yè)大學(xué);2009年

，

本文編號(hào)：2047705