本文選題：集裝箱碼頭 + 集卡預(yù)約��； 參考：《大連海事大學(xué)》2015年碩士論文

【摘要】：我國(guó)90%以上的集裝箱進(jìn)出港口是由集卡完成運(yùn)輸?shù)?受集卡到達(dá)時(shí)間的不確定性及隨機(jī)性影響,高峰時(shí)段碼頭擁堵嚴(yán)重,導(dǎo)致碼頭作業(yè)效率降低,并且加重了環(huán)境污染。集卡預(yù)約能有效緩解碼頭擁堵,降低外部集卡在碼頭的周轉(zhuǎn)時(shí)間,目前在國(guó)內(nèi)外港口已經(jīng)應(yīng)用。然而集卡預(yù)約是一個(gè)復(fù)雜的系統(tǒng),涉及碼頭作業(yè)環(huán)節(jié)較多,影響因素較復(fù)雜,不僅受到自身多排隊(duì)影響,還受碼頭內(nèi)部作業(yè)計(jì)劃的影響。因此,預(yù)約機(jī)制下,如何構(gòu)建碼頭集卡服務(wù)的排隊(duì)模型,實(shí)現(xiàn)各環(huán)節(jié)與集卡的協(xié)同調(diào)度是亟待解決的問題。本文以揭示預(yù)約機(jī)制下集卡到達(dá)與服務(wù)規(guī)律為目標(biāo),從三個(gè)方面構(gòu)建預(yù)約機(jī)制下碼頭集卡服務(wù)的排隊(duì)模型。首先,考慮集卡在閘口排隊(duì)過(guò)程與堆場(chǎng)排隊(duì)過(guò)程互相影響,構(gòu)建集卡基于排隊(duì)網(wǎng)絡(luò)的集卡預(yù)約優(yōu)化模型。該模型以減少集卡在碼頭周轉(zhuǎn)時(shí)間為目標(biāo),優(yōu)化集卡預(yù)約份額。為求解模型,設(shè)計(jì)基于遺傳算法及逐點(diǎn)固定流體近似算法的啟發(fā)式算法,并利用算例驗(yàn)證了該模型及算法的有效性。其次,預(yù)約機(jī)制下,考慮碼頭內(nèi)部作業(yè)計(jì)劃對(duì)集卡預(yù)約的影響,構(gòu)建基于內(nèi)外集卡協(xié)同服務(wù)的集卡預(yù)約優(yōu)化模型,利用休假式排隊(duì)方法描述龍門吊同時(shí)服務(wù)內(nèi)外集卡過(guò)程。在同時(shí)考慮閘口能力、內(nèi)部集卡在堆場(chǎng)的裝卸計(jì)劃及外部集卡在堆場(chǎng)的作業(yè)計(jì)劃的情況下,優(yōu)化碼頭外部集卡預(yù)約份額。為求解模型,設(shè)計(jì)基于遺傳算法的求解方法,并利用算例驗(yàn)證模型與算法的有效性。最后,結(jié)合碼頭內(nèi)部作業(yè)計(jì)劃,考慮碼頭堆場(chǎng)龍門吊在內(nèi)外集卡裝卸任務(wù)的分配情況,建立基于堆場(chǎng)作業(yè)資源分配的集卡預(yù)約優(yōu)化模型,利用帶休假策略的排隊(duì)論描述龍門吊服務(wù)內(nèi)外集卡時(shí)的分配情況�？紤]龍門吊調(diào)度、閘口能力、碼頭裝卸計(jì)劃,優(yōu)化碼頭外部集卡預(yù)約份額及龍門吊分配。為求解模型,設(shè)計(jì)基于啟發(fā)式算法的求解方法并驗(yàn)證模型與算法的有效性。研究結(jié)果表明,集卡預(yù)約能有效降低碼頭擁堵,提高碼頭作業(yè)效率。預(yù)約機(jī)制下,相關(guān)排隊(duì)理論能有效刻畫碼頭的排隊(duì)過(guò)程,本文建立的預(yù)約優(yōu)化模型可為碼頭管理集卡到達(dá)提供借鑒。
[Abstract]:More than 90% of the container ports in and out of our country are transported by the container card. Due to the uncertainty and randomness of the arrival time of the container, the jams of the terminals in the peak period are serious, which results in the reduction of the efficiency of the terminal operation and the aggravation of the environmental pollution. Card reservation can effectively alleviate the jams and reduce the turnaround time of the external card in the wharf, which has been applied in domestic and foreign ports. However, card reservation is a complex system, which involves many aspects of wharf operation, and the influencing factors are more complex. It is affected not only by its own multiple queues, but also by the internal operation plan of the wharf. Therefore, how to set up the queuing model of the card collection service in wharf under the reservation mechanism, and how to realize the cooperative scheduling between each link and the card is an urgent problem to be solved. This paper aims at revealing the rules of card arrival and service under the reservation mechanism, and constructs the queuing model of the card collection service in the terminal under the reservation mechanism from three aspects. Firstly, considering the interaction between card queuing process at gate and yard queuing process, a card reservation optimization model based on queuing network is constructed. The model aims at reducing the turnaround time of the card and optimizes the share of card reservation. In order to solve the model, a heuristic algorithm based on genetic algorithm and point-by-point fixed fluid approximation algorithm is designed, and the validity of the model and algorithm is verified by an example. Secondly under the reservation mechanism considering the influence of the internal operation plan of the terminal on the card reservation the optimization model of the card reservation based on the internal and external card collaborative service is constructed. The vacation queuing method is used to describe the internal and external card collection process of the gantry crane simultaneously. With the consideration of gate capacity, loading and unloading plan of internal card in yard and operation plan of external card in yard, the reservation share of external collecting card of wharf is optimized. In order to solve the model, a method based on genetic algorithm is designed, and the validity of the model and algorithm is verified by an example. Finally, considering the distribution of the loading and unloading tasks of the gantry crane in the dock yard, the optimization model of the card reservation based on the resource allocation of the yard operation is established according to the internal operation plan of the terminal. The queuing theory with vacation policy is used to describe the distribution of internal and external card collection in gantry crane service. Consider the scheduling of gantry crane, gate capacity, terminal loading and unloading plan, optimize the quota of external card booking and the allocation of gantry crane. In order to solve the model, a heuristic algorithm is designed and the validity of the model and algorithm is verified. The research results show that the card collection reservation can effectively reduce the jams and improve the efficiency of wharf operation. Under the reservation mechanism, the relevant queuing theory can effectively depict the queuing process of the wharf. The reservation optimization model established in this paper can provide a reference for the arrival of the terminal management card.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U691.3

【參考文獻(xiàn)】

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

1 羅太波;羅利;劉姿;;基于收益管理方法的醫(yī)院門診預(yù)約掛號(hào)優(yōu)化模型[J];系統(tǒng)工程;2011年09期

2 曾慶成;張笑菊;陳文浩;朱曉聰;;基于BCMP排隊(duì)網(wǎng)絡(luò)的碼頭集卡預(yù)約優(yōu)化模型[J];系統(tǒng)工程學(xué)報(bào);2013年05期

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

1 劉豐碩;基于裝卸協(xié)調(diào)作業(yè)的集裝箱碼頭集卡路徑優(yōu)化研究[D];大連海事大學(xué);2010年

，

本文編號(hào)：2070867