集裝箱碼頭堆場(chǎng)出口箱翻箱作業(yè)調(diào)度優(yōu)化
發(fā)布時(shí)間：2018-11-27 08:35
【摘要】：隨著集裝箱碼頭吞吐量的迅速增長,碼頭堆場(chǎng)資源的稀缺屬性愈加顯著,如何提高堆場(chǎng)的作業(yè)效率,加快集裝箱在場(chǎng)內(nèi)的流轉(zhuǎn),最大限度地利用堆場(chǎng)現(xiàn)有的空間資源與設(shè)備資源,成為碼頭管理者迫切解決的問題。針對(duì)影響堆場(chǎng)作業(yè)效率的翻箱問題,本文系統(tǒng)地歸納和評(píng)述了大量的國內(nèi)外相關(guān)文獻(xiàn),發(fā)現(xiàn)目前對(duì)此問題的研究仍舊不夠全面,考慮動(dòng)態(tài)性的研究還比較匱乏。圍繞上述問題,本文主要做了以下工作：(1)考慮了出口集裝箱進(jìn)場(chǎng)的不確定因素,以后續(xù)可能產(chǎn)生的翻箱量最少為目標(biāo),建立了整數(shù)規(guī)劃模型,研究了在既定堆存狀態(tài)下的集裝箱靜態(tài)提取問題,并在此基礎(chǔ)上解決動(dòng)態(tài)問題。運(yùn)用求解軟件與啟發(fā)式算法進(jìn)行求解,結(jié)合了精確算法與啟發(fā)式規(guī)則的優(yōu)點(diǎn),達(dá)到改進(jìn)現(xiàn)有優(yōu)化算法、更好地指導(dǎo)實(shí)際操作的目的。(2)基于堆場(chǎng)實(shí)際情況與現(xiàn)實(shí)約束,構(gòu)建了以翻箱量最少為目標(biāo)的出口箱裝船順序優(yōu)化模型,開發(fā)了基于動(dòng)態(tài)規(guī)劃的兩階段混合優(yōu)化算法,為避免狀態(tài)數(shù)“組合爆炸”式的增長,進(jìn)一步將啟發(fā)式規(guī)則嵌入到動(dòng)態(tài)規(guī)劃算法中。數(shù)值實(shí)驗(yàn)驗(yàn)證了所提出算法較之實(shí)際調(diào)度規(guī)則與現(xiàn)有研究的優(yōu)越性。(3)構(gòu)建了兩階段混合優(yōu)化算法對(duì)預(yù)倒箱問題進(jìn)行求解,第一階段,運(yùn)用基于閾值接受算法的鄰域搜索算法,求得末終堆存狀態(tài)壓箱數(shù)較少的預(yù)倒箱序列；第二階段,運(yùn)用整數(shù)規(guī)劃模型求解預(yù)倒箱序列鄰域中的最優(yōu)解。兩個(gè)階段循環(huán)交替進(jìn)行,以快速求得最優(yōu)的預(yù)倒箱序列。實(shí)驗(yàn)結(jié)果表明了算法的可行性。(4)研究了如何以最少的集裝箱搬移次數(shù)及最短的龍門吊工作時(shí)間,處理單臺(tái)單吊、單臺(tái)多吊及兩臺(tái)單吊取箱問題,并針對(duì)此三種問題分別提出了啟發(fā)式算法進(jìn)行求解,實(shí)驗(yàn)結(jié)果表明較于現(xiàn)有研究,提出的算法有效性及優(yōu)化程度更高。
[Abstract]:With the rapid growth of container terminal throughput, the scarcity of terminal yard resources becomes more and more significant. How to improve the efficiency of yard operation and speed up the circulation of containers in the yard, It is an urgent problem for wharf managers to make full use of the existing space and equipment resources in the yard. In this paper, a large number of related literatures at home and abroad are systematically summarized and reviewed, and it is found that the current research on this problem is still not comprehensive enough, and the study of considering dynamics is still relatively scarce. The main work of this paper is as follows: (1) considering the uncertain factors of the entry of export containers, the integer programming model is established. In this paper, the static extraction problem of container in a certain storage state is studied, and the dynamic problem is solved on the basis of it. Using solving software and heuristic algorithm, combining the advantages of exact algorithm and heuristic rule, the purpose of improving the existing optimization algorithm and guiding the practical operation better is achieved. (2) based on the actual situation and practical constraints of the yard, In order to avoid the "combined explosion" growth of state number, the optimal model of loading sequence of export container is constructed, and the two-stage hybrid optimization algorithm based on dynamic programming is developed. Furthermore, the heuristic rules are embedded into the dynamic programming algorithm. Numerical experiments verify the superiority of the proposed algorithm over the actual scheduling rules and existing research. (3) A two-stage hybrid optimization algorithm is constructed to solve the pre-empting box problem. The neighborhood search algorithm based on threshold acceptance algorithm is used to obtain the preemptive box sequence with fewer pressure-box numbers in the terminal storage state. In the second stage, the integer programming model is used to solve the optimal solution in the preemptive box sequence neighborhood. The two stages are alternately carried out in order to obtain the optimal preemptive box sequence quickly. The experimental results show that the algorithm is feasible. (4) how to deal with the problems of single crane, single crane and two single hoists with the least number of times of moving containers and the shortest working time of gantry crane is studied. The heuristic algorithm is proposed to solve these three problems respectively. The experimental results show that the proposed algorithm is more effective and optimized than the existing research.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類號(hào)】：U691.3
本文編號(hào)：2360065
[Abstract]:With the rapid growth of container terminal throughput, the scarcity of terminal yard resources becomes more and more significant. How to improve the efficiency of yard operation and speed up the circulation of containers in the yard, It is an urgent problem for wharf managers to make full use of the existing space and equipment resources in the yard. In this paper, a large number of related literatures at home and abroad are systematically summarized and reviewed, and it is found that the current research on this problem is still not comprehensive enough, and the study of considering dynamics is still relatively scarce. The main work of this paper is as follows: (1) considering the uncertain factors of the entry of export containers, the integer programming model is established. In this paper, the static extraction problem of container in a certain storage state is studied, and the dynamic problem is solved on the basis of it. Using solving software and heuristic algorithm, combining the advantages of exact algorithm and heuristic rule, the purpose of improving the existing optimization algorithm and guiding the practical operation better is achieved. (2) based on the actual situation and practical constraints of the yard, In order to avoid the "combined explosion" growth of state number, the optimal model of loading sequence of export container is constructed, and the two-stage hybrid optimization algorithm based on dynamic programming is developed. Furthermore, the heuristic rules are embedded into the dynamic programming algorithm. Numerical experiments verify the superiority of the proposed algorithm over the actual scheduling rules and existing research. (3) A two-stage hybrid optimization algorithm is constructed to solve the pre-empting box problem. The neighborhood search algorithm based on threshold acceptance algorithm is used to obtain the preemptive box sequence with fewer pressure-box numbers in the terminal storage state. In the second stage, the integer programming model is used to solve the optimal solution in the preemptive box sequence neighborhood. The two stages are alternately carried out in order to obtain the optimal preemptive box sequence quickly. The experimental results show that the algorithm is feasible. (4) how to deal with the problems of single crane, single crane and two single hoists with the least number of times of moving containers and the shortest working time of gantry crane is studied. The heuristic algorithm is proposed to solve these three problems respectively. The experimental results show that the proposed algorithm is more effective and optimized than the existing research.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類號(hào)】：U691.3
【引證文獻(xiàn)】
相關(guān)會(huì)議論文 前1條
1 馮美玲;岳文英;孫俊清;;進(jìn)出口集裝箱在堆場(chǎng)中堆存空間分配問題的研究[A];中國自動(dòng)化學(xué)會(huì)控制理論專業(yè)委員會(huì)D卷[C];2011年
，本文編號(hào)：2360065
本文鏈接：http://www.wukwdryxk.cn/kejilunwen/daoluqiaoliang/2360065.html
最近更新
教材專著
