本文關(guān)鍵詞： 調(diào)度 資源約束 可重用資源 分支定界　出處：《上海交通大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：汽車(chē)制造業(yè)的零部件入廠(chǎng)物流運(yùn)輸采用專(zhuān)用料箱完成。專(zhuān)用料箱作為一種可重用資源，對(duì)運(yùn)輸?shù)耐瓿芍陵P(guān)重要。料箱不足，不但會(huì)影響車(chē)輛的裝載率，更會(huì)影響運(yùn)輸?shù)牡却龝r(shí)間，甚至造成生產(chǎn)計(jì)劃的延誤，導(dǎo)致運(yùn)輸效率低下。本文研究基于可重用空箱資源約束下的多車(chē)輛運(yùn)輸調(diào)度問(wèn)題，目標(biāo)為最小化最大完工時(shí)間。 首先給出了問(wèn)題的數(shù)學(xué)描述，根據(jù)一定的假設(shè)，將問(wèn)題轉(zhuǎn)化為帶有資源約束的平行機(jī)調(diào)度問(wèn)題，建立了混合整數(shù)線(xiàn)性規(guī)劃模型，為高效地得到問(wèn)題的最優(yōu)解，本文設(shè)計(jì)了分支定界算法，并針對(duì)問(wèn)題的上界、下界給出了多種設(shè)計(jì)方案。進(jìn)一步，，為提高分支定界的計(jì)算規(guī)模，提出了滾動(dòng)式分支定界算法。 為驗(yàn)證算法性能，本文設(shè)計(jì)了合理的試驗(yàn)參數(shù)并進(jìn)行數(shù)值試驗(yàn)。針對(duì)小規(guī)模問(wèn)題，通過(guò)與CPLEX精確求解進(jìn)行比較，驗(yàn)證算法的有效性。進(jìn)一步，對(duì)大規(guī)模問(wèn)題，通過(guò)與啟發(fā)式算法比較，驗(yàn)證滾動(dòng)分支定界算法的有效性。結(jié)果表明，本文所提出的模型與滾動(dòng)算法技巧具備有效性及高效性。 本文所提出的模型與算法具有一定的理論價(jià)值，對(duì)優(yōu)化零部件入廠(chǎng)物流具有一定的指導(dǎo)意義。
[Abstract]:As a kind of reusable resource, the special material box is very important to the completion of the transportation. The shortage of the material box will not only affect the loading rate of the vehicle. It will affect the waiting time of transportation, even lead to the delay of production plan, and lead to inefficient transportation. This paper studies the problem of multi-vehicle transportation scheduling based on the constraints of reusable empty box resources. The goal is to minimize the maximum completion time. Firstly, the mathematical description of the problem is given. According to certain assumptions, the problem is transformed into a parallel machine scheduling problem with resource constraints, and a mixed integer linear programming model is established to obtain the optimal solution of the problem efficiently. In this paper, a branch and bound algorithm is designed, and a variety of design schemes are given for the upper bound and lower bound of the problem. Furthermore, in order to improve the calculation scale of the branch and bound, a rolling branch and bound algorithm is proposed. In order to verify the performance of the algorithm, reasonable experimental parameters are designed and numerical experiments are carried out. For small scale problems, the validity of the algorithm is verified by comparing with CPLEX. The effectiveness of the rolling branch and bound algorithm is verified by comparing with the heuristic algorithm for large-scale problems. The results show that the model and the rolling algorithm presented in this paper are effective and efficient. The model and algorithm proposed in this paper have certain theoretical value, and have certain guiding significance for optimizing parts entry logistics.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U492.22

【參考文獻(xiàn)】

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

1 范靜,楊啟帆;機(jī)器帶準(zhǔn)備時(shí)間的三臺(tái)平行機(jī)排序問(wèn)題的線(xiàn)性時(shí)間算法[J];浙江大學(xué)學(xué)報(bào)(理學(xué)版);2005年03期

2 歐錦文,施保昌;平行機(jī)排序鄰域搜索算法設(shè)計(jì)[J];計(jì)算機(jī)工程與應(yīng)用;2003年18期

3 徐武來(lái);黎展滔;毛寧;陳慶新;;具有交貨期和工裝數(shù)量約束的平行機(jī)調(diào)度[J];機(jī)電工程技術(shù);2012年09期

4 樊保強(qiáng),董廣龍,曲桂東,張玉忠;帶約束的平行機(jī)排序問(wèn)題[J];曲阜師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2003年04期

5 談之奕,何勇;帶機(jī)器準(zhǔn)備時(shí)間的平行機(jī)在線(xiàn)與半在線(xiàn)排序[J];系統(tǒng)科學(xué)與數(shù)學(xué);2002年04期

6 羅守成;陳峰;唐國(guó)春;;平行機(jī)排序問(wèn)題的列生成解法[J];系統(tǒng)科學(xué)與數(shù)學(xué);2008年06期

7 陳榮軍;唐國(guó)春;;平行機(jī)的供應(yīng)鏈排序[J];系統(tǒng)科學(xué)與數(shù)學(xué);2010年02期

本文編號(hào)：1456085