本文選題：貨物運到期限 + 階段計劃　； 參考：《西南交通大學(xué)》2012年碩士論文

【摘要】：過去我國鐵路由于運能不足,運輸業(yè)務(wù)量大,導(dǎo)致鐵部門輸重視運輸能力,輕視服務(wù)質(zhì)量,客貨混線,貨物列車以集結(jié)滿軸出發(fā),貨物運到期限保障率低。在各種運輸方式綜合競爭的時代,鐵路在貨物運輸上面臨嚴峻的競爭。本文立足于未來鐵路客貨分離,貨運能力大大提高之后,如何充分參與貨運市場競爭的背景,抓住貨物運到期限的準確性這個影響貨主選擇運輸方式的關(guān)鍵因素作為考慮對象。如何將運到期限納入鐵路運輸作業(yè)各環(huán)節(jié)成為控制作業(yè)流程和效率的因素,以及對現(xiàn)有編組站作業(yè)方式的改變是本論文研究的重點。 在研究內(nèi)容上本文先分析了我國鐵路運輸現(xiàn)階段貨物運到期限的現(xiàn)狀,再研究貨物運輸過程時間分布特性規(guī)律,借鑒前人研究成果將送達時間看成滿足服從正態(tài)分布規(guī)律。按照蒙特卡羅仿真辦法計算運輸環(huán)節(jié)各點作業(yè)時間的比例均值,利用MATLAB編程實現(xiàn)運到期限分配到各環(huán)節(jié)。 編組站是改編大量車流和列流的地方,其階段計劃的質(zhì)量直接影響到列車出發(fā)計劃,是貨物運輸途中重要環(huán)節(jié),對運到期限的保障有重要影響。故本文以編組站階段計劃的配流為研究對象,考慮時效性物資受運到期限影響會有最大在站停留時間,其值會對配流過程產(chǎn)生影響。綜合考慮接續(xù)關(guān)系及解編順序因素,建立以配流代價最小為目標的非線性規(guī)劃模型。利用遺傳算法將模型分為順序調(diào)整和靜態(tài)配流求解。采用VC、LINGO、MATLAB互相調(diào)用實現(xiàn)算法求解。最后用算例驗證模型和算法有效性。 本文以期將運到期限納入運送過程中編組站配流環(huán)節(jié),通過改變現(xiàn)有配流方式提高貨物運到期限在中間站點的保障。
[Abstract]:In the past, because of the shortage of transportation capacity and the large volume of transportation business, the railway in our country paid more attention to the transportation capacity, despised the service quality, mixed passenger and cargo lines, set out by assembling the full axle, and the guarantee rate of goods delivery period was low. In the era of comprehensive competition of various modes of transport, railway faces severe competition in freight transportation. Based on the separation of passenger and cargo in the future and the improvement of freight capacity, how to fully participate in the background of freight market competition, and how to grasp the accuracy of the time limit of goods delivery, which is the key factor affecting the cargo owner's choice of transportation mode as the object of consideration. How to bring the time limit into the railway transportation operation is a factor to control the operation flow and efficiency, and how to change the operation mode of the existing marshalling yard is the focus of this paper. In the content of the research, this paper first analyzes the present situation of the time limit of the railway transportation in China, then studies the law of the time distribution of the freight transportation process, and regards the service time as the normal distribution law of the service according to the previous research results. According to the Monte Carlo simulation method, the proportional mean of operation time of each point in transportation link is calculated, and the delivery period is allocated to each link by MATLAB programming. The marshalling station is the place where a large number of train flow and train flow are adapted. The quality of the stage plan directly affects the train departure plan, is an important link in the transportation of goods, and has an important influence on the guarantee of the delivery period. Therefore, this paper takes the scheduling of marshalling yard stage as the research object, and considers that the maximum residence time of material in the station will be affected by the time limit, and its value will have an effect on the flow allocation process. A nonlinear programming model with minimum allocation cost is established considering the factors of continuity relation and unmarshalling sequence. Genetic algorithm is used to divide the model into sequential adjustment and static assignment. The algorithm is solved by using VC LINGOU MATLAB to call each other. Finally, an example is used to verify the validity of the model and algorithm. This paper hopes to bring the delivery period into the flow distribution link in the marshalling yard and to improve the guarantee of the delivery period in the intermediate station by changing the current flow distribution mode.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：U294.1

【參考文獻】

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

1 趙義紅,李正文,何其四;生物信息處理系統(tǒng)遺傳算法探討[J];成都理工大學(xué)學(xué)報(自然科學(xué)版);2004年05期

2 薛鋒;王慈光;;編組站配流相關(guān)問題分析[J];交通運輸工程與信息學(xué)報;2008年04期

3 朱昌鋒;李引珍;;提速條件下鐵路貨物運到期限計算方法[J];交通運輸工程學(xué)報;2009年05期

4 李瑋;孫晚華;;貨物送達時間的概率分析[J];交通科技與經(jīng)濟;2007年03期

5 王貞君,孫晚華;鐵路貨物運到期限保障的探討[J];物流科技;2005年01期

6 周樹德;孫增圻;;分布估計算法綜述[J];自動化學(xué)報;2007年02期

7 翁貴平;提高鐵路運輸質(zhì)量的幾點思考[J];內(nèi)蒙古科技與經(jīng)濟;2005年05期

8 趙闖,張曉東,劉凱;改進中國鐵路貨物運到期限的措施與途徑[J];鐵道貨運;2001年05期

9 申永生;何世偉;黎浩東;穆美如;王保華;;自適應(yīng)粒子群算法求解編組站車流推算問題的研究[J];鐵道貨運;2010年12期

10 張正清;鐵路運輸營銷實務(wù)初探[J];鐵道經(jīng)濟研究;2000年01期

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

1 雷桂媛;關(guān)于蒙特卡羅及擬蒙特卡羅方法的若干研究[D];浙江大學(xué);2003年

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

1 王爍;考慮解編順序的編組站階段計劃配流問題研究[D];北京交通大學(xué);2011年

2 常軍乾;編組站階段計劃編制系統(tǒng)設(shè)計與若干技術(shù)的研究[D];西南交通大學(xué);2002年

3 錢名軍;編組站車流組織方法研究[D];蘭州交通大學(xué);2009年

4 孟潤虎;編組站列車解編協(xié)調(diào)優(yōu)化相關(guān)問題研究[D];西南交通大學(xué);2010年

，

本文編號：1875570