本文選題：預(yù)翻箱　切入點(diǎn)：翻箱　出處：《武漢理工大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著我國(guó)經(jīng)濟(jì)的持續(xù)快速發(fā)展,港口集裝箱吞吐量快速增加,港口碼頭集裝箱擁堵和港口壓船現(xiàn)象不斷出現(xiàn)。如何提高港口集裝箱碼頭的裝卸速度和吞吐效率,從而減少船舶在港停泊時(shí)間成為我國(guó)集裝箱碼頭的當(dāng)務(wù)之急。在集裝箱堆場(chǎng),影響裝船效率的主要因素之一是堆場(chǎng)翻箱問(wèn)題,除了對(duì)裝船時(shí)取箱過(guò)程中的翻箱問(wèn)題進(jìn)行優(yōu)化,提高裝船效率的另一種方法就是對(duì)集裝箱進(jìn)行預(yù)翻箱整理,使得集裝箱的堆放順序符合取箱順序,以盡量減少取箱裝船過(guò)程中的翻箱次數(shù)。本文以集裝箱堆場(chǎng)單貝位出口箱裝船時(shí)和裝船前的翻箱過(guò)程為研究對(duì)象,對(duì)其進(jìn)行優(yōu)化,從而減少翻箱次數(shù),達(dá)到提高集裝箱碼頭裝船效率的目的。 本文首先介紹了集裝箱堆場(chǎng)和(預(yù))翻箱問(wèn)題,分析了翻箱操作產(chǎn)生的原因和其造成的影響,分析了降低翻箱次數(shù)的重要性和解決方法；然后提出了集裝箱堆場(chǎng)單貝位出口箱裝船時(shí)翻箱問(wèn)題的假設(shè),構(gòu)建了翻箱問(wèn)題的整數(shù)模型,結(jié)合貝位規(guī)模和箱子數(shù)量不斷變化的翻箱案例,利用分支定界精確算法對(duì)其進(jìn)行了優(yōu)化,并對(duì)優(yōu)化結(jié)果進(jìn)行了分析。 鑒于集裝箱堆場(chǎng)裝船時(shí)翻箱問(wèn)題屬于組合優(yōu)化問(wèn)題,具有NP特性,在問(wèn)題規(guī)模較大時(shí)利用分支定界算法難以或者無(wú)法在可以忍受的時(shí)間內(nèi)得到最優(yōu)解,因而本文針對(duì)裝船時(shí)翻箱過(guò)程中落箱位置的箱位選取設(shè)計(jì)了啟發(fā)式規(guī)則,利用visual c++編寫了翻箱問(wèn)題的程序,結(jié)合貝位規(guī)模及集裝箱數(shù)量不斷變化的翻箱問(wèn)題隨機(jī)案例,對(duì)其進(jìn)行了優(yōu)化,并對(duì)優(yōu)化結(jié)果進(jìn)行了分析,同時(shí)和分支定界算法的優(yōu)化結(jié)果進(jìn)行了比較,驗(yàn)證了其正確性。由于啟發(fā)式算法本身的特性,其對(duì)問(wèn)題進(jìn)行優(yōu)化得到的解只能是問(wèn)題的近優(yōu)解或可行解,本文基于問(wèn)題空間搜索算法的思想對(duì)提出的啟發(fā)式算法作了進(jìn)一步改進(jìn)。 本文提出了集裝箱堆場(chǎng)單貝位出口箱裝船前預(yù)翻箱問(wèn)題的假設(shè),構(gòu)建了裝船前預(yù)翻箱問(wèn)題的整數(shù)數(shù)學(xué)模型,利用分支定界精確算法對(duì)預(yù)翻箱隨機(jī)案例進(jìn)行了求解優(yōu)化,并對(duì)優(yōu)化結(jié)果進(jìn)行了分析。 優(yōu)化實(shí)驗(yàn)結(jié)果及其分析表明：1)分支定界算法能夠結(jié)合數(shù)學(xué)模型獲得問(wèn)題的精確解或最優(yōu)解,但隨著貝位規(guī)模及箱子數(shù)量的增大,時(shí)間成本呈指數(shù)增加；2)啟發(fā)式算法及基于問(wèn)題空間搜索的改進(jìn)啟發(fā)式算法,能在較短時(shí)間內(nèi)得到問(wèn)題的近優(yōu)解或可行解；3)隨著案例規(guī)模的增大,改進(jìn)后的啟發(fā)式算法能夠較改進(jìn)前的啟發(fā)式算法得到質(zhì)量更高的解。
[Abstract]:With the continuous and rapid development of economy in our country, the container throughput of the port increases rapidly, the container congestion of the port terminal and the phenomenon of loading and unloading in the port constantly appear. How to improve the loading and unloading speed and the throughput efficiency of the port container terminal? In the container yard, one of the main factors affecting the loading efficiency is the problem of loading yard turnover, except for the optimization of the turning over of the container during the process of loading and taking out the container, so as to reduce the time of ship berthing in the port of our country, and to reduce the berthing time of the ship in the port becomes the urgent matter for the container terminal in our country. Another way to improve the efficiency of loading is to pre-turn the containers so that the stacking order of the containers conforms to the order of taking out the containers. In order to reduce the number of times of turning over the container during loading, this paper takes the process of turning over the container during loading and before loading of the single shell exit box in the container yard as the research object, and optimizes it so as to reduce the times of turning over the container. To achieve the purpose of improving the loading efficiency of container terminal. In this paper, the problems of container yard and (pre) turnover are introduced, the causes and effects of the operation are analyzed, and the importance and solution of reducing the times of turning over are analyzed. Then it puts forward the hypothesis of the problem of turning over the container during the loading of the single shell exit box in the container yard, and constructs an integer model of the problem of turning over the box, combining with the case of the changing of the scale of the shell and the number of the box. The branch and bound algorithm is used to optimize the algorithm, and the optimization results are analyzed. In view of the combinatorial optimization problem when loading container yard, which has NP characteristic, it is difficult or intolerable to obtain the optimal solution by using branch and bound algorithm when the scale of the problem is large. In this paper, a heuristic rule is designed to select the position of the drop box during loading, and a program is developed by using visual c, combining with the random case of the changing size of the shell and the quantity of the container. The optimization results are analyzed and compared with the optimization results of the branch and bound algorithm. The correctness of the heuristic algorithm is verified. The optimal solution to the problem can only be the near optimal solution or the feasible solution. Based on the idea of the problem space search algorithm, the heuristic algorithm is further improved in this paper. In this paper, the hypothesis of the pre-overturning problem of single-shell exit container in container yard is proposed, and the integer mathematical model of pre-turning box problem before loading is constructed, and the stochastic case of pre-overturning box is solved and optimized by using the exact algorithm of branch and bound. The optimization results are analyzed. The results of the optimization experiment and its analysis show that the branch and bound algorithm can be combined with mathematical model to obtain the exact solution or the optimal solution of the problem, but with the increase of the size of the shell and the number of boxes, The time cost increases exponentially and the heuristic algorithm and the improved heuristic algorithm based on the search of problem space can get the near optimal solution or feasible solution of the problem in a relatively short time) with the increase of the case scale. The improved heuristic algorithm can get a higher quality solution than the improved heuristic algorithm.
【學(xué)位授予單位】：武漢理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：U695.22

【參考文獻(xiàn)】

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

1 郝聚民,紀(jì)卓尚,林焰;混合順序作業(yè)堆場(chǎng)BAY優(yōu)化模型[J];大連理工大學(xué)學(xué)報(bào);2000年01期

2 賴穎彥;王曉;;集裝箱翻箱過(guò)程優(yōu)化關(guān)鍵技術(shù)[J];中國(guó)港口;2007年08期

3 王強(qiáng);;集裝箱碼頭堆場(chǎng)作業(yè)效率提升方法探究[J];中國(guó)市場(chǎng);2009年36期

4 金鵬;黃有方;嚴(yán)偉;;位內(nèi)集裝箱翻箱操作的啟發(fā)式優(yōu)化[J];上海海事大學(xué)學(xué)報(bào);2009年04期

5 張維英;林焰;紀(jì)卓尚;;集裝箱船全航線Bay位排箱優(yōu)化模型[J];上海交通大學(xué)學(xué)報(bào);2007年02期

6 計(jì)三有;高悅文;;集裝箱堆場(chǎng)減少倒箱率方法研究[J];水運(yùn)工程;2006年08期

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

1 李斌;基于動(dòng)態(tài)規(guī)劃的貝位內(nèi)集裝箱翻箱優(yōu)化[D];大連海事大學(xué);2011年

2 郭媚;集裝箱碼頭堆場(chǎng)優(yōu)化管理研究[D];大連海事大學(xué);2006年

3 陳慶偉;基于遺傳算法的堆場(chǎng)貝位分配優(yōu)化問(wèn)題研究[D];青島大學(xué);2007年

4 林治國(guó);基于滾動(dòng)窗口的集裝箱碼頭泊位動(dòng)態(tài)調(diào)度優(yōu)化研究[D];大連海事大學(xué);2010年

5 邊展;基于混合動(dòng)態(tài)規(guī)劃的集裝箱裝船順序優(yōu)化[D];大連海事大學(xué);2012年

，

本文編號(hào)：1591281