客運(yùn)段乘務(wù)值乘交路計(jì)劃系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)
本文選題:客運(yùn)乘務(wù) + 值乘交路計(jì)劃。 參考:《北京交通大學(xué)》2012年碩士論文
【摘要】:乘務(wù)值乘交路計(jì)劃的編制是鐵路客運(yùn)系統(tǒng)的重要作業(yè)之一,包括列車運(yùn)行圖的獲取、乘務(wù)任務(wù)的分配、乘務(wù)工作時(shí)間的計(jì)算、各車次的乘務(wù)員安排、及乘務(wù)員工作時(shí)間與休息時(shí)間的分配。乘務(wù)值乘交路計(jì)劃的編制結(jié)果不僅決定著客運(yùn)段乘務(wù)成本的消耗,也影響著乘務(wù)員的工作效率,因此編制高質(zhì)量的乘務(wù)值乘交路計(jì)劃是一個(gè)較為復(fù)雜的問題。目前,客運(yùn)段仍普遍采用手工編制的方式編制乘務(wù)值乘交路計(jì)劃,這已不能滿足鐵路信息化的需求,國內(nèi)對于該問題的研究多集中于乘務(wù)日計(jì)劃的模型算法優(yōu)化研究,月度乘務(wù)計(jì)劃的自動(dòng)編制還有待于進(jìn)一步的探討,因此,研究開發(fā)一套科學(xué)完整的乘務(wù)值乘交路計(jì)劃系統(tǒng),對于提高客運(yùn)段的工作水平具有重要的意義。 首先,本論文歸納總結(jié)了當(dāng)前該領(lǐng)域的研究現(xiàn)狀,并對實(shí)地調(diào)研結(jié)果進(jìn)行了詳細(xì)的分析,針對現(xiàn)狀中存在的問題,挖掘出本文研究的創(chuàng)新方向;其次,對核心問題的優(yōu)化模型和算法進(jìn)行了研究,將值乘交路計(jì)劃問題轉(zhuǎn)化為非對稱旅行商問題,建立了非對稱旅行商問題的數(shù)學(xué)模型,運(yùn)用最小生成樹算法求解該模型,并通過算例對模型進(jìn)行了檢驗(yàn);最后,論文完成了對客運(yùn)段乘務(wù)值乘交路計(jì)劃系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn),包括對系統(tǒng)進(jìn)行范圍分析、需求分析及數(shù)據(jù)分析,設(shè)計(jì)了目標(biāo)系統(tǒng)的應(yīng)用架構(gòu),總體結(jié)構(gòu),系統(tǒng)流程和數(shù)據(jù)庫,并最終實(shí)現(xiàn)了值乘交路計(jì)劃的自動(dòng)編制。 通過研究,本文提出了較為完整的值乘交路計(jì)劃編制方法,將乘務(wù)值乘交路計(jì)劃問題轉(zhuǎn)化為非對稱的旅行商問題進(jìn)行研究,該模型的創(chuàng)新點(diǎn)在于能夠?qū)⒊藙?wù)日計(jì)劃與月計(jì)劃整合為一個(gè)問題進(jìn)行解決,較符合當(dāng)前客運(yùn)段的實(shí)際情況,并設(shè)計(jì)了科學(xué)的大休日添加方法。最終計(jì)算機(jī)系統(tǒng)的實(shí)現(xiàn)對客運(yùn)段信息化發(fā)展具有重要的意義。
[Abstract]:It is one of the important operations of railway passenger transportation system to draw up the plan of passenger transportation, including the acquisition of train diagram, the assignment of crew tasks, the calculation of crew working time, and the arrangement of crew members. And crew working hours and rest time allocation. The result of the plan not only determines the cost of passenger service, but also affects the work efficiency of the flight attendants. Therefore, it is a more complex problem to compile the high quality passenger value multiplicative route plan. At present, the passenger transport section still generally uses the manual compilation method to compile the passenger service value multiplication and intersection plan, which can not meet the needs of the railway informatization. The domestic research on this problem is mainly focused on the optimization of the model algorithm of the passenger service day plan. The automatic preparation of monthly crew planning needs further discussion. Therefore, it is of great significance to develop a scientific and complete system of passenger service value multiplication and intersection planning system for improving the working level of passenger transport section. First of all, this paper summarizes the current research situation in this field, and analyzes the field research results in detail, aiming at the existing problems, excavates the innovative direction of this study; secondly, In this paper, the optimization model and algorithm of the core problem are studied, the value multiplication intersection problem is transformed into the asymmetric traveling salesman problem, the mathematical model of the asymmetric traveling salesman problem is established, and the minimum spanning tree algorithm is used to solve the model. Finally, the design and implementation of the passenger segment value multiplication routing planning system are completed, including the scope analysis, demand analysis and data analysis of the system. The application architecture, the overall structure, the system flow and the database of the target system are designed. Finally, the automatic programming of the value multiplication routing plan is realized. Through the research, this paper puts forward a more complete method of compiling the plan of the value multiplicative intersection, which transforms the problem of the passenger service value multiplication plan into the asymmetric traveling salesman problem. The innovation of the model lies in the fact that the daily plan and the monthly plan can be integrated into a single problem to solve, which is more in line with the actual situation of the passenger transport section at present, and a scientific method of adding holiday day is designed. Finally, the realization of computer system is of great significance to the development of information technology in passenger transport section.
【學(xué)位授予單位】:北京交通大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2012
【分類號(hào)】:U293.1
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 趙禹驊,任偉民,李可柏;關(guān)于漢密爾頓最短路徑的算法[J];東方電氣評論;2004年01期
2 閻永光;黃斌;;廣深線城際列車乘務(wù)組排班計(jì)劃編制方法探討[J];交通運(yùn)輸工程與信息學(xué)報(bào);2010年01期
3 李成兵;魯工圓;郭倩倩;陳釘均;;動(dòng)車組乘務(wù)員運(yùn)用計(jì)劃的均衡性研究[J];內(nèi)燃機(jī)車;2009年12期
4 王瑩;劉軍;苗建瑞;;客運(yùn)專線乘務(wù)交路計(jì)劃編制的優(yōu)化模型與算法[J];鐵道學(xué)報(bào);2009年01期
5 趙鵬,胡安洲,楊浩;機(jī)車乘務(wù)員運(yùn)用計(jì)劃的優(yōu)化編制[J];鐵道學(xué)報(bào);1998年04期
6 趙鵬,姚鳳金,張洪亮;綜合調(diào)度仿真系統(tǒng)中的機(jī)車乘務(wù)計(jì)劃的編制[J];鐵道運(yùn)輸與經(jīng)濟(jì);2005年03期
7 張?zhí)K波;呂紅霞;劉淑輝;;列車乘務(wù)派班系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[J];鐵道運(yùn)輸與經(jīng)濟(jì);2007年08期
8 夏平;馬建軍;;乘務(wù)員運(yùn)用計(jì)劃編制模型與計(jì)算方法的研究[J];鐵道運(yùn)輸與經(jīng)濟(jì);2007年11期
9 王瑩;劉軍;王偉;苗建瑞;;客運(yùn)專線乘務(wù)計(jì)劃優(yōu)化編制系統(tǒng)研究[J];鐵路計(jì)算機(jī)應(yīng)用;2009年04期
10 王媛媛;周成晨;倪少權(quán);;基于蟻群算法的客運(yùn)專線乘務(wù)交路計(jì)劃編制方法研究[J];鐵路計(jì)算機(jī)應(yīng)用;2009年07期
相關(guān)博士學(xué)位論文 前1條
1 王瑩;動(dòng)車組運(yùn)用計(jì)劃和乘務(wù)計(jì)劃的優(yōu)化方法研究[D];北京交通大學(xué);2009年
相關(guān)碩士學(xué)位論文 前5條
1 于得水;客運(yùn)專線乘務(wù)計(jì)劃編制系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[D];西南交通大學(xué);2007年
2 銀大偉;乘務(wù)計(jì)劃編制系統(tǒng)的研究與設(shè)計(jì)[D];西南交通大學(xué);2008年
3 陳旭;基于乘務(wù)員偏好性的機(jī)車乘務(wù)交路編制研究[D];北京交通大學(xué);2009年
4 張?zhí)K波;客運(yùn)專線乘務(wù)排班系統(tǒng)相關(guān)問題研究[D];西南交通大學(xué);2009年
5 文永軍;旅行商問題的兩種智能算法[D];西安電子科技大學(xué);2010年
,本文編號(hào):2109186
本文鏈接:http://sikaile.net/jingjilunwen/jtysjj/2109186.html