本文選題：集卡調(diào)度 + 堆場(chǎng)存儲(chǔ)安排�。� 參考：《深圳大學(xué)》2017年碩士論文

【摘要】：集裝箱運(yùn)輸開啟了現(xiàn)代物流發(fā)展的新篇章,是現(xiàn)代物流發(fā)展的一個(gè)重要標(biāo)志。然而,逐年增長的集裝箱吞吐量以及船舶大型化的發(fā)展趨勢(shì)也對(duì)我國各集裝箱碼頭提出了新的要求,同時(shí),進(jìn)一步加劇了各個(gè)集裝箱碼頭之間的競爭。集裝箱碼頭只有致力于提高自身的服務(wù)水平、運(yùn)營效率,才能在新一輪的競爭中不被淘汰。在集裝箱碼頭作業(yè)過程中,集卡作為一種重要的基礎(chǔ)工具,具有使用量大、靈活、成本相對(duì)較低等特點(diǎn),在港岸和堆場(chǎng)之間起著運(yùn)輸集裝箱的重要作用。同時(shí),作為集裝箱的存儲(chǔ)、轉(zhuǎn)運(yùn)基地,堆場(chǎng)對(duì)集卡調(diào)度方案的設(shè)計(jì)有著重要的影響。本文對(duì)集卡的調(diào)度問題進(jìn)行了研究,旨在縮短集裝箱的裝卸時(shí)間,提高港口集裝箱的周轉(zhuǎn)效率,從而實(shí)現(xiàn)港口資源的優(yōu)化配置,增強(qiáng)港口的競爭力�；诖�,本文在國家自然科學(xué)基金(71571120,71271140,71471158)及廣東省自然科學(xué)基金(2016A030310074)的資助下開展了如下研究:首先,本文綜合考慮了堆場(chǎng)存儲(chǔ)空間動(dòng)態(tài)變化的特點(diǎn),包括堆場(chǎng)存儲(chǔ)位置數(shù)量的變化以及存儲(chǔ)位置的變化,提出了“先進(jìn)后出”、“先出后進(jìn)”的集裝箱運(yùn)輸策略,并探討了不同策略的使用條件,建立了基于堆場(chǎng)可用存儲(chǔ)位置動(dòng)態(tài)變化的集卡調(diào)度模型。其次,對(duì)集卡調(diào)度問題進(jìn)行了進(jìn)一步拓展,研究了采用協(xié)同調(diào)度策略時(shí)集裝箱碼頭的集卡調(diào)度問題,基于“重進(jìn)重出”的思想,提出了進(jìn)出口運(yùn)輸聯(lián)合的集卡調(diào)度方案,建立了基于協(xié)同調(diào)度策略的集卡調(diào)度模型。協(xié)同調(diào)度策略不是把集卡看成獨(dú)立的個(gè)體,而是看成可以互相協(xié)助的一個(gè)群集。該策略主要利用了集卡相互協(xié)作作業(yè)的優(yōu)勢(shì),有效的減少了集卡調(diào)度過程中的空載率,從而提高了集卡調(diào)度的效率。最后,鑒于所建立的集卡調(diào)度模型在求解上屬于NP-hard問題,本文采用了粒子群優(yōu)化算法及其改進(jìn)算法對(duì)此問題進(jìn)行優(yōu)化求解。通過建立映射關(guān)系,保證了粒子群優(yōu)化算法對(duì)此問題的適用性。通過算例分析了模型和算法的性能,并和CPLEX仿真優(yōu)化結(jié)果進(jìn)行了對(duì)比分析,結(jié)果顯示本文所提出的模型對(duì)解決集裝箱碼頭集卡調(diào)度問題具有一定的指導(dǎo)意義。
[Abstract]:Container transportation opens a new chapter of modern logistics development and is an important symbol of modern logistics development. However, the annual increase of container throughput and the trend of large-scale development of ships also put forward new requirements for each container terminal in China, at the same time, it further intensifies the competition among various container terminals. Container terminal can not be eliminated in the new round of competition only by devoting itself to improving its service level and operating efficiency. In the process of container terminal operation, as an important basic tool, the card has the characteristics of large usage, flexibility and relatively low cost, which plays an important role in the transportation of containers between port and yard. At the same time, as container storage, transfer base, yard has an important impact on the design of card scheduling scheme. In this paper, the scheduling problem of the card is studied in order to shorten the loading and unloading time of the container, improve the turnover efficiency of the port container, realize the optimal allocation of the port resources and enhance the competitiveness of the port. Based on this, this paper has carried out the following research with the support of the National Natural Science Foundation of China (71571120 / 71271140 / 71471158) and the Natural Science Foundation of Guangdong Province (2016A030310074). Including the quantity change of storage location and the change of storage location, the container transportation strategy of "first-out" and "first-out" is put forward, and the use conditions of different strategies are discussed. A card scheduling model based on the dynamic change of the available storage location in the yard is established. Secondly, the card gathering scheduling problem is further expanded, and the card gathering scheduling problem of container terminal is studied when the cooperative scheduling strategy is adopted. Based on the idea of "re-entry and re-output", the paper puts forward a combined card-gathering scheduling scheme for import and export transportation. A card scheduling model based on cooperative scheduling strategy is established. The cooperative scheduling strategy does not treat the card as an individual, but as a cluster that can assist each other. The strategy makes use of the advantages of the cooperation between the cards and effectively reduces the no-load rate in the process of card scheduling so as to improve the efficiency of card scheduling. Finally, in view of the NP-hard problem of the set card scheduling model, the particle swarm optimization algorithm and its improved algorithm are used to solve the problem. By establishing mapping relation, the applicability of particle swarm optimization algorithm to this problem is ensured. The performance of the model and algorithm is analyzed by an example, and compared with the results of CPLEX simulation. The results show that the proposed model has a certain guiding significance to solve the container terminal card collection scheduling problem.
【學(xué)位授予單位】：深圳大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：U691.3

【參考文獻(xiàn)】

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

1 嚴(yán)南南;楊瑩;;集裝箱碼頭考慮集卡能耗的岸橋集卡協(xié)調(diào)調(diào)度[J];廣西大學(xué)學(xué)報(bào)(自然科學(xué)版);2016年06期

2 劉嬋;;論重裝基地碼頭建設(shè)中水工建筑成本優(yōu)化方案選擇[J];中國水運(yùn)(下半月);2016年06期

3 梁承姬;沈佳杰;;考慮裝卸順序的岸橋與集卡協(xié)調(diào)調(diào)度問題研究[J];計(jì)算機(jī)應(yīng)用研究;2016年12期

4 甄紀(jì)軍;王秀臣;許濤;;內(nèi)貿(mào)集裝箱碼頭集卡智能調(diào)度實(shí)現(xiàn)方案[J];集裝箱化;2016年03期

5 樊陸彬;梁承姬;佘文婧;;不確定環(huán)境下的岸橋-集卡協(xié)調(diào)調(diào)度耦合模型建立與求解[J];計(jì)算機(jī)應(yīng)用;2016年03期

6 陳鐘運(yùn);郭培昌;;集裝箱碼頭裝卸作業(yè)質(zhì)量評(píng)價(jià)體系構(gòu)建[J];集裝箱化;2016年02期

7 徐遠(yuǎn)琴;韓曉龍;;集卡與岸橋及場(chǎng)橋聯(lián)合調(diào)度模型優(yōu)化[J];重慶交通大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年02期

8 康志敏;吳洪明;;港口集裝箱碼頭集卡優(yōu)化調(diào)度研究[J];物流工程與管理;2011年02期

9 計(jì)明軍;劉豐碩;李郭記;靳志宏;;基于裝卸協(xié)同作業(yè)的集裝箱碼頭集卡調(diào)度及配置優(yōu)化[J];大連海事大學(xué)學(xué)報(bào);2010年01期

10 曹瑾鑫;史其信;Der-Horng Lee;;A Decision Support Method for Truck Scheduling and Storage Allocation Problem at Container[J];Tsinghua Science and Technology;2008年S1期

，

本文編號(hào)：2060904