【摘要】：自動化立體倉庫系統(tǒng)（Automated Storage and Retrieval System, AS/RS）作為現(xiàn)代工業(yè)領(lǐng)域出現(xiàn)的一種新型倉儲技術(shù)，具有節(jié)約勞動力、作業(yè)準(zhǔn)確高效、倉儲利用率高等特點，已成為柔性制造系統(tǒng)(Flexible Manufacturing System, FMS)和計算機(jī)集成制造系統(tǒng)（Computer Integrated Manufacturing System, CIMS）中不可或缺的重要組成部分。再則AS/RS涉及計算機(jī)技術(shù)、自動化技術(shù)、機(jī)械制造、電子技術(shù)、通信技術(shù)、智能優(yōu)化理論等諸多領(lǐng)域，是多學(xué)科交叉的前沿課題，因而，對AS/RS開展優(yōu)化研究具有重要的理論意義和應(yīng)用價值。 本文以某類企業(yè)的自動化立體倉庫為研究對象，進(jìn)行貨位分配優(yōu)化、倉庫調(diào)度單目標(biāo)優(yōu)化、倉庫調(diào)度多目標(biāo)優(yōu)化研究，同時針對多貨叉多巷道立體倉庫系統(tǒng)的性能評估進(jìn)行積極探索�？紤]到AS/RS是離散系統(tǒng)，因而，其優(yōu)化問題屬于一種組合優(yōu)化問題，也是NP難問題。同時，傳統(tǒng)精確算法求解效率與問題規(guī)模呈指數(shù)關(guān)系，很難在可接受的時間內(nèi)求出最優(yōu)或次優(yōu)解。鑒于此，本文采用智能優(yōu)化理論對AS/RS相關(guān)優(yōu)化問題進(jìn)行研究，并構(gòu)建了系統(tǒng)優(yōu)化與性能評估軟件平臺。本文主要研究工作概括如下： 1、在基于庫區(qū)的貨位分配優(yōu)化問題中，為克服僅僅依據(jù)產(chǎn)品訂單數(shù)量進(jìn)行貨位分配帶來的弊端，本文采用數(shù)理統(tǒng)計的思想對單個生產(chǎn)周期內(nèi)堆垛機(jī)平均運行時間進(jìn)行數(shù)學(xué)建模，以堆垛機(jī)單位周期內(nèi)的平均運行時間最小為目標(biāo)對貨位分配進(jìn)行優(yōu)化。同時，，提出一種改進(jìn)型細(xì)菌覓食算法對該問題進(jìn)行求解。基于種群多樣性貢獻(xiàn)率的遷移算子引入，增大了解空間的尋優(yōu)范圍，有效解決了易陷入局部最優(yōu)的缺陷；自適應(yīng)步長調(diào)整策略的實施，保證了前期的全局開拓尋優(yōu)及后期的局部開發(fā)尋優(yōu)。鑒于種群的大小會影響算法的性能，對種群的大小的選擇進(jìn)行了研究，并證明了算法的收斂性。最后結(jié)合現(xiàn)場實例對提出的算法進(jìn)行了仿真，結(jié)果表明該算法是有效的。 2、針對立體倉庫調(diào)度單目標(biāo)優(yōu)化問題，提出一種帶交叉及啟發(fā)式變異算子的蛙跳算法，交叉算子的引入有效阻止群體進(jìn)化的“停滯”現(xiàn)象；啟發(fā)式變異算法為提高算法全局尋優(yōu)能力，引導(dǎo)各子種群快速向最優(yōu)方向搜索，進(jìn)而提高收斂效率做出了貢獻(xiàn)。仿真結(jié)果表明該算法不僅提高了解的質(zhì)量，而且也進(jìn)一步提高了收斂速度，驗證了該算法的可行性。 3、針對產(chǎn)品質(zhì)量及生產(chǎn)效率的雙重要求，構(gòu)建了倉庫調(diào)度多目標(biāo)優(yōu)化數(shù)學(xué)模型�？紤]到目標(biāo)之間存在一定的矛盾或沖突，提出一種基于pareto思想的多目標(biāo)禁忌搜索算法。并提出基于矩陣論的鄰域產(chǎn)生技術(shù)，大大提高了鄰域的多樣性，同時為減少進(jìn)入局部最優(yōu)的機(jī)率，引入懲罰策略。仿真結(jié)果表明該算法不僅求出的pareto解集對其他算法呈絕對支配，而且分布均勻，從而驗證了該算法的可行性。 4、為對具有多貨叉、多巷道的立體倉庫系統(tǒng)進(jìn)行性能評估，更好地了解貨叉數(shù)量及巷道數(shù)與堆垛機(jī)揀選效率之間的關(guān)系，特對不同巷道不同貨叉不同運行速度下的堆垛機(jī)的揀選效率進(jìn)行了研究，并提出堆垛機(jī)揀選效率評估模型。同時，也對容量相同、尺寸不同的倉庫系統(tǒng)的堆垛機(jī)揀選效率的變化情況進(jìn)行了研究，并得出在容量相同的情況下，物理尺寸越接近方形的倉庫系統(tǒng)，其堆垛機(jī)揀選效率越高的結(jié)論。這對于自動化立體倉庫優(yōu)化設(shè)計及企業(yè)生產(chǎn)計劃安排將會有很好的指導(dǎo)作用。 5、采用C/S架構(gòu)，并基于模塊化的編程思想，搭建了立體倉庫系統(tǒng)優(yōu)化軟件平臺。這不僅解決了優(yōu)化算法可以適應(yīng)不同企業(yè)場合中的立體倉庫系統(tǒng)優(yōu)化問題，而且也為優(yōu)化方法在工業(yè)應(yīng)用中的可行性分析提供了參考依據(jù)。最后，結(jié)合某企業(yè)生產(chǎn)實際，對該系統(tǒng)進(jìn)行了測試與驗證。
[Abstract]:As a new type of storage technology in the field of modern industry, the Automated Storage and Retrieval System (AS/ RS) has the characteristics of saving labor force, accurate and efficient operation, high storage utilization ratio and the like, and has become the Flexible Manufacturing System. FMS is an integral part of Computer Integrated Manufacturing System (CIMS). In addition, AS/ RS involves many fields, such as computer technology, automation technology, machine manufacturing, electronic technology, communication technology, intelligent optimization theory, etc., it is the frontier subject of multi-disciplinary cross, so it is of great theoretical and practical value to carry out the optimization research on AS/ RS. In this paper, the automatic three-dimensional warehouse of a kind of enterprise is used as the research object, and the allocation optimization, the objective optimization of the warehouse schedule, the multi-objective optimization of the warehouse scheduling are carried out, and the performance evaluation of the multi-port multi-lane three-dimensional warehouse system is actively explored. So, considering that AS/ RS is a discrete system, the optimization problem is a combinatorial optimization problem, and it is NP hard to ask. in that meantime, the efficiency of the traditional exact algorithm is exponential with the scale of the problem, and it is difficult to find the optimal or sub-optimal in the acceptable time. In view of this, this paper studies the optimization problem of AS/ RS by using the intelligent optimization theory, and constructs the software level of system optimization and performance evaluation. The main research work of this paper is as follows: Next: 1. In the problem of allocation optimization based on the storage location of the reservoir area, to overcome the problem that the location allocation is only based on the quantity of the product order In this paper, the average running time of the stacker in a single production cycle is modeled by the method of mathematical statistics, and the average running time in the unit period of the stacker is the least as the target. At the same time, an improved bacteria feeding algorithm is proposed to solve the problem. The line is solved. The migration operator based on the contribution rate of the population diversity is introduced, the searching range of the space is increased, the defect that is easy to fall into the local optimal is effectively solved, the implementation of the adaptive step adjustment strategy is ensured, the global development of the early stage and the local opening in the later period are guaranteed. In view of the influence of the size of the population on the performance of the algorithm, the selection of the size of the population is studied and the algorithm is proved. Finally, the proposed algorithm is simulated with the field examples, and the results show that the algorithm is In order to solve the problem of single objective optimization of the three-dimensional warehouse, a frog-hop algorithm with a crossover and a heuristic mutation operator is proposed. The introduction of the crossover operator effectively prevents the 鈥渄ead鈥

本文編號：2420617