【摘要】：泊位和岸橋資源是集裝箱港口的重要稀缺資源,其調(diào)度計劃的安排直接影響著碼頭的服務(wù)質(zhì)量和后方系統(tǒng)的調(diào)度和運輸計劃。高效的泊位和岸橋調(diào)度計劃是集裝箱碼頭服務(wù)質(zhì)量和競爭力的核心保障。在集裝箱碼頭的日常調(diào)度中,外部環(huán)境中的不確定性使泊位和岸橋計劃受到各種干擾的沖擊。如何快速應(yīng)對日常干擾,迅速做出反應(yīng),保持碼頭日常生產(chǎn)的正常和高效進(jìn)行,已成為集裝箱碼頭資源調(diào)度的一個重要研究課題。針對此問題,本文基于干擾管理理論和集裝箱碼頭泊位和岸橋調(diào)度理論提出了集裝箱碼頭日常干擾恢復(fù)的方法。首先,基于干擾管理理論,本文采取適應(yīng)性調(diào)度方法進(jìn)行干擾恢復(fù),即當(dāng)干擾事件發(fā)生后進(jìn)行動態(tài)調(diào)度。本文的恢復(fù)調(diào)整策略主要通過對于泊位和岸橋資源在限定范圍內(nèi)的重新分配實現(xiàn)。同時在重新分配資源的時候,考慮到恢復(fù)成本的限制,將新分配的靠泊位置和岸橋數(shù)量以一定的概率分布限定在船舶原始最佳靠泊位置以及船舶可用岸橋數(shù)量的范圍之內(nèi);在分配岸橋資源時,為提升計劃調(diào)整的靈活性,提出岸橋數(shù)量可變的動態(tài)分配形式,同時為減少頻繁岸橋調(diào)動帶來的成本,本文限定了相鄰調(diào)度時間區(qū)間岸橋的變動數(shù)量。另外本文也考慮了搶工船舶速遣帶來的正面效益,作為對于成本的一種補償加入模型中。模型采用雙目標(biāo)規(guī)劃的形式,同時考慮原始計劃目標(biāo)的維護(hù)和恢復(fù)成本的最小化,即第一個目標(biāo)為最小化船舶在港時間和離港時間偏離,第二個目標(biāo)為最小化恢復(fù)成本,包括水平運輸成本、操作成本正增加量以及速遣船舶收益。針對以上模型和泊位岸橋調(diào)度問題的特性,本文采用了基于吱呀輪優(yōu)化的啟發(fā)式算法。利用吱呀輪優(yōu)化算法解決資源配置問題的高效性,通過調(diào)整問題元素的解決順序,使“瓶頸”問題元素首先得到解決,從而從整體上提高效率和運算效果。最后,本文通過和采取先到先服務(wù)準(zhǔn)則的調(diào)度計劃相比較,利用具體的算例驗證了算法的有效性,并通過情景模擬,探索延遲船舶數(shù)量、損壞岸橋數(shù)量、速遣船舶數(shù)量等因素對于結(jié)果的影響。最后,針對重要的泊位偏離系數(shù)和岸橋效率折算系數(shù)進(jìn)行了敏感性分析。本文提出的模型和調(diào)度恢復(fù)策略可以為碼頭實際干擾恢復(fù)調(diào)度提供參考,具有理論和實際意義。
[Abstract]:Berth and shore bridge resources are important scarce resources in container ports. The scheduling plan of berths directly affects the service quality of the terminal and the scheduling and transportation plan of the rear system. Efficient berth and shore-bridge scheduling plan is the core guarantee of container terminal service quality and competitiveness. In the daily dispatching of container terminal, the uncertainty of external environment makes berth and shore bridge plan be impacted by all kinds of interference. How to deal with daily interference quickly and respond quickly to maintain the normal and efficient daily production of container terminal has become an important research topic of container terminal resource scheduling. Aiming at this problem, based on the theory of interference management, berth of container terminal and dispatching theory of shore bridge, this paper puts forward the method of daily disturbance recovery of container terminal. Firstly, based on the theory of interference management, this paper adopts adaptive scheduling method to restore interference, that is, dynamic scheduling when interference events occur. The strategy of restoration adjustment in this paper is mainly realized by reallocating berth and quayside resources within a limited range. At the same time, when redistributing resources, considering the limitation of restoration cost, the newly allocated berthing position and the number of shore bridges are limited to the range of the original optimal berthing position and the number of available shore bridges of the ship with a certain probability distribution. In order to improve the flexibility of planning adjustment, a dynamic allocation form with variable number of quayside bridges is put forward in order to increase the flexibility of planning and adjustment. In order to reduce the cost of frequent bank bridge mobilization, this paper limits the number of changes in the adjacent scheduling time interval. In addition, this paper also considers the positive benefits brought by the rapid dispatch of the snatching ship as a compensation for the cost to be added to the model. The model adopts the form of two-objective programming, considering the maintenance and restoration cost minimization of the original planning objective, that is, the first objective is to minimize the deviation of the ship's time in port and departure time, and the second objective is to minimize the recovery cost. Including horizontal transport costs, the positive increase in operating costs and prompt shipping revenue. In view of the above model and the characteristics of berth bridge scheduling problem, a heuristic algorithm based on wheel-crunching optimization is adopted in this paper. The efficiency of the resource allocation problem is solved by using the squeaky wheel optimization algorithm. By adjusting the solution order of the problem elements, the "bottleneck" problem element can be solved first, thus improving the efficiency and the operation effect as a whole. Finally, by comparing the scheduling plan with the first-come first served criterion, the effectiveness of the algorithm is verified by a concrete example, and the number of delayed ships and damaged shore bridges are explored by scenario simulation. The effect of factors such as the number of ships sent on the result. Finally, the sensitivity analysis of the important berth deviation coefficient and the efficiency conversion coefficient is carried out. The model and scheduling recovery strategy presented in this paper can provide a reference for the actual disturbance recovery and dispatch of wharf, which is of theoretical and practical significance.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U691.3

【相似文獻(xiàn)】

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

1 王雅山;碼頭泊位水深維護(hù)管理探討[J];港口裝卸;1998年01期

2 張海濱;張紀(jì)會;宣金釗;;集裝箱碼頭泊位調(diào)度問題的啟發(fā)式算法研究[J];青島大學(xué)學(xué)報(工程技術(shù)版);2010年04期

3 鐘朝暉，，駱江輝;行標(biāo)《港口碼頭泊位代碼》簡介[J];交通標(biāo)準(zhǔn)化;1995年02期

4 鹿海龍;論防城港11~#、12~#碼頭泊位工程建設(shè)的必要性[J];廣西交通科技;1999年04期

5 王雅山;碼頭泊位水深維護(hù)、管理探討[J];水運工程;1997年11期

6 陳超;王海燕;;集裝箱碼頭泊位生產(chǎn)運作優(yōu)化模型[J];大連海事大學(xué)學(xué)報;2009年04期

7 王鵬;金勇;;開敞蝶形碼頭泊位長度研究綜述[J];水運工程;2011年S1期

8 ;碼頭泊位的標(biāo)準(zhǔn)尺度[J];水運工程;1978年08期

9 李強(qiáng);楊春霞;王諾;佟士祺;;集裝箱碼頭泊位生產(chǎn)調(diào)度均衡優(yōu)化[J];沈陽建筑大學(xué)學(xué)報(自然科學(xué)版);2008年06期

10 王健;楊春霞;楊贊;;基于Memetic算法的集裝箱碼頭泊位應(yīng)急調(diào)度策略[J];大連海事大學(xué)學(xué)報;2011年02期

相關(guān)重要報紙文章 前10條

1 記者 陳瑞珠;招銀港又有6個碼頭泊位對外開放[N];閩南日報;2007年

2 記者 程鐘康;莆田投資70億建設(shè)碼頭泊位[N];中國水運報;2008年

3 記者 林俊禹;投資70億建設(shè)碼頭泊位[N];湄洲日報;2008年

4 首席記者 蔡立軍 通訊員 胡志強(qiáng) 呂e

本文編號：2156928