【摘要】：現(xiàn)代物流業(yè)已經(jīng)成為我國大力發(fā)展的重要產(chǎn)業(yè),集裝箱碼頭作為典型的物流企業(yè),船舶的大型化發(fā)展以及集裝箱吞吐量的不斷增長,對于空間資源和物流設備資源均有限的集裝箱碼頭提出了嚴峻的挑戰(zhàn),迫切需要對集裝箱碼頭空間和物流設備等資源進行科學高效的優(yōu)化調(diào)度,以提高其作業(yè)效率和精細化管理水平。供應鏈是十年來的熱點研究領(lǐng)域,以往對于供應鏈的研究大多集中于供應、生產(chǎn)與配送等環(huán)節(jié),對于集裝箱碼頭物流供應鏈調(diào)度的研究還比較少,而由于物流供應鏈內(nèi)部的緊密聯(lián)系,對各個環(huán)節(jié)進行獨立的調(diào)度常常會導致物流供應鏈整體作業(yè)效率低、運營成本高。本文針對集裝箱碼頭的一系列物流供應鏈調(diào)度問題分別進行了建模和優(yōu)化研究。通過對物流供應鏈科學有效的調(diào)度,提高集裝箱碼頭的物流作業(yè)效率、減少各物流設備之間的等待時間以及降低物流成本,進而提高集裝箱碼頭的服務水平和企業(yè)競爭力。吊機是集裝箱碼頭進行裝卸和存取作業(yè)的重要物流設備,是制約集裝箱碼頭運作效率的主要瓶頸,本文針對集裝箱碼頭與吊機(岸吊和場吊)相關(guān)的供應鏈調(diào)度問題進行研究,主要包括以下幾個問題：1)泊位和岸吊供應鏈調(diào)度問題；2)單向流的岸吊和集卡供應鏈調(diào)度問題；3)雙向流的岸吊和集卡供應鏈調(diào)度問題；4)倒垛和場吊的供應鏈調(diào)度問題。針對上述問題,分別建立了數(shù)學模型,并設計了算法進行求解。主要研究內(nèi)容概述如下：1)針對集裝箱碼頭泊位和岸吊的供應鏈調(diào)度問題進行研究。該問題是指在各泊位的長度、各泊位的可利用岸吊數(shù)目以及船舶到港時間等條件已知的情況下,為每條到港船舶分配停泊時間、停泊位置以及服務的岸吊。與以往泊位線呈一條直線的泊位和岸吊分配問題不同,在該問題中,泊位線呈“F”型或者“L”型等包含多條直線的形狀。因此,某些相鄰的泊位不能被同一條船占用,岸吊也不能在這些泊位之間移動。針對該問題,建立了混合整數(shù)規(guī)劃模型,并提出了拉格朗日松弛算法進行求解,通過分析最優(yōu)解的性質(zhì)以及采用加速策略,降低了算法的求解時間。實驗結(jié)果表明提出的拉格朗日松弛算法在求解小規(guī)模和大規(guī)模算例時的解與下界的平均對偶偏差分別為1.74%和1.799%。2)針對只含有進港集裝箱的岸吊和集卡供應鏈調(diào)度問題進行研究。該問題是指在已知每個集裝箱的卸載時間和運輸時間等情況下,決策岸吊和集卡的分配以及每臺岸吊和每輛集卡操作這些集裝箱的順序。由于只有進港集裝箱,只存在從碼頭前沿到堆場的集卡運輸路徑,即單向流問題�？紤]岸吊之間不允許發(fā)生碰撞、卸載集裝箱的優(yōu)先關(guān)系等約束條件,以最小化所有集裝箱的完成時間為目標建立混合整數(shù)線性規(guī)劃模型,提出了該問題的最優(yōu)解性質(zhì)、有效不等式和下界,并設計了基于新的速度更新公式的粒子群算法進行求解。針對該問題進行擴展研究,建立岸吊、集卡和場吊的三階段供應鏈調(diào)度問題的模型,并設計了求解算法。通過計算實驗表明在岸吊、集卡以及場吊中的一種設備數(shù)目不變,其它兩種設備數(shù)目不同的情況下,粒子群算法的結(jié)果與最優(yōu)解的偏差分別為：1.676%,2.033%和0.338%。3)針對同時考慮進港和出港集裝箱的岸吊和集卡供應鏈調(diào)度問題進行研究。在對到港船舶進行裝卸作業(yè)時,往往既有需要從船上卸載下來的進港集裝箱,又有需要裝載到船上的出港集裝箱。在該情況下,集卡運輸進港集裝箱到達堆場后,可以空載返回碼頭前沿,也可以從堆場運輸出港集裝箱返回碼頭前沿,包含兩個方向的集卡運輸路徑,即雙向流問題。針對該問題,建立了線性整數(shù)規(guī)劃模型,并構(gòu)造了下界,提出了帶有速度更新公式選擇策略和最差粒子替換策略的粒子群算法求解該問題,計算結(jié)果表明所提出的粒子群算法與最優(yōu)解和下界的平均偏差分別為1.26%和2.48%。4)針對集裝箱碼頭倒垛和場吊的供應鏈調(diào)度問題進行研究。該問題是指在給定一個貝位結(jié)構(gòu)以及外部集卡提取該貝位內(nèi)每一個集裝箱的時間等情況下,同時決策場吊提取該貝位內(nèi)所有集裝箱的順序以及需要倒垛的集裝箱的目標位置。針對倒垛和場吊供應鏈調(diào)度問題,用線性表達恰當?shù)乜坍嬃颂嵯漤樞蚺c倒垛次數(shù)的復雜關(guān)系,建立了線性整數(shù)規(guī)劃模型,設計了基于部分粒子重新初始化策略的粒子群算法進行求解。實驗結(jié)果表明將倒垛和場吊進行供應鏈調(diào)度的結(jié)果與兩者分別進行調(diào)度的結(jié)果的平均偏差為1.84%。
[Abstract]:The modern logistics industry has become an important industry in the development of our country, and the container terminal is a typical logistics enterprise, the large-scale development of the ship and the continuous increase of the container throughput. There is an urgent need to scientifically and efficiently optimize the container terminal space and logistics equipment, so as to improve its operation efficiency and fine management level. The supply chain is a hot spot research field in the past ten years. In the past, the research on the supply chain is mainly focused on the supply, production and distribution. The research on the supply chain scheduling of the container terminal is less, and due to the close contact inside the logistics supply chain, Independent scheduling of each link often results in lower overall operation efficiency and high operating cost of the logistics supply chain. In this paper, the modeling and optimization of a series of logistics supply chain scheduling problems for container terminal are studied. Through the scientific and effective scheduling of the logistics supply chain, the logistics operation efficiency of the container terminal can be improved, the waiting time between the logistics equipment and the logistics cost can be reduced, and the service level and the enterprise competitiveness of the container terminal can be further improved. The crane is an important logistics equipment for loading and unloading and accessing the container terminal, which is the main bottleneck that restricts the operation efficiency of the container terminal. This paper studies the supply chain scheduling problem associated with the crane (bank and field crane) of the container terminal, which mainly includes the following problems: 1) the scheduling problem of the supply chain of the berth and the bank; 2) the problem of the supply chain of the bank of the one-way flow and the supply chain of the current collector; 3) the problem of the supply chain of the bank and the current collector of the two-way flow; and 4) the problem of supply chain scheduling of the stack and the field crane. In view of the above problems, a mathematical model is set up, and the algorithm is designed to solve the problem. The main research contents are as follows: 1) The supply chain scheduling problem for the container terminal berth and the shore crane is studied. The problem is to assign the berth time, the mooring position and the shore crane for each port to the port where the length of each berth, the number of available shore cranes for each berth, and the time of the arrival of the ship are known. The berth line is in the form of a 鈥淔鈥，

本文編號：2368726