發(fā)布時(shí)間：2018-05-06 14:54

  本文選題：分布式倉庫 + NP-hard�。� 參考：《廣東工業(yè)大學(xué)》2015年碩士論文

【摘要】：隨著經(jīng)濟(jì)全球化和商品流通速度的加快,物流業(yè)在經(jīng)濟(jì)社會(huì)中的地位愈來愈重要,現(xiàn)已成為影響經(jīng)濟(jì)社會(huì)發(fā)展的一個(gè)重要因素。傳統(tǒng)的物流任務(wù)調(diào)度主要是針對單倉庫環(huán)境。如今伴隨著企業(yè)的發(fā)展與擴(kuò)張,這種單倉庫集中供貨模式因嚴(yán)重浪費(fèi)了人力物力,出庫效率低下已愈來愈不能滿足健康高效的物流要求。為了節(jié)約運(yùn)輸成本、減少人力物力的消耗,越來越多的企業(yè)選擇在多地設(shè)立若干個(gè)倉庫,采用分布式倉庫聯(lián)合的方式進(jìn)行出庫。這種措施雖然可以有效的節(jié)約運(yùn)輸成本、提高出庫效率,但也面臨著一系列亟待解決的難題：訂單個(gè)數(shù)、倉庫個(gè)數(shù)眾多,滿足出庫任務(wù)的倉庫組合有很多種,選擇哪種倉庫組合進(jìn)行出庫所需倉庫數(shù)最少,效率最高；選擇怎樣的出庫順序路徑最短,人力物力的消耗最少。此類問題是個(gè)復(fù)雜的NP-hard問題,而NP-hard問題一直是學(xué)術(shù)界研究的熱點(diǎn)與難點(diǎn)。課題針對分布式倉庫出庫任務(wù)調(diào)度問題,采用“覆蓋”的方法進(jìn)行了深入研究。首先,對分布式倉庫出庫問題進(jìn)行了研究,給出了問題的描述,提供了確定不可約簡覆蓋集的方法；其次,從簡單的單訂單出庫問題開始研究,緊扣問題建立數(shù)學(xué)模型,設(shè)計(jì)了一套啟發(fā)式算法對問題進(jìn)行了求解,用大量算例驗(yàn)證了算法的可行性和正確性；然后,針對多訂單出庫問題建立數(shù)學(xué)模型,設(shè)計(jì)了啟發(fā)式算法進(jìn)行求解,通過對大量算例的求解分析驗(yàn)證了算法的有效性和正確性；最后,開發(fā)了一個(gè)分布式倉庫出庫任務(wù)調(diào)度系統(tǒng),詳細(xì)介紹了系統(tǒng)目標(biāo)、系統(tǒng)需求分析、系統(tǒng)功能模塊、數(shù)據(jù)庫設(shè)計(jì)以及主要功能界面的實(shí)現(xiàn)。課題建立了分布式倉庫出庫的數(shù)學(xué)模型,運(yùn)用覆蓋理論和啟發(fā)式算法相結(jié)合的方式很好解決了分布式倉庫出庫這種復(fù)雜的NP-hrad問題,彌補(bǔ)了現(xiàn)有在此類問題上研究的不足。同時(shí),課題研究為解決多倉庫路徑優(yōu)化等問題提供了新思路。
[Abstract]:With the acceleration of economic globalization and the speed of commodity circulation, the logistics industry is becoming more and more important in the economic society, which has become an important factor affecting the economic and social development. Traditional logistics task scheduling is mainly aimed at single warehouse environment. Nowadays, with the development and expansion of enterprises, the centralized supply mode of single warehouse is a serious waste of manpower and material resources, and the inefficient delivery has become more and more unable to meet the requirements of healthy and efficient logistics. In order to save transportation cost and reduce the consumption of manpower and material resources, more and more enterprises choose to set up a number of warehouses in many places, and use the distributed warehouse joint way to get out of the warehouse. Although this measure can effectively save transportation cost and improve the efficiency of outgoing warehouse, it also faces a series of problems to be solved: the number of orders, the number of warehouses, the combination of warehouses to meet the task of leaving the warehouse, there are many kinds of warehouse combinations. Which kind of warehouse combination needs the least number of warehouses, the highest efficiency, the shortest route of exit order and the least consumption of manpower and material resources. This kind of problem is a complex NP-hard problem, and the NP-hard problem has always been a hot and difficult point in academic research. In order to solve the task scheduling problem of distributed warehouse, the overlay method is used in this paper. First of all, the problem of distributed warehouse exit is studied, the description of the problem is given, and the method of determining the irreducible covering set is provided. Secondly, starting with the simple single order exit problem, the mathematical model of the problem is established. A set of heuristic algorithms are designed to solve the problem, and a large number of examples are used to verify the feasibility and correctness of the algorithm. Then, a mathematical model is established for the multi-order exit problem, and a heuristic algorithm is designed to solve the problem. The validity and correctness of the algorithm are verified by solving a large number of examples. Finally, a distributed warehouse outgoing task scheduling system is developed, and the system objectives, system requirement analysis, system function modules are introduced in detail. Database design and the implementation of the main functional interface. In this paper, the mathematical model of distributed warehouse exit is established, and the complex NP-hrad problem of distributed warehouse exit is well solved by the combination of coverage theory and heuristic algorithm, which makes up for the deficiency of existing research on this kind of problem. At the same time, the research provides a new way to solve the problem of multi-warehouse path optimization.
【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：F259.2;F274

【參考文獻(xiàn)】

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

1 張靜樂;大規(guī)模組合優(yōu)化問題蟻群算法應(yīng)用研究[D];鄭州大學(xué);2006年

，

本文編號(hào)：1852752