【摘要】：作為國際物流供應(yīng)鏈的重要環(huán)節(jié)之一，能否提供快速、可靠、靈活的綜合物流經(jīng)營服務(wù)是現(xiàn)代港口的重要標(biāo)志之一。泊位與堆場(chǎng)是港口的核心資源，合理的泊位、堆場(chǎng)分配可以有效降低港口擁堵率，提高港口運(yùn)營效率。針對(duì)泊位分配與堆場(chǎng)分配問題，本文系統(tǒng)性地歸納與分析了大量國內(nèi)外相關(guān)文獻(xiàn)研究，發(fā)現(xiàn)傳統(tǒng)的泊位、堆場(chǎng)分配問題通常是確定性模型且各自獨(dú)立，即假設(shè)各艘船舶到港時(shí)間與其在泊位操作時(shí)間為確定數(shù)值，繼而進(jìn)行相關(guān)獨(dú)立優(yōu)化研究。然而，在實(shí)際港口運(yùn)作環(huán)境下，船舶會(huì)因一些外界因素致使它們的到港時(shí)間及其在泊位操作時(shí)間存在一定隨機(jī)變化。此外，港口堆場(chǎng)的分配結(jié)果與各船舶到港時(shí)間也有著緊密的聯(lián)系。因此，不確定性環(huán)境下的港口泊位與堆場(chǎng)分配問題還需要進(jìn)一步改進(jìn)和完善。圍繞上述問題，本文著重進(jìn)行了如下三個(gè)方面的研究： 一、分別考慮船舶到港時(shí)間不確定性和船舶在泊操作時(shí)間不確定性兩大因素，提出了一個(gè)混合整數(shù)規(guī)劃模型去優(yōu)化泊位分配。針對(duì)該模型，設(shè)計(jì)了一種基于遺傳算法的啟發(fā)式求解方法，并通過一系列數(shù)值實(shí)驗(yàn)，驗(yàn)證了該模型的有效性和實(shí)用性。 二、考慮到泊位的分配結(jié)果會(huì)對(duì)堆場(chǎng)分配產(chǎn)生直接影響，提出了一個(gè)港口泊位與堆場(chǎng)分配的聯(lián)合優(yōu)化算法。建立了一個(gè)混合整數(shù)規(guī)劃模型，設(shè)計(jì)了有針對(duì)性的遺傳算法求解。加入了一系列算例實(shí)驗(yàn)，，對(duì)比了此聯(lián)合優(yōu)化算法與傳統(tǒng)算法的優(yōu)劣，證實(shí)了此聯(lián)合優(yōu)化算法的可行性與有效性。 三、綜合考慮了不確定性環(huán)境和泊位、堆場(chǎng)分配之間的聯(lián)系，提出了一個(gè)基于不確定性環(huán)境下的港口泊位與堆場(chǎng)分配的聯(lián)合優(yōu)化算法。建立了一個(gè)集成優(yōu)化模型，基于遺傳進(jìn)化的思想，開發(fā)了一體化求解算法。利用Matlab編程軟件分別求解了幾組大規(guī)模算例實(shí)驗(yàn)，驗(yàn)證了模型的有效性。
[Abstract]:As one of the important links of international logistics supply chain, it is one of the important signs of modern port to provide fast, reliable and flexible integrated logistics service. Berth and yard are the core resources of the port. Rational berth and yard allocation can effectively reduce the congestion rate and improve the efficiency of port operation. In order to solve the problem of berth allocation and yard assignment, this paper systematically summarizes and analyzes a large number of relevant domestic and foreign literature studies, and finds that the traditional berth and yard allocation problems are usually deterministic models and are independent of each other. That is to say, assuming that the arrival time of each ship and its operating time in berth are certain values, the independent optimization study is carried out. However, in the actual port operation environment, there are some random changes in the arrival time and the operating time of the ship in the berth due to some external factors. In addition, the distribution of the port yard is closely related to the arrival time of each ship. Therefore, the problem of port berth and yard allocation in uncertain environment needs to be further improved and perfected. Based on the above problems, this paper focuses on the following three aspects: first, the uncertainty of ship arrival time and the uncertainty of ship operating time at berth are considered respectively. A mixed integer programming model is proposed to optimize berth allocation. In this paper, a heuristic method based on genetic algorithm is designed for this model, and a series of numerical experiments are carried out to verify the validity and practicability of the model. Second, considering that berth allocation results will have a direct impact on yard allocation, a joint optimization algorithm for berth and yard allocation is proposed. A mixed integer programming model is established and a specific genetic algorithm is designed to solve the problem. A series of numerical examples are added to compare the advantages and disadvantages of the joint optimization algorithm with the traditional algorithm, which proves the feasibility and effectiveness of the joint optimization algorithm. Thirdly, considering the relationship between uncertain environment, berth and yard assignment, a joint optimization algorithm based on port berth and yard assignment under uncertain environment is proposed. An integrated optimization model is established and an integrated solution algorithm is developed based on the idea of genetic evolution. The Matlab programming software is used to solve several groups of large-scale numerical examples, and the validity of the model is verified.
【學(xué)位授予單位】：上海大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U691.3

【參考文獻(xiàn)】

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

1 衛(wèi)家駿;;出口集裝箱堆場(chǎng)位置的優(yōu)化[J];重慶交通大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年03期

2 韓駿;孫曉娜;靳志宏;;集裝箱碼頭泊位與岸橋協(xié)調(diào)調(diào)度優(yōu)化[J];大連海事大學(xué)學(xué)報(bào);2008年02期

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

4 嚴(yán)偉;宓為建;萇道方;何軍良;;一種基于最佳優(yōu)先搜索算法的集裝箱堆場(chǎng)場(chǎng)橋調(diào)度策略[J];中國工程機(jī)械學(xué)報(bào);2008年01期

5 楊春霞;王諾;;基于SPEA2算法的泊位調(diào)度多目標(biāo)優(yōu)化[J];工業(yè)工程與管理;2010年03期

6 李建忠;丁以中;王斌;;集裝箱堆場(chǎng)空間動(dòng)態(tài)配置模型[J];交通運(yùn)輸工程學(xué)報(bào);2007年03期

7 歐陽玲萍;王錫淮;肖健梅;;基于蟻群算法的泊位調(diào)度問題[J];控制工程;2009年S2期

8 陳俊豪,孫士寅;海港船舶—泊位調(diào)度算法的探討[J];上海第二工業(yè)大學(xué)學(xué)報(bào);1988年03期

9 李建忠,韓曉龍;集裝箱港口堆場(chǎng)輪胎式龍門起重機(jī)的動(dòng)態(tài)優(yōu)化配置[J];上海海事大學(xué)學(xué)報(bào);2005年03期

10 何軍良;宓為建;謝塵;嚴(yán)偉;;基于分布式混合遺傳算法的動(dòng)態(tài)泊位分配策略與仿真[J];上海海事大學(xué)學(xué)報(bào);2008年02期

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

1 李娜;集裝箱碼頭連續(xù)泊位與岸橋調(diào)度聯(lián)合優(yōu)化研究[D];大連海事大學(xué);2011年

2 李強(qiáng);集裝箱碼頭泊位調(diào)度均衡優(yōu)化方法研究[D];大連理工大學(xué);2009年

本文編號(hào)：2437214