本文選題：多式聯(lián)運 + 多式聯(lián)運經營人��； 參考：《西南交通大學》2017年碩士論文

【摘要】：集裝箱多式聯(lián)運是現(xiàn)代貨物運輸形式的革新,也是目前集裝箱運輸中相對高級的組織形式。它不但在貨物運輸中的扮演越來越重要的角色,其本身發(fā)展也越發(fā)多元化。隨著全球國際貿易的快速發(fā)展,集裝箱運輸的市場份額業(yè)務也在迅速增加,對集裝箱多式聯(lián)運的效率和服務質量的要求也在不斷提高。但是多式聯(lián)運網絡復雜,中間環(huán)節(jié)繁多,通常涉及兩種甚至兩種以上運輸方式和多承運人的參與。由于多式聯(lián)運鏈較長,其可靠性相對降低。通常遇到路徑中斷時,承運人會將這批貨物滯留在某處,等待原方案剩余路徑恢復后再進行運輸工作,這樣不可避免的會造成滯期,在面對如應急救援物資等時效性要求較高的貨物,不但會延誤交貨日期,還會讓經營人、承運人還有托運人遭受極大的經濟損失,這種情況是應極力避免的。本文就是針對路徑中斷的緊急情況(完全失去路段通行能力而非受阻),從宏觀的、多式聯(lián)運經營人的角度,在運輸遭遇前方路徑中斷的情況下,為了滿足運到時限而對運輸計劃進行調整,選擇繞過中斷路段的同時,盡可能少的選用計劃外港站節(jié)點、盡可能多的沿用原計劃中轉節(jié)點。通過對集裝箱多式聯(lián)運定義、組織形式、成本構成及經營人的責任范圍,確定了路徑調整方案的可行性和建立模型所需元素。并通過對國內外相關內容的研究,確定本文的研究方法和思想。為了達到這個目的,本文提出將基本的多式聯(lián)運網絡拆分成為時間網和空間網兩層,通過同時在兩層網絡上尋找可行路徑來求解問題,并用數學語言描述了在前方路徑中斷時,集裝箱多式聯(lián)運路徑調整問題的數學模型,為問題的求解打下基礎。通過對網絡的拆分,將問題分割成兩個子問題:可行路徑的搜索和路徑是否滿足時間要求的判斷。為了求解兩個子問題,本文提出了一種基于改進Dijkstra算法和動態(tài)規(guī)劃的混合啟發(fā)式算法,并通過算例進行模型和算法的驗證,并在模擬不同的網絡受損情況:部分路段受損、節(jié)點失效、前方城市失效下使用模型算法求解調整方案。實驗結果表明,本文建立數學模型魯棒性較好,求解算法可行,能夠在不同的網絡受損情況下對集裝箱多式聯(lián)運運輸路徑進行調整。
[Abstract]:Container multimodal transport is not only the innovation of modern freight transportation, but also the relatively advanced organization in container transportation. It not only plays a more and more important role in freight transportation, but also becomes more and more diversified. With the rapid development of global international trade, the market share of container transportation is increasing rapidly, and the requirements of efficiency and service quality of container multimodal transport are also increasing. But the multimodal transport network is complicated and the intermediate links are various, usually involving two or more modes of transport and the participation of multiple carriers. Because multimodal transport chain is longer, its reliability is relatively low. Usually, when the route is interrupted, the carrier will hold the cargo somewhere and wait for the remaining route to resume before carrying out the transportation work, which will inevitably result in a delay. In the face of more timely goods such as emergency relief supplies, not only the delivery date will be delayed, but also the operator, the carrier and the shipper will suffer great economic losses, which should be avoided. This paper is aimed at the emergency of route interruption (complete loss of road capacity rather than obstruction), from the macro, multimodal transport operator's point of view, in the case of transportation encountered by the forward path disruption, In order to meet the delivery time limit, the transportation plan is adjusted, while bypassing the interrupted section, the unplanned port node is chosen as few as possible, and as many transfer nodes as possible are used in the original plan. Through the definition of container multimodal transport, organizational form, cost structure and the scope of responsibility of the operator, the feasibility of the route adjustment scheme and the elements needed to establish the model are determined. And through the domestic and foreign related content research, determines this article research method and the thought. In order to achieve this goal, this paper proposes to divide the basic multimodal transport network into two layers, time network and space network, and to solve the problem by finding feasible paths on the two layers at the same time, and using mathematical language to describe when the forward path is interrupted. The mathematical model of container multimodal transport path adjustment problem lays the foundation for solving the problem. By splitting the network, the problem is divided into two sub-problems: the search of feasible path and the judgment of whether the path meets the requirement of time. In order to solve two sub-problems, this paper proposes a hybrid heuristic algorithm based on improved Dijkstra algorithm and dynamic programming, and verifies the model and algorithm through an example. Node failure, forward city failure using model algorithm to solve the adjustment scheme. The experimental results show that the mathematical model established in this paper is robust and the algorithm is feasible and can adjust the path of container multimodal transport under different network damage conditions.
【學位授予單位】：西南交通大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：U169

【參考文獻】

相關期刊論文 前10條

1 林天倚;盧春霞;;基于擁堵控制的軸輻式海運網絡樞紐港選擇模型[J];上海海事大學學報;2013年04期

2 陳丹丹;洪衛(wèi);賈禹;;面向隨機因素的多式聯(lián)運動態(tài)路徑優(yōu)化[J];重慶交通大學學報(自然科學版);2015年02期

3 楊菊花;朱昌鋒;田志強;;引入時間緊迫系數的應急物資運輸路徑優(yōu)化[J];鐵道科學與工程學報;2013年02期

4 王征;胡祥培;王旭坪;;行駛時間延遲下配送車輛調度的干擾管理模型與算法[J];系統(tǒng)工程理論與實踐;2013年02期

5 劉丹;趙嵩正;蔣維揚;劉靜;;規(guī)模經濟對多式聯(lián)運網絡成本最優(yōu)模型的影響[J];計算機工程與應用;2014年14期

6 李愈;趙軍;吳剛;陳佳琪;;帶有固定運費的多式聯(lián)運方式選擇[J];西南交通大學學報;2012年05期

7 王清斌;韓增霞;計明軍;李艷明;;基于節(jié)點作業(yè)隨機特征的集裝箱多式聯(lián)運路徑優(yōu)化[J];交通運輸系統(tǒng)工程與信息;2011年06期

8 劉杰;何世偉;宋瑞;黎浩東;;基于運輸方式備選集的多式聯(lián)運動態(tài)路徑優(yōu)化研究[J];鐵道學報;2011年10期

9 高鵬;金淳;鄧玲麗;;港口多式聯(lián)運系統(tǒng)銜接問題及建模方法綜述[J];科技管理研究;2010年23期

10 劉艦;俞建寧;董鵬;;多式聯(lián)運分運人選擇的模型和算法[J];運籌與管理;2010年05期

，

本文編號：1791967