本文選題：客運專線　切入點：動車組交路計劃　出處：《蘭州交通大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：動車組是鐵路運輸旅客的重要工具,隨著我國高速鐵路網(wǎng)的不斷建設(shè),動車組的運行范圍將進一步擴大。而動車組購置成本高,檢修費用昂貴,在鐵路基礎(chǔ)建設(shè)投資和以后的運營成本中占較大比重,提高動車組運用效率、合理安排動車組的檢修直接關(guān)系到鐵路的經(jīng)濟效益。所以,作為鐵路運輸組織的重要計劃之一的動車組交路計劃的編制研究具有重要意義。本文在研究國內(nèi)外相關(guān)文獻的基礎(chǔ)上,總結(jié)了既有研究中存在的問題,介紹了動車組交路計劃的含義,分析了動車組交路計劃和動車組運用計劃之間的關(guān)系,對影響動車組交路計劃編制的因素進行了的探討并對動車組運用方式和檢修模式進行了詳細的敘述,然后對動車組交路計劃的常用建模方法進行梳理,為動車組交路計劃編制優(yōu)化理清思路。將動車組交路計劃編制問題歸納為一種特殊的旅行商問題。在列車運行圖已知的情況下,借鑒經(jīng)典旅行商的建模方法,確定了以動車組運用、列車運行線唯一接續(xù)、一級檢修、運用和檢修關(guān)聯(lián)、剔除列車運行線接續(xù)子回路為約束,以動車組運用交路數(shù)量最少和列車運行線總的接續(xù)時間最短為目標(biāo)函數(shù)的多約束、多目標(biāo)函數(shù)的動車組交路計劃編制模型,并針對模型中較難解決的整數(shù)規(guī)劃問題和多目標(biāo)問題進行了分析和處理。通過對求解旅行商問題的常用算法進行比較分析,確定了使用遺傳算法對該模型進行求解,對遺傳算法的基本理論進行介紹,包括遺傳算法的解編碼、初始種群、適應(yīng)度函數(shù)、選擇算子、交叉算子、變異算子,并結(jié)合動車組交路問題特點,對遺傳算法中選擇算子、交叉算子、變異算子等進行了改進設(shè)計。最后以武深高速鐵路為算例對改進算法進行了驗證,并與模擬退火算法和人工編制方法進行了對比,結(jié)果表明了改進算法的在編制動車組交路問題上有一定的高效性和實用性。
[Abstract]:EMU is an important tool for railway passenger transportation. With the continuous construction of high-speed railway network in China, the operating range of EMU will be further expanded. It takes a large proportion in the investment of railway infrastructure construction and the operation cost in the future. Improving the efficiency of EMU operation and arranging the maintenance of EMU reasonably are directly related to the economic benefit of railway. As one of the important plans of railway transportation organization, it is of great significance to study the preparation of the EMU traffic plan. On the basis of studying the relevant literature at home and abroad, this paper summarizes the problems existing in the existing research. This paper introduces the meaning of the EMU traffic plan, analyzes the relationship between the EMU traffic plan and the EMU operation plan. This paper discusses the factors that affect the preparation of EMU traffic plan, and describes in detail the mode of operation and maintenance of EMU, and then combs the common modeling methods of EMU traffic planning. In this paper, the train of mind is optimized for the preparation of the traversing plan of the EMU. The problem of the planning of the crossroad of the EMU is summed up as a special traveling salesman problem. When the train diagram is known, the modeling method of the classical traveller is used for reference. It is determined that the operation of the EMU, the unique continuity of the train running line, the connection of the first level overhaul, the application and the maintenance, and the elimination of the train running line continuous sub-loop are the constraints. Taking the minimum number of intersections and the shortest total connecting time of train running line as the multi-constraint of the objective function, the multi-objective function is used to compile the model of the crossroad planning of the EMU. The integer programming problem and multi-objective problem which are difficult to solve in the model are analyzed and dealt with. Through the comparison and analysis of the common algorithms for solving the traveling salesman problem, the genetic algorithm is used to solve the model. This paper introduces the basic theory of genetic algorithm, including the coding of genetic algorithm, initial population, fitness function, selection operator, crossover operator, mutation operator. The crossover operator, mutation operator and so on are improved. Finally, the improved algorithm is verified by taking Wu-Shen high-speed railway as an example, and compared with simulated annealing algorithm and artificial programming method. The results show that the improved algorithm has high efficiency and practicability in compiling EMU intersection problem.
【學(xué)位授予單位】：蘭州交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：U292.6;TP18

【參考文獻】

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

1 李文;伍鐵斌;趙全友;李玲香;;改進的混沌粒子群算法在TSP中的應(yīng)用[J];計算機應(yīng)用研究;2015年07期

2 程林輝;;禁忌搜索算法及其在TSP問題中的應(yīng)用研究[J];大眾科技;2013年05期

相關(guān)會議論文 前1條

1 王忠凱;史天運;張惟皎;王輝;;動車組開行計劃優(yōu)化模型及求解算法的研究[A];2014第九屆中國智能交通年會優(yōu)秀論文集[C];2014年

，

本文編號：1574960