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

  本文選題：港口集裝箱 + 岸吊與集卡��； 參考：《合肥工業(yè)大學(xué)》2015年碩士論文

【摘要】：由于世界經(jīng)濟(jì)的發(fā)展,世界各地之間貿(mào)易往來愈加頻繁。集裝箱運(yùn)輸這種新型運(yùn)輸方式出現(xiàn)僅有短短幾十年,由于順應(yīng)了時(shí)代的發(fā)展,港口集裝箱的吞吐量急速上升,同時(shí),為了追求規(guī)模效應(yīng),集裝箱船逐步向大型化方向發(fā)展。由于港口建設(shè)是一個復(fù)雜的系統(tǒng)工程,早期的港口投入使用之后在短期之內(nèi)即達(dá)到了吞吐量瓶頸,短期之內(nèi)不能再對港口重新設(shè)計(jì)施工。這些都對港口集裝箱的裝卸效率提出了更高的要求。提升港口對集裝箱的裝卸效率對于提升港口物流的集裝箱轉(zhuǎn)運(yùn)效率有重要實(shí)際意義。港口集裝箱的裝卸一般可以分為岸吊裝卸,集卡轉(zhuǎn)運(yùn)和堆場存儲三個環(huán)節(jié)。不同于以往只針對三個環(huán)節(jié)中某一個環(huán)節(jié)的優(yōu)化研究,本文針對岸吊與集卡聯(lián)合執(zhí)行集裝箱的混合裝卸問題,建立了整數(shù)規(guī)劃模型,并提出一種兩階段啟發(fā)式算法進(jìn)行求解。算法第一階段基于約翰遜法確定岸吊對集裝箱的裝卸順序,第二階段利用啟發(fā)式方法求解集卡的分派問題。最后數(shù)據(jù)實(shí)驗(yàn)結(jié)果表明本文算法能有效求解港口集裝箱混合裝卸的岸吊與集卡聯(lián)合調(diào)度問題。隨著港口集裝箱吞吐量的不斷增長,研究港口岸吊、集卡等多資源的聯(lián)合調(diào)度對于提高港口集裝箱的裝卸效率具有重要的理論意義與現(xiàn)實(shí)意義。
[Abstract]:With the development of the world economy, trade between different parts of the world is becoming more and more frequent. Container transport, a new type of transportation mode, has only appeared for a few decades. Due to the development of the times, the throughput of port containers is rising rapidly. At the same time, in order to pursue the scale effect, container ships are gradually developing towards the direction of large scale. Because port construction is a complex system engineering, the port has reached the bottleneck of throughput in the short term after the early port put into use, and the port can not be redesigned and constructed in the short term. These all put forward higher request to the loading and unloading efficiency of port container. It is of great practical significance to improve the container transfer efficiency of port logistics. The loading and unloading of port container can be divided into three links: onshore loading and unloading, card transfer and yard storage. Different from the previous research on the optimization of one of the three links, this paper presents an integer programming model for the mixed loading and unloading problem of the container carried out jointly by the shore crane and the collecting card, and proposes a two-stage heuristic algorithm to solve the problem. The first stage of the algorithm is based on the Johnson method to determine the loading and unloading sequence of the container. In the second stage, the heuristic method is used to solve the card allocation problem. Finally, the experimental results show that the proposed algorithm can effectively solve the joint scheduling problem of port container mixed loading and unloading. With the continuous growth of container throughput, it is of great theoretical and practical significance to study the joint dispatch of multi-resources such as port crane and card for improving the loading and unloading efficiency of port container.
【學(xué)位授予單位】：合肥工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U691.3

【參考文獻(xiàn)】

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

1 韓曉龍;集裝箱港口裝卸作業(yè)資源配置研究[D];上海海事大學(xué);2005年

，

本文編號：2009318