本文關(guān)鍵詞： 集裝箱碼頭 泊位分配 岸橋調(diào)度 魯棒性 遺傳算法 實(shí)時(shí)調(diào)度　出處：《天津理工大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著經(jīng)濟(jì)全球化進(jìn)程的不斷加快,世界各國(guó)之間的貿(mào)易往來日趨頻繁,集裝箱海上運(yùn)輸已成為連接全球供應(yīng)鏈的重要環(huán)節(jié),集裝箱碼頭作為集裝箱海上運(yùn)輸與陸地運(yùn)輸?shù)慕粎R點(diǎn),在國(guó)際運(yùn)輸網(wǎng)絡(luò)中扮演著越來越重要的角色。隨著國(guó)際競(jìng)爭(zhēng)的不斷加劇、以及國(guó)際貨物貿(mào)易量的不斷增加,集裝箱碼頭面臨的挑戰(zhàn)也越來越嚴(yán)峻,其資源優(yōu)化作業(yè)問題已成為物流領(lǐng)域研究的熱點(diǎn)問題,而如何合理有效地分配泊位和岸橋資源,尤其是提高泊位和岸橋作業(yè)計(jì)劃在不確定環(huán)境下的抗干擾能力,受到了研究者和業(yè)界管理人員重視。因此,本文對(duì)不確定環(huán)境下的泊位分配和岸橋分配的聯(lián)合魯棒調(diào)度問題進(jìn)行了研究,主要內(nèi)容如下:首先,研究了不確定環(huán)境下的連續(xù)泊位和岸橋聯(lián)合魯棒調(diào)度的預(yù)調(diào)度計(jì)劃問題,提出了基于時(shí)間冗余策略的泊位和岸橋聯(lián)合調(diào)度預(yù)分配模型。本文所提出的模型在引入緩沖時(shí)間作為魯棒性指標(biāo)的同時(shí),引入船舶計(jì)劃延誤時(shí)間的加權(quán)和作為服務(wù)性指標(biāo),并以船舶的裝卸作業(yè)量作為其靠泊服務(wù)權(quán)重,以體現(xiàn)決策者對(duì)于不同裝卸量船舶的延誤時(shí)間的重視程度。模型通過對(duì)預(yù)計(jì)到港船舶的計(jì)劃靠泊時(shí)刻、靠泊位置和分配岸橋數(shù)量進(jìn)行決策,以實(shí)現(xiàn)最小化所有靠泊船舶的延誤時(shí)間加權(quán)和(服務(wù)性指標(biāo))、最大化緩沖時(shí)間(魯棒性指標(biāo))的目標(biāo)。由于服務(wù)性指標(biāo)和魯棒性指標(biāo)存在著沖突,本文在以二者的加權(quán)和作為目標(biāo)函數(shù)的前提下,通過調(diào)整權(quán)重參數(shù)對(duì)方案的魯棒性和服務(wù)性進(jìn)行權(quán)衡。然后,對(duì)魯棒泊位和岸橋聯(lián)合調(diào)度模型進(jìn)行了深入的分析,得到了該數(shù)學(xué)模型的可行解和最優(yōu)解的一系列相關(guān)性質(zhì),證明了該問題一定存在一個(gè)最優(yōu)的左下緊計(jì)劃方案。因此,提出了一種基于改進(jìn)遺傳算法的求解最優(yōu)(近似最優(yōu))左下緊方案的求解算法,并提出了一種對(duì)左下緊方案進(jìn)行改進(jìn)的松弛化處理方法。仿真實(shí)驗(yàn)結(jié)果證明了本文提出的模型和求解算法的有效性。最后,建立了不確定環(huán)境下岸橋?qū)崟r(shí)調(diào)度問題的數(shù)學(xué)模型,針對(duì)實(shí)際調(diào)度過程中不確定因素的干擾,通過對(duì)實(shí)時(shí)調(diào)度問題數(shù)學(xué)模型的求解得到了實(shí)時(shí)岸橋調(diào)度策略,仿真實(shí)驗(yàn)表明,岸橋的實(shí)時(shí)調(diào)整進(jìn)一步提高了碼頭集裝箱裝卸作業(yè)的抗擾動(dòng)能力。
[Abstract]:With the accelerating process of economic globalization, the trade between countries in the world is becoming more and more frequent, container maritime transport has become an important link to connect the global supply chain. Container terminal, as the intersection of container transportation by sea and land transport, plays an increasingly important role in the international transportation network. With the increasing volume of international trade in goods, container terminals are facing more and more serious challenges. The optimization of their resources has become a hot issue in the field of logistics. However, how to allocate berths and quayside resources reasonably and effectively, especially to improve the anti-interference ability of berths and shore bridge operation plan in uncertain environment, has been paid attention to by researchers and industry managers. In this paper, the joint robust scheduling problem of berth allocation and shore bridge allocation in uncertain environment is studied. The main contents are as follows: first. In this paper, the problem of joint robust scheduling of continuous berths and quayside bridges in uncertain environments is studied. A preallocation model of berth and quayside joint scheduling based on time redundancy strategy is proposed. The proposed model introduces buffer time as a robust index. The weighted sum of the scheduled delay time is introduced as the service index, and the loading and unloading capacity of the ship is taken as the weight of the berthing service. In order to reflect the importance of decision makers to the delay time of ships with different loading and unloading capacity, the model makes decisions on the planned berthing time, berthing position and allocation of the number of quayside bridges for ships arriving at port. In order to achieve the goal of minimizing the weighted sum of delay time (service index) and maximizing buffer time (robustness index) of all berthing vessels, there is a conflict between service index and robust index. In this paper, the weighted sum of the two is taken as the objective function, and the robustness and service of the scheme are weighed by adjusting the weight parameters. Then. In this paper, the robust berth and shore bridge joint scheduling models are analyzed in depth, and a series of related properties of the feasible and optimal solutions of the mathematical model are obtained. It is proved that there must be an optimal left-down compact plan for this problem. Therefore, an improved genetic algorithm is proposed to solve the optimal (approximately optimal) left-down compact scheme. An improved relaxation processing method for the left-lower compact scheme is proposed. The simulation results show the effectiveness of the proposed model and the algorithm. Finally. The mathematical model of the real-time scheduling problem of shore bridge in uncertain environment is established. Aiming at the disturbance of uncertain factors in the actual scheduling process, the real-time scheduling strategy is obtained by solving the mathematical model of the real-time scheduling problem. The simulation results show that the real-time adjustment of the quayside bridge can further improve the anti-disturbance ability of container handling operations.
【學(xué)位授予單位】：天津理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U691.3

【參考文獻(xiàn)】

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

1 計(jì)明軍;靳志宏;;集裝箱碼頭集卡與岸橋協(xié)調(diào)調(diào)度優(yōu)化[J];復(fù)旦學(xué)報(bào)(自然科學(xué)版);2007年04期

2 孫鳳山;;港口發(fā)展集裝箱物流的優(yōu)勢(shì)和途徑[J];港口經(jīng)濟(jì);2007年02期

3 姜長(zhǎng)元;;動(dòng)態(tài)信息素更新蟻群算法在指派問題中的應(yīng)用[J];計(jì)算機(jī)工程;2008年15期

4 銀路;李天柱;;情景規(guī)劃在新興技術(shù)動(dòng)態(tài)評(píng)估中的應(yīng)用[J];科研管理;2008年04期

5 王芳;;不確定性因素對(duì)我國(guó)農(nóng)村居民現(xiàn)金消費(fèi)支出的影響分析[J];數(shù)理統(tǒng)計(jì)與管理;2006年04期

6 陳秋雙;杜玉泉;徐亞;;不確定環(huán)境下集裝箱碼頭的擾動(dòng)管理[J];物流技術(shù);2010年Z1期

7 周鵬飛;康海貴;;面向隨機(jī)環(huán)境的集裝箱碼頭泊位-岸橋分配方法[J];系統(tǒng)工程理論與實(shí)踐;2008年01期

8 孫彬;孫俊清;陳秋雙;;基于魯棒反應(yīng)式策略的泊位和岸橋聯(lián)合調(diào)度[J];系統(tǒng)工程理論與實(shí)踐;2013年04期

9 張?jiān)?;國(guó)際集裝箱運(yùn)輸市場(chǎng)2012年回顧與2013年展望[J];中國(guó)水運(yùn);2013年01期

相關(guān)會(huì)議論文 前1條

1 孫彬;孫俊清;劉鳳連;楊鵬;韓梅;馮美玲;;基于蟻群算法的魯棒離散泊位分配問題的研究[A];第二十九屆中國(guó)控制會(huì)議論文集[C];2010年

，

本文編號(hào)：1491757