天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當(dāng)前位置:主頁 > 科技論文 > 路橋論文 >

基于虛擬鏈路的集裝箱堆場翻箱落位優(yōu)選模型與算法研究

發(fā)布時(shí)間:2018-06-03 15:12

  本文選題:集裝箱碼頭 + 翻箱落位優(yōu)選; 參考:《大連理工大學(xué)》2015年碩士論文


【摘要】:影響集裝箱碼頭運(yùn)作效率和成本的兩個(gè)關(guān)鍵因素是先進(jìn)的集裝箱碼頭作業(yè)工藝系統(tǒng)和合理的碼頭運(yùn)作優(yōu)化管理模式。持續(xù)增加的集裝箱吞吐量需求對碼頭的裝卸和堆存能力要求越來越高。采用先進(jìn)的碼頭裝卸設(shè)備和作業(yè)工藝與合理的碼頭運(yùn)作優(yōu)化管理模式有助于提高碼頭吞吐能力和運(yùn)作效率,節(jié)約運(yùn)作成本。本文針對集裝箱碼頭運(yùn)作工藝系統(tǒng)與堆場運(yùn)作優(yōu)化問題進(jìn)行研究,對比分析了集裝箱碼頭先進(jìn)運(yùn)作工藝,提出了基于虛擬鏈路的集裝箱碼頭翻箱落位優(yōu)化模型,并在此基礎(chǔ)上開發(fā)了一種迭代搜索算法。具體內(nèi)容如下:集裝箱碼頭先進(jìn)作業(yè)工藝分析與對比研究。首先針對自動(dòng)化集裝箱碼頭,分析了基于AGV/ALV的碼頭作業(yè)系統(tǒng)和立體軌道式碼頭作業(yè)系統(tǒng)以及它們的平面布局,并利用模擬仿真分析了其作業(yè)效率和設(shè)備利用率等性能參數(shù);分析了高架橋式碼頭裝卸工藝概念系統(tǒng);并從作業(yè)效率和成本等方面對幾種自動(dòng)化碼頭工藝進(jìn)行了對比分析。研究成果可為集裝箱碼頭作業(yè)工藝設(shè)計(jì)和優(yōu)選提供參考;谔摂M鏈路的集裝箱碼頭翻箱落位優(yōu)化模型構(gòu)建。首先分析了集裝箱碼頭堆場翻箱成因與翻箱落位優(yōu)化的關(guān)鍵因素,包括移箱翻箱、提箱翻箱和裝船翻箱三個(gè)方面;然后在對集裝箱碼頭翻箱落位路徑分析的基礎(chǔ)上,提出了虛擬鏈路的翻箱落位路徑表示方法;最后,將翻箱路徑優(yōu)選問題分解為兩個(gè)子問題,分別針對兩個(gè)子問題構(gòu)建了以龍門吊翻箱量最小和龍門吊作業(yè)時(shí)間最小的翻箱路徑優(yōu)選模型。翻箱路徑優(yōu)選的迭代搜索算法研究?紤]基于虛擬鏈路的集裝箱碼頭翻箱落位優(yōu)化分解模型特點(diǎn),設(shè)計(jì)了三階段迭代搜索求解算法:第一階段是產(chǎn)生初始可行移箱序列;第二階段在初始序列的基礎(chǔ)上加入虛擬移箱路徑組成一個(gè)松弛沖突的虛擬鏈路,利用迭代搜索算法優(yōu)化總移箱量;第三階段加入了移箱運(yùn)行時(shí)間變量,利用迭代搜索算法優(yōu)化龍門吊的總工作時(shí)間。實(shí)驗(yàn)表明,在求解一般規(guī)模問題時(shí),本文算法性能較文獻(xiàn)[8]的啟發(fā)式算法、較文獻(xiàn)[9]的OH算法和文獻(xiàn)[10]的IH算法性能都有不同程度的改進(jìn),當(dāng)貝規(guī)模為7×5時(shí),較啟發(fā)式算法改進(jìn)11.6%,較X2算法改進(jìn)46.4%,較X3算法改進(jìn)21.2%,并且能夠滿足實(shí)時(shí)性要求,所以能夠提高集裝箱碼頭翻箱落位的優(yōu)化效果,但本文算法在不適合求解貝規(guī)模過小(4×3)或過大(13×6)時(shí)的情形。另外,在本文模型基礎(chǔ)上開發(fā)的迭代搜索算法在求解較大規(guī)模的問題時(shí),雖然迭代次數(shù)較大,但每次迭代的搜索空間小,并且能夠在適合范圍內(nèi)得到滿意解,可以滿足實(shí)際規(guī)模的求解需求。
[Abstract]:The two key factors affecting the efficiency and cost of container terminal operation are advanced container terminal operation process system and reasonable terminal operation optimization management model. The increasing demand for container throughput requires more and more terminal handling and storage capacity. The adoption of advanced terminal handling equipment and operation technology and reasonable wharf operation optimization management mode will help to improve the terminal handling capacity and operation efficiency and save the operation cost. In this paper, the optimization of container terminal operation process system and yard operation is studied, the advanced operation technology of container terminal is compared and analyzed, and the optimization model of container terminal turnover and drop position based on virtual link is put forward. The specific contents are as follows: container terminal advanced operation process analysis and comparative study. Firstly, aiming at the automatic container terminal, the terminal operation system based on AGV/ALV and the three-dimensional track wharf operation system and their plane layout are analyzed, and the performance parameters such as operational efficiency and equipment utilization ratio are analyzed by simulation. The conceptual system of loading and unloading technology for viaduct wharf is analyzed, and several kinds of automatic wharf processes are compared and analyzed from the aspects of operation efficiency and cost. The research results can provide reference for container terminal operation process design and optimization. The optimization model of container terminal turnover and drop based on virtual link is constructed. This paper first analyzes the causes of container turnover in container terminal yard and the key factors in the optimization of container drop position, including three aspects: shifting box, turning case and loading container, and then on the basis of analyzing the path of turning over and falling of container terminal, In this paper, we propose a method to represent the drop path of the virtual link, and finally, we decompose the optimal path selection problem into two sub-problems. Aiming at the two sub-problems, the optimal selection model of the turning over path of the gantry crane is constructed, which is based on the minimum volume of the gantry crane and the minimum working time of the gantry crane. Research on iterative search algorithm for optimal selection of turning-over path. Considering the characteristics of the virtual link based optimal decomposition model of the container terminal tilting position, a three-stage iterative search algorithm is designed: the first stage is to produce the initial feasible moving box sequence; In the second stage, the virtual box moving path is added to the initial sequence to form a relaxed collision virtual link, and the iterative search algorithm is used to optimize the total number of moving boxes. In the third stage, the moving box running time variable is added. The total working time of gantry crane is optimized by iterative search algorithm. Experiments show that the performance of this algorithm is better than that of the heuristic algorithm in reference [8], the performance of OH algorithm in reference [9] and IH algorithm in reference [10], when the scale of shell is 7 脳 5, the experimental results show that the performance of this algorithm is better than that of the heuristic algorithm in reference [8]. Compared with heuristic algorithm, X2 algorithm, X3 algorithm and X3 algorithm, it can improve 11.6, 46.4and 21.2, and can meet the real-time requirements, so it can improve the optimization effect of the container terminal. However, the algorithm is not suitable for solving the problem of too small shellfish size (4 脳 3) or too large a size of 13 脳 6). In addition, the iterative search algorithm developed on the basis of this model has a large number of iterations, but the search space of each iteration is small, and the satisfactory solution can be obtained within a suitable range. It can meet the demand of actual scale.
【學(xué)位授予單位】:大連理工大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2015
【分類號】:U695.22;U691.3

【參考文獻(xiàn)】

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

1 陳慶偉;王繼榮;;集裝箱堆場出口箱堆存模型及其算法[J];物流科技;2007年07期

,

本文編號:1973228

資料下載
論文發(fā)表

本文鏈接:http://www.sikaile.net/kejilunwen/daoluqiaoliang/1973228.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶5e685***提供,本站僅收錄摘要或目錄,作者需要?jiǎng)h除請E-mail郵箱bigeng88@qq.com