本文選題：碼頭場(chǎng)橋　切入點(diǎn)：路徑優(yōu)化　出處：《大連海事大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

【摘要】：集裝箱運(yùn)輸作為一種先進(jìn)的運(yùn)輸組織形式,在國(guó)內(nèi)外被廣泛采用。集裝箱碼頭,是集裝箱運(yùn)輸?shù)囊粋�(gè)關(guān)鍵節(jié)點(diǎn)。隨著集裝箱運(yùn)輸量的增加,集裝箱碼頭作業(yè)所承受的壓力增大。資源配備、信息技術(shù)及經(jīng)營(yíng)管理方式等都是影響集裝箱碼頭作業(yè)水平的重要因素。在碼頭已有的資源配置下,如何提高資源的作業(yè)效率,是亟待解決的問(wèn)題。本文即在此環(huán)境下,對(duì)集裝箱碼頭內(nèi)場(chǎng)橋的調(diào)度進(jìn)行優(yōu)化研究,旨在通過(guò)優(yōu)化場(chǎng)橋的移動(dòng)路徑,縮短其作業(yè)時(shí)間,達(dá)到資源的有效利用。本文以集裝箱碼頭內(nèi)場(chǎng)橋?yàn)檠芯繉?duì)象,運(yùn)用運(yùn)籌學(xué)中線性規(guī)劃、動(dòng)態(tài)規(guī)劃等優(yōu)化理論與方法,研究場(chǎng)橋調(diào)度的優(yōu)化問(wèn)題。建立了兩階段規(guī)劃的數(shù)學(xué)模型,第一階段建立線性約束的混合整數(shù)規(guī)劃模型,確定子任務(wù)內(nèi)場(chǎng)橋需要進(jìn)行作業(yè)的貝位號(hào)和在對(duì)應(yīng)貝位上的取箱數(shù)量；第二階段將研究問(wèn)題分單場(chǎng)橋和多場(chǎng)橋兩種情況進(jìn)行解決,以總移動(dòng)距離最小為目標(biāo),確定場(chǎng)橋在進(jìn)行任務(wù)時(shí)作業(yè)貝位號(hào)的順序,結(jié)合第一階段求得的取箱數(shù)量,最終獲得每臺(tái)場(chǎng)橋進(jìn)行任務(wù)時(shí)作業(yè)的貝位號(hào)序列和對(duì)應(yīng)貝位上的取箱數(shù)量。本文設(shè)計(jì)了線性規(guī)劃和動(dòng)態(tài)規(guī)劃相結(jié)合的算法,第一階段首先對(duì)研究問(wèn)題進(jìn)行線性化和連續(xù)化,運(yùn)用單純形法求得使所有場(chǎng)橋在完成總?cè)蝿?wù)時(shí)需要進(jìn)行作業(yè)的貝位數(shù)量最少的集合和在對(duì)應(yīng)貝位上的取箱數(shù)量；第二階段采用動(dòng)態(tài)規(guī)劃的方法,考慮場(chǎng)橋在作業(yè)每個(gè)子任務(wù)及之后的五個(gè)子任務(wù),選擇場(chǎng)橋移動(dòng)距離最小的貝位號(hào)進(jìn)行作業(yè),確定場(chǎng)橋在完成所有任務(wù)時(shí)作業(yè)的貝位號(hào)序列。另外,將本文采用的模型與混合整數(shù)規(guī)劃模型進(jìn)行了對(duì)比分析,也對(duì)比分析了本文算法與模擬退火算法、遺傳算法和隨機(jī)搜索式算法等算法的特點(diǎn),通過(guò)算例驗(yàn)證表明本文數(shù)學(xué)模型的合理性和算法的高效性,能夠有效的提高碼頭場(chǎng)橋的作業(yè)效率,減少作業(yè)時(shí)間,提高碼頭裝卸資源的工作效率。
[Abstract]:Container transportation, as an advanced form of transportation organization, is widely used at home and abroad. Container terminal is a key node of container transportation. The pressure on container terminal operation is increased. Resource allocation, information technology and management mode are all the important factors that affect the operation level of container terminal. Under the existing resource allocation of container terminal, how to improve the efficiency of resource operation. In this paper, the optimal scheduling of the container terminal inner yard bridge is studied in order to shorten the operation time by optimizing the moving path of the yard bridge. In this paper, the optimization problem of field bridge scheduling is studied by using the optimization theory and method of linear programming and dynamic programming in operation research, and the mathematical model of two-stage planning is established. In the first stage, a mixed integer programming model with linear constraints is established to determine the number of shells and the number of boxes to be fetched on the corresponding shell-level. In the second stage, the problem is solved in two cases: single-field bridge and multi-field bridge. With the aim of minimizing the total moving distance, the order of the operational shell number of the field bridge during the task is determined, and combined with the number of boxes obtained in the first stage, Finally, the number sequence of each field bridge and the number of boxes on the corresponding shell are obtained. In this paper, a linear programming and dynamic programming algorithm is designed. In the first stage, the research problem is linearized and continuous. The simplex method is used to obtain the set of the minimum number of shells and the number of boxes to be taken from the corresponding shells when all field bridges are required to complete the total task. In the second stage, dynamic programming method is used. Considering each subtask and the following five subtasks of the field bridge, select the shell number with the smallest moving distance for the field bridge to determine the sequence of the job's shell number when the field bridge completes all the tasks. In addition, The model used in this paper is compared with the mixed integer programming model, and the characteristics of the algorithm, such as simulated annealing algorithm, genetic algorithm and random search algorithm, are compared and analyzed. The results show that the rationality of the mathematical model and the efficiency of the algorithm can effectively improve the efficiency of the terminal yard bridge, reduce the operation time, and improve the efficiency of the handling resources of the wharf.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U691.3

【參考文獻(xiàn)】

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

1 魏眾;申金升;肖榮娜;張智文;石定寰;;港口集裝箱碼頭輪胎式龍門(mén)吊優(yōu)化調(diào)度研究[J];中國(guó)工程科學(xué);2007年08期

2 李斌;李文鋒;;面向哈佛體系結(jié)構(gòu)的集裝箱碼頭場(chǎng)橋作業(yè)調(diào)度[J];計(jì)算機(jī)工程與應(yīng)用;2011年22期

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

1 龐峰;模擬退火算法的原理及算法在優(yōu)化問(wèn)題上的應(yīng)用[D];吉林大學(xué);2006年

2 林藝明;集裝箱碼頭調(diào)度問(wèn)題研究[D];上海海事大學(xué);2007年

，

本文編號(hào)：1636249