【摘要】：為了有效降低成本,滿足日益復(fù)雜的運(yùn)輸需求,班輪公司開(kāi)始通過(guò)樞紐港進(jìn)行貨物中轉(zhuǎn),建立軸輻式航線網(wǎng)絡(luò)。軸輻式這一網(wǎng)絡(luò)形式已成為班輪航線的主要形態(tài)。集裝箱班輪運(yùn)輸網(wǎng)絡(luò)設(shè)計(jì)是重要的物流問(wèn)題,牽扯大量的資產(chǎn)和運(yùn)營(yíng)成本,作為班輪公司經(jīng)營(yíng)戰(zhàn)略層面的關(guān)鍵問(wèn)題,軸輻式網(wǎng)絡(luò)優(yōu)化設(shè)計(jì)可以有效降低運(yùn)營(yíng)成本,提高班輪公司的市場(chǎng)競(jìng)爭(zhēng)力。而支線作為軸輻式網(wǎng)絡(luò)的重要組成部分,是干線的支撐和補(bǔ)充,對(duì)支線網(wǎng)絡(luò)進(jìn)行優(yōu)化是干線能夠順暢運(yùn)轉(zhuǎn)的關(guān)鍵。所以本文研究支線網(wǎng)絡(luò)優(yōu)化問(wèn)題,并在該問(wèn)題中考慮時(shí)間窗約束以及需求不確定性。集裝箱班輪支線網(wǎng)絡(luò)優(yōu)化問(wèn)題是帶時(shí)間窗的車輛路徑問(wèn)題在海運(yùn)領(lǐng)域的應(yīng)用,船舶從樞紐港出發(fā)掛靠客戶所在的支線港,服務(wù)完成后返回樞紐港,其中要求每個(gè)客戶都能夠得到服務(wù),但只能由一艘船提供一次服務(wù),且該服務(wù)應(yīng)盡量在指定的服務(wù)時(shí)間窗內(nèi)進(jìn)行,該問(wèn)題的優(yōu)化目標(biāo)是確定合適的路徑,使得在滿足約束條件的情況下完成全部服務(wù)的成本最小。本文圍繞集裝箱班輪運(yùn)輸中由樞紐港向各支線港進(jìn)行疏港運(yùn)輸?shù)闹Ь�網(wǎng)絡(luò)優(yōu)化問(wèn)題。要求船舶到港時(shí)間滿足時(shí)間約束,在樞紐港船舶載重量限制和各支線港時(shí)間窗限制基礎(chǔ)上分析軸輻式支線網(wǎng)絡(luò)優(yōu)化問(wèn)題。首先以總成本最小為目標(biāo)函數(shù)建立了確定性帶時(shí)間窗的班輪支線網(wǎng)絡(luò)優(yōu)化模型；由于支線港多為區(qū)域性小港口,所以在實(shí)踐中支線港的貨運(yùn)需求通常是無(wú)法事先確定的,運(yùn)輸需求的不確定性會(huì)影響確定條件下的解的可行性,所以本文又提出集裝箱班輪支線網(wǎng)絡(luò)魯棒優(yōu)化模型對(duì)不確定條件下船舶的運(yùn)輸航線進(jìn)行優(yōu)化選擇,其中需求不確定性通過(guò)情景集進(jìn)行描述,最終驗(yàn)證得到魯棒優(yōu)化方法能很好地處理運(yùn)輸需求的不確定性。
[Abstract]:In order to reduce the cost effectively and meet the increasingly complex transportation demand, the liner company began to carry on the freight transit through the hub port and set up the axle-spoke route network. This network form has become the main form of liner routes. Container liner transportation network design is an important logistics problem, which involves a large number of assets and operating costs. As a key issue of the liner company's management strategy, the axle-spoke network optimization design can effectively reduce the operating costs. Improve the market competitiveness of liner companies. As an important part of the axis-spoke network, the branch line is the support and supplement of the trunk line, and the optimization of the branch line network is the key to the smooth operation of the trunk line. In this paper, the optimization problem of branch network is studied, and time window constraints and demand uncertainties are considered in this problem. The optimization problem of container liner feeder network is the application of vehicle routing problem with time window in the field of marine transportation. The ship starts from the hub port and links to the branch port where the customer is located, and returns to the hub port after the service is completed. It requires that each customer be served, but only once by one ship, and that the service should be carried out as far as possible within the specified service time window. The optimization objective of the problem is to determine the appropriate path. It minimizes the cost of completing the entire service under the condition of satisfying the constraints. This paper focuses on the optimization of the branch network of container liner transportation from hub port to branch port. The ship arrival time is required to meet the time constraint. The optimization problem of axis-radial branch network is analyzed on the basis of the ship load limit and the time window limitation of each branch port. Firstly, a deterministic optimization model of liner feeder network with time window is established by taking the minimum total cost as the objective function. Because regional ports are mostly small regional ports, the freight demand of branch ports is usually not determined in advance in practice, and the uncertainty of transport demand will affect the feasibility of the solution under certain conditions. In this paper, the robust optimization model of container liner feeder network is proposed to optimize the shipping route under uncertain conditions, in which the uncertainty of demand is described by scenario set. Finally, it is proved that the robust optimization method can deal with the uncertainty of transportation demand well.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U692.3

【參考文獻(xiàn)】

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

1 柏明國(guó);姜濤;朱金福;;基于禁忌算法的中樞輻射航線網(wǎng)絡(luò)魯棒優(yōu)化方法[J];數(shù)學(xué)的實(shí)踐與認(rèn)識(shí);2008年13期

，

本文編號(hào)：2352984