本文選題：集裝箱海鐵聯(lián)運(yùn) + 最優(yōu)路徑算法�。� 參考：《北京交通大學(xué)》2017年碩士論文

【摘要】：在西方較為發(fā)達(dá)的國(guó)家中,集裝箱海鐵聯(lián)運(yùn)的比重逐年不斷提高。相比而言,我國(guó)的海鐵聯(lián)運(yùn)所占比重很低;近年來(lái),國(guó)際貿(mào)易持續(xù)衰頹,航運(yùn)業(yè)普遍面臨虧損。目前航運(yùn)業(yè)經(jīng)濟(jì)競(jìng)爭(zhēng)形勢(shì)較為嚴(yán)峻,集裝箱運(yùn)輸公司無(wú)法像以前一樣,通過(guò)大幅度提高集裝箱的里程運(yùn)價(jià)來(lái)增加利潤(rùn)。因此,在保證集裝箱貨物運(yùn)輸安全到達(dá)目的地的前提下,如何銜接各種運(yùn)輸方式,優(yōu)化運(yùn)輸路徑,將其成本和運(yùn)輸費(fèi)用控制在最低限度是提高利潤(rùn)的重點(diǎn)所在。本文的研究主要從三個(gè)方面進(jìn)行:第一,針對(duì)國(guó)內(nèi)外集裝箱運(yùn)輸成本居高不下,發(fā)展趨勢(shì)緩慢的問(wèn)題,分析了目前集裝箱海鐵聯(lián)運(yùn)發(fā)展現(xiàn)狀,海鐵聯(lián)運(yùn)最優(yōu)路徑算法,如經(jīng)典Dijkstra、蟻群算法路徑優(yōu)化遍歷等算法,以及算法在海鐵聯(lián)運(yùn)中的發(fā)展情況;第二,在對(duì)海鐵聯(lián)運(yùn)最優(yōu)化路徑算法進(jìn)行分析的基礎(chǔ)上,對(duì)傳統(tǒng)Dijkstra算法做出改進(jìn)設(shè)計(jì),并對(duì)其與改進(jìn)后算法的搜索效率進(jìn)行對(duì)比,解決單條件限制(成本或路徑長(zhǎng)度)最優(yōu)路徑選擇問(wèn)題;另外綜合考慮列車時(shí)間,等待成本,路徑長(zhǎng)度等影響因素,建立多條件限制下海鐵聯(lián)運(yùn)模型,并通過(guò)改進(jìn)蟻群算法進(jìn)行求解,解決多條件限制下的最優(yōu)路徑選擇問(wèn)題。第三,利用Anylogic仿真工具進(jìn)行模擬仿真,將改進(jìn)后的算法應(yīng)用到海鐵聯(lián)運(yùn)最優(yōu)化路線的選擇中,使用案例分析,對(duì)不同海鐵聯(lián)運(yùn)路徑的時(shí)間的計(jì)算進(jìn)行比較并得出最優(yōu)路徑,為集裝箱規(guī)劃路徑沿線港口的選則提供決策依據(jù)。本文通過(guò)解決并仿真實(shí)現(xiàn)海鐵聯(lián)運(yùn)中最優(yōu)路徑的選擇問(wèn)題,加快我國(guó)集裝箱海鐵聯(lián)運(yùn)的快速反應(yīng)能力,節(jié)省運(yùn)行成本,提高集裝箱海鐵聯(lián)運(yùn)競(jìng)爭(zhēng)力,增加算法經(jīng)濟(jì)可行性、應(yīng)用可行性、選擇可行性。
[Abstract]:In the western developed countries, the proportion of intermodal containers and constantly improve year by year. In contrast, rail transport in our country the proportion is very low; in recent years, continued to decline in international trade, shipping industry generally faced losses. The shipping industry competition situation is more severe, the container transportation company like never before. In order to increase profits through large increase of container freight mileage. Therefore, in order to ensure the safe arrival of the container transport of goods under the premise of how to optimize the convergence of various modes of transport, transportation route, the cost and the transportation cost control at a minimum is to improve profitability of the focus. This study mainly from three aspects: first, based on the domestic and international container transportation costs remain high, the development trend of slow problem, analyzes the current development status of container sea rail transport, rail transport optimal path As the classical Dijkstra algorithm, ant colony algorithm, path optimization and development of traversal algorithm, algorithm in sea rail transportation; second, based on the rail transport optimization path algorithm analysis, make the improved design of the traditional Dijkstra algorithm, and the improved algorithm and the search efficiency compared to solve single constraints (cost or path length) optimal routing problem; in addition to considering the train time, waiting cost, factors such as path length, the establishment of a variety of conditions sea and railway transport model, and is solved by the improved ant colony algorithm to solve the optimal path selection problem under constraints. The model is simulated by Anylogic third. The simulation tool, the improved algorithm is applied to the rail transport route optimization, analysis of use case, to calculate the different rail transport path time Compared to obtain the optimal path, provides the decision basis for container ports along the planning path selection. Through simulation and solve the optimal selection problem of sea rail transport path, speeding up the rapid response capability of China's container sea rail transport, saving operating costs, improve the competitiveness of container rail transport increase algorithm, and economic feasibility. The feasibility, feasibility.

【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：U169.6

【參考文獻(xiàn)】

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

1 蔡婉君;王晨宇;于濱;楊忠振;姚寶珍;;改進(jìn)蟻群算法優(yōu)化周期性車輛路徑問(wèn)題[J];運(yùn)籌與管理;2014年05期

2 袁彬;劉建勝;錢丹;羅大海;;一種基于改進(jìn)Dijkstra的物流網(wǎng)絡(luò)路徑優(yōu)化算法分析[J];制造業(yè)自動(dòng)化;2014年09期

3 徐濤;丁曉璐;李建伏;;K最短路徑算法綜述[J];計(jì)算機(jī)工程與設(shè)計(jì);2013年11期

4 ;Adaptive Iterative Learning Control for Nonlinearly Parameterized Systems with Unknown Time-varying Delay and Unknown Control Direction[J];International Journal of Automation and Computing;2012年06期

5 謝新連;趙福杰;趙家保;謝歡;;集裝箱鐵水聯(lián)運(yùn)研究現(xiàn)狀與動(dòng)態(tài)[J];中國(guó)航海;2012年03期

6 譚寶成;王培;;A~*路徑規(guī)劃算法的改進(jìn)及實(shí)現(xiàn)[J];西安工業(yè)大學(xué)學(xué)報(bào);2012年04期

7 王慧;汪傳旭;;模糊需求環(huán)境下集裝箱多式聯(lián)運(yùn)箱型和運(yùn)輸方式的選擇[J];公路交通科技;2012年04期

8 成志忠;李衛(wèi)東;萬(wàn)敏;;基于深度遍歷的網(wǎng)格模型表面分割算法[J];塑性工程學(xué)報(bào);2010年02期

9 ;Improved ant colony optimization algorithm for the traveling salesman problems[J];Journal of Systems Engineering and Electronics;2010年02期

10 Maurizio Marchese;;An ant colony optimization method for generalized TSP problem[J];Progress in Natural Science;2008年11期

相關(guān)重要報(bào)紙文章 前1條

1 汪壽陽(yáng);;大數(shù)據(jù)經(jīng)濟(jì)[N];文匯報(bào);2015年

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

1 王淑偉;站點(diǎn)周邊用地特性對(duì)軌道客流影響機(jī)理研究[D];北京工業(yè)大學(xué);2015年

2 張琦;內(nèi)陸中轉(zhuǎn)型鐵路樞紐集裝箱海鐵聯(lián)合運(yùn)輸組織理論研究[D];北京交通大學(xué);2012年

3 湯青慧;基于電子海圖的航線規(guī)劃方法研究[D];中國(guó)海洋大學(xué);2011年

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

1 尚歡;集裝箱公鐵聯(lián)運(yùn)成本模型的構(gòu)建與應(yīng)用[D];長(zhǎng)安大學(xué);2015年

2 宋達(dá)寬;集裝箱鐵路運(yùn)輸定價(jià)與海鐵聯(lián)運(yùn)補(bǔ)貼水平研究[D];大連海事大學(xué);2014年

3 黃霏茜;基于低碳運(yùn)輸?shù)拇筮B港集裝箱海鐵聯(lián)運(yùn)效益分析[D];大連海事大學(xué);2012年

4 邵麗麗;海上航線規(guī)劃的算法研究[D];中國(guó)海洋大學(xué);2011年

5 鄭友妍;基于AnyLogic的鋼鐵企業(yè)鐵路運(yùn)輸系統(tǒng)仿真優(yōu)化研究[D];北京交通大學(xué);2009年

，

本文編號(hào)：1769405