本文關(guān)鍵詞：集裝箱碼頭動態(tài)連續(xù)型泊位分配問題研究　出處：《大連海事大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 集裝箱碼頭 動態(tài)連續(xù)泊位分配 總成本 禁忌搜索算法 系統(tǒng)仿真

【摘要】：泊位是集裝箱碼頭的稀缺資源,合理制定靠泊計劃,提高泊位利用率,縮短船舶在港時間,增加碼頭生產(chǎn)利潤,從而提升碼頭對客戶的服務(wù)水平以及在整個行業(yè)內(nèi)的競爭力,是集裝箱碼頭不斷發(fā)展的重要途徑。針對泊位分配問題,本文系統(tǒng)歸納和總結(jié)了泊位分配的相關(guān)文獻(xiàn),發(fā)現(xiàn)目前對于動態(tài)連續(xù)型泊位分配問題的研究仍不是十分理想,因此,動態(tài)連續(xù)型泊位分配問題還需要進(jìn)一步地改進(jìn)和完善。本文研究的問題是集裝箱碼頭動態(tài)連續(xù)型泊位分配問題,屬于單一環(huán)節(jié)的調(diào)度優(yōu)化問題。典型的泊位分配問題有兩種：離散型泊位分配和連續(xù)型泊位分配。前者的優(yōu)勢在于可以方便地安排泊位分配計劃但是不能有效地利用碼頭岸線,后者則具有完全相反的特點(diǎn)。在集裝箱船舶箱位大幅增長的趨勢下,在有多種船型的船舶掛靠的樞紐港需要更加靈活的泊位分配計劃。本文在集卡調(diào)度成本基于靠泊位置的假設(shè)前提下,以碼頭服務(wù)船舶的總成本最小化為目標(biāo),根據(jù)問題特性設(shè)計禁忌搜索算法來求解集裝箱碼頭動態(tài)連續(xù)型動態(tài)泊位分配問題。對此本文進(jìn)行了數(shù)據(jù)實(shí)驗(yàn),證明了禁忌搜索算法對解決該問題有較好的效果。最后基于離散系統(tǒng)仿真理論,利用集裝箱碼頭仿真軟件FlexTerm對算例結(jié)果進(jìn)行了仿真分析,證明了算法的有效性和可靠性。
[Abstract]:Berth is a scarce resource of container terminal. It can make berthing plan rationally, improve berth utilization ratio, shorten ship's time in port and increase the profit of wharf production. To improve the terminal service level to customers and the competitiveness of the entire industry is an important way for the continuous development of container terminals. In this paper, the related literature on berth allocation is summarized systematically, and it is found that the research on dynamic continuous berth assignment is still not very ideal. The dynamic continuous berth allocation problem needs to be further improved and improved. The problem studied in this paper is the dynamic continuous berth allocation problem of container terminals. There are two typical berth allocation problems:. The advantage of discrete berth allocation and continuous berth allocation is that the former can arrange berth allocation plan conveniently but can not make effective use of wharf shoreline. The latter has the opposite characteristics. Under the trend of large increase of container space. A more flexible berth allocation plan is needed in a hub port with multiple ship types. This paper aims at minimizing the total cost of terminal service under the assumption that the card collection scheduling cost is based on the berthing position. Tabu search algorithm is designed according to the characteristics of the problem to solve the dynamic continuous berth assignment problem of container terminal. The Tabu search algorithm is proved to be effective in solving this problem. Finally, based on the theory of discrete system simulation, the simulation results of container terminal simulation software FlexTerm are simulated and analyzed. The validity and reliability of the algorithm are proved.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U691.3

【參考文獻(xiàn)】

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

1 宋俊典;林家駿;姜麗;;基于DEVS的目標(biāo)跟蹤系統(tǒng)UML建模[J];華東理工大學(xué)學(xué)報(自然科學(xué)版);2008年06期

2 劉忠,鄧蘇,沙基昌,張維明;DEVS的面向?qū)ο罂梢暬J];計算機(jī)仿真;2001年01期

3 汪鋒,陶德馨;Witness仿真軟件在集裝箱碼頭模擬系統(tǒng)中的應(yīng)用[J];交通與計算機(jī);2003年02期

4 孫少文;楊斌;胡志華;;潮汐影響下的港口離散泊位分配問題研究[J];合肥工業(yè)大學(xué)學(xué)報(自然科學(xué)版);2014年04期

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

1 李平;港口泊位分配與裝卸橋調(diào)度系統(tǒng)的建模與優(yōu)化[D];天津理工大學(xué);2007年

，

本文編號：1381707