货物列车违流违编分析查询系统的设计与实现
|
摘要
随着铁路应用大量现代化技术及设备,铁路运输密度不断增大,调度员和货物编组站所采用的手工台帐方式已难以适应铁路跨越式发展的要求。为了减少机车、车辆中转次数,避免运输能力的浪费,提高铁路运输效率和增加经济效益,提出了设计货物列车违流违编系统,而如何实现系统的设计和分析是本文的重点。
铁路网车流分配目的在于获得路网点线流量以及车流径路方案,属于网络优化问题,是路网规划的基础,对铁路运输组织起着重要的辅助指导作用。本文在深入研究铁路网车流分配理论体系和优化方法的基础上,结合我国铁路运输组织特点,首先分析了铁路网编组计划的主要相关因素,描述了铁路网车流径路分配方法,描述了以Dijkstra算法为基础的铁路网任意两个站间最短路径求解计算方法,通过利用闭值作为搜索约束,使搜索沿着从起点至终点最短路径的方向进行,消除了不必要的搜索过程,节省了搜索的时间,提高了求解最短路径算法的效率。
本文结合系统本身的因素论述了系统目标、功能、设计和软硬件环境,并对车流径路的知识表示及生成方法进行了较详细的阐述。最后利用后台程序实现用计算机分析列车确报,最终为运输计划编制人员在日常工作中提供查询依据,同时提高编组站编组质量,提高铁路运输效率和经济效益。
With the application of large quantities of modern railway technology and equipment, railway transport density increasing, dispatchers and cargo marshalling yard ledger used in manual mode can not meet the requirements of the railway by leaps and bounds. In order to reduce locomotive and transit times, avoid the waste of transport capacity and improve rail transportation efficiency and enhance economic efficiency, the design against the flow of freight trains compiled against the system, how the design and analysis is the focus of this article.
Purpose of the railway network traffic distribution line of traffic and access to road network traffic routing plan, are network optimization problems, is the basis for road network planning, organization of railway transport plays an important role in supporting guidance. This in-depth distribution of the railway network traffic system and the optimization theory based on the characteristics of railway transportation in our country, first analyzes the main railway marshalling scheme related factors, described the railway traffic path allocation method, described by Dijkstra algorithm as the basis of the railway network the shortest path between any two points solution calculation Threshold as a search through the use of restraint, to search along the shortest path from start to finish direction, eliminating unnecessary search process, saving search of time and increase the efficiency of solving the shortest path algorithm.
This in-depth distribution of the railway network traffic system and the optimization theory based on the combination of the factors that this paper discusses the system itself system objectives, functions, design and hardware and software environment, and traffic flow path of knowledge representation and generation methods for the detail. Finally, the background program is indeed implemented by the computer analysis of the train reported that the final plan for the transportation compilers provide access to in their daily work basis, while improving the quality of marshalling yard marshalling and improve the efficiency of railway transport and economic benefits.
铁路网车流分配目的在于获得路网点线流量以及车流径路方案,属于网络优化问题,是路网规划的基础,对铁路运输组织起着重要的辅助指导作用。本文在深入研究铁路网车流分配理论体系和优化方法的基础上,结合我国铁路运输组织特点,首先分析了铁路网编组计划的主要相关因素,描述了铁路网车流径路分配方法,描述了以Dijkstra算法为基础的铁路网任意两个站间最短路径求解计算方法,通过利用闭值作为搜索约束,使搜索沿着从起点至终点最短路径的方向进行,消除了不必要的搜索过程,节省了搜索的时间,提高了求解最短路径算法的效率。
本文结合系统本身的因素论述了系统目标、功能、设计和软硬件环境,并对车流径路的知识表示及生成方法进行了较详细的阐述。最后利用后台程序实现用计算机分析列车确报,最终为运输计划编制人员在日常工作中提供查询依据,同时提高编组站编组质量,提高铁路运输效率和经济效益。
With the application of large quantities of modern railway technology and equipment, railway transport density increasing, dispatchers and cargo marshalling yard ledger used in manual mode can not meet the requirements of the railway by leaps and bounds. In order to reduce locomotive and transit times, avoid the waste of transport capacity and improve rail transportation efficiency and enhance economic efficiency, the design against the flow of freight trains compiled against the system, how the design and analysis is the focus of this article.
Purpose of the railway network traffic distribution line of traffic and access to road network traffic routing plan, are network optimization problems, is the basis for road network planning, organization of railway transport plays an important role in supporting guidance. This in-depth distribution of the railway network traffic system and the optimization theory based on the characteristics of railway transportation in our country, first analyzes the main railway marshalling scheme related factors, described the railway traffic path allocation method, described by Dijkstra algorithm as the basis of the railway network the shortest path between any two points solution calculation Threshold as a search through the use of restraint, to search along the shortest path from start to finish direction, eliminating unnecessary search process, saving search of time and increase the efficiency of solving the shortest path algorithm.
This in-depth distribution of the railway network traffic system and the optimization theory based on the combination of the factors that this paper discusses the system itself system objectives, functions, design and hardware and software environment, and traffic flow path of knowledge representation and generation methods for the detail. Finally, the background program is indeed implemented by the computer analysis of the train reported that the final plan for the transportation compilers provide access to in their daily work basis, while improving the quality of marshalling yard marshalling and improve the efficiency of railway transport and economic benefits.
引文
[1]郑时德,吴汉琳.铁路行车组织[M]北京：铁道出版社,1998
[2]柯契涅夫主编,高家驹等译.铁路运输行车组织[M]北京：中国铁道出版社,1985
[3]徐瑞华.铁路运输能力利用问题研究[D].北交人博十学位论文,1995
[4]铁路通过能力的利用和发展[M].北京：铁道出版社,1981
[5]苏保卫.路网结构和车流径路存储方法的研究.兰州铁道学院学报,2003,22(6)：137-139.
[6]车流组织原理和车流径路的确定原则URL:http://col.njtu.edu.cn/ jingpinke/yszzx/t1/3104.htm.
[7]刘志军.提高认识开拓创新编制高质量高效益的列车运行图.铁道运输与经济,2000,22(10)：1-4.
[8]何世伟,戴新婆,雷中林等.路网运输能力及计算方法的研究[J].铁道学报,2003.4
[9]平杰臣等.最短路径问题的一种改进算法[J].测绘学院学报,1999,4.
[10]王苏男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994,5：43-49.
[11]陆锋,卢冬梅,崔伟宏.基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法[J].中国图像图形学报,1999.12.
[12]彭建伟,殷人昆.基于邻接表结构的径路搜索算法研究.计算机工程与设计,2006,18：35-39.
[13]司连法,王文静.快速Dijkstra最短路径优化算法的实现[J].测绘通报,2005,2(8)：15-18
[14]徐凤生.最短路径的求解算法.计算机应用,2004,24(5)：88-89.
[15]平杰臣等.最短路径问题的一种改进算法[J].测绘学院学报,1999,4.
[16]青学江,熊天文,刘宗局.铁路运输最短径路二阶求解.铁路运输与经济,1996,18(4)：28-30
[17]乐阳等Dijkstra最短路径算法的一种高效率实现[J].武汉：武汉测绘科技大学学报,1999,24(3)：62-64.
[18]李引珍,顾守淮.铁路网络两顶点间最短路径定向搜索算法.铁道学报,1997,19(2)：25-27
[19]张华.特定经由标记语言的车流径路计算分析方法.铁道运输与经济,2000,22(7)：31-33.
[20]李洪波,张吉赞.单源点最短路径动态优化算法.计算机工程与应用,2006,42(3)：82-85
[21]余冬梅,张秋余,马少林,方霆Dijkstra算法的优化.计算机工程,2004,30(22)：145-146
[22]宋建业.全国铁路车流径路计算方法的研究.兰州铁道学院学报,1990,9(3)：37-43.
[23]吴毅.铁路运输径路计算机处理系统方案设计与研究[J].铁路计算机应用,2006.5.
[24]傅冬绵.交通问题系统中最短路径的新算法[J].华侨大学学报,2001,4.
[25]Yen-Liang Chen,Shu-Hao yang.Shortest paths in traffic light networks[J].Transportation Research,2000,34:241-253.
[26]周永富,任守良.关于铁路运输能力计算法的几个问题.铁道运输与经济[J].1992.7
[27]施昌明.全国站间最短径路特定经由里程算法的电脑实现.电脑开发与应用,1993,7(4)：29-31.
[28]史峰,孔庆铃,胡安洲.车流路径与编组计划综合优化的网络方法[J].铁道学报,1997
[29]罗国雄.铁路运输方案[M]北京：中国铁道出版社,1987
[30]施其洲.铁路网络运输系统运输能力与车流路径模型[J].铁道学报,19%,18(4)
[31]MichaelGirdley著,J2EE应用与BEA Web Logic Server J2EEApplication and BEA WebLogic Server [M]电子工业出版社,2002
[32]呼志刚,王伟TMIS现在车管理信息系统常见问题及处理办法,京铁科技通讯.2001,(2).-46-47
[33]白煜坤.违流车监测及重车车流统计的计算机实现,中国科技成果数据库,2007.2.-3-4
[34]宋璇,胡怀勇,王敦洲.数据库移植方法的探讨.科技进步与对策,2003
[35]XU Li hua.A Computer Algorithm for the Shortest Path Problem [J].Systems Engineering,1989,7(5):46251.(in Chinese).
[36]陆锋.最短路径算法：分类体系与研究进展[J].测绘学报,2001,3：269-275.
[37]何世伟等.编组站阶段计划优化模型及算法[J].铁道学报,1997.6
[38]李引珍.路网上货运路径的计算[J].铁道学报,1997,9(3)：14-18
[39]王苏男,冯育麟.车流径路域研究.铁道学报,1996,18(AOO)：20-24
[40]张华.铁路车流经由计算系统分析.铁道货运,2000,1(3)：33-34.
[41]江南,李夏苗,朱永辉,韦成燕.论铁路车流径路的数学问题.中国铁道科学.2004,25(5)：121-124.
[42]蔡淑兰.最短路径算法在铁路客运系统中应用的研究.燕山大学学报,1998,22(2)：157-159
[43]李军.在VFP6.O中实现铁路路网里程计算.中国铁道科学,2002,23(3)：130-134
[44]毛思晨.车流去向查询实现算法.铁路计算机运用,2004,13(6)：10-12
[2]柯契涅夫主编,高家驹等译.铁路运输行车组织[M]北京：中国铁道出版社,1985
[3]徐瑞华.铁路运输能力利用问题研究[D].北交人博十学位论文,1995
[4]铁路通过能力的利用和发展[M].北京：铁道出版社,1981
[5]苏保卫.路网结构和车流径路存储方法的研究.兰州铁道学院学报,2003,22(6)：137-139.
[6]车流组织原理和车流径路的确定原则URL:http://col.njtu.edu.cn/ jingpinke/yszzx/t1/3104.htm.
[7]刘志军.提高认识开拓创新编制高质量高效益的列车运行图.铁道运输与经济,2000,22(10)：1-4.
[8]何世伟,戴新婆,雷中林等.路网运输能力及计算方法的研究[J].铁道学报,2003.4
[9]平杰臣等.最短路径问题的一种改进算法[J].测绘学院学报,1999,4.
[10]王苏男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994,5：43-49.
[11]陆锋,卢冬梅,崔伟宏.基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法[J].中国图像图形学报,1999.12.
[12]彭建伟,殷人昆.基于邻接表结构的径路搜索算法研究.计算机工程与设计,2006,18：35-39.
[13]司连法,王文静.快速Dijkstra最短路径优化算法的实现[J].测绘通报,2005,2(8)：15-18
[14]徐凤生.最短路径的求解算法.计算机应用,2004,24(5)：88-89.
[15]平杰臣等.最短路径问题的一种改进算法[J].测绘学院学报,1999,4.
[16]青学江,熊天文,刘宗局.铁路运输最短径路二阶求解.铁路运输与经济,1996,18(4)：28-30
[17]乐阳等Dijkstra最短路径算法的一种高效率实现[J].武汉：武汉测绘科技大学学报,1999,24(3)：62-64.
[18]李引珍,顾守淮.铁路网络两顶点间最短路径定向搜索算法.铁道学报,1997,19(2)：25-27
[19]张华.特定经由标记语言的车流径路计算分析方法.铁道运输与经济,2000,22(7)：31-33.
[20]李洪波,张吉赞.单源点最短路径动态优化算法.计算机工程与应用,2006,42(3)：82-85
[21]余冬梅,张秋余,马少林,方霆Dijkstra算法的优化.计算机工程,2004,30(22)：145-146
[22]宋建业.全国铁路车流径路计算方法的研究.兰州铁道学院学报,1990,9(3)：37-43.
[23]吴毅.铁路运输径路计算机处理系统方案设计与研究[J].铁路计算机应用,2006.5.
[24]傅冬绵.交通问题系统中最短路径的新算法[J].华侨大学学报,2001,4.
[25]Yen-Liang Chen,Shu-Hao yang.Shortest paths in traffic light networks[J].Transportation Research,2000,34:241-253.
[26]周永富,任守良.关于铁路运输能力计算法的几个问题.铁道运输与经济[J].1992.7
[27]施昌明.全国站间最短径路特定经由里程算法的电脑实现.电脑开发与应用,1993,7(4)：29-31.
[28]史峰,孔庆铃,胡安洲.车流路径与编组计划综合优化的网络方法[J].铁道学报,1997
[29]罗国雄.铁路运输方案[M]北京：中国铁道出版社,1987
[30]施其洲.铁路网络运输系统运输能力与车流路径模型[J].铁道学报,19%,18(4)
[31]MichaelGirdley著,J2EE应用与BEA Web Logic Server J2EEApplication and BEA WebLogic Server [M]电子工业出版社,2002
[32]呼志刚,王伟TMIS现在车管理信息系统常见问题及处理办法,京铁科技通讯.2001,(2).-46-47
[33]白煜坤.违流车监测及重车车流统计的计算机实现,中国科技成果数据库,2007.2.-3-4
[34]宋璇,胡怀勇,王敦洲.数据库移植方法的探讨.科技进步与对策,2003
[35]XU Li hua.A Computer Algorithm for the Shortest Path Problem [J].Systems Engineering,1989,7(5):46251.(in Chinese).
[36]陆锋.最短路径算法：分类体系与研究进展[J].测绘学报,2001,3：269-275.
[37]何世伟等.编组站阶段计划优化模型及算法[J].铁道学报,1997.6
[38]李引珍.路网上货运路径的计算[J].铁道学报,1997,9(3)：14-18
[39]王苏男,冯育麟.车流径路域研究.铁道学报,1996,18(AOO)：20-24
[40]张华.铁路车流经由计算系统分析.铁道货运,2000,1(3)：33-34.
[41]江南,李夏苗,朱永辉,韦成燕.论铁路车流径路的数学问题.中国铁道科学.2004,25(5)：121-124.
[42]蔡淑兰.最短路径算法在铁路客运系统中应用的研究.燕山大学学报,1998,22(2)：157-159
[43]李军.在VFP6.O中实现铁路路网里程计算.中国铁道科学,2002,23(3)：130-134
[44]毛思晨.车流去向查询实现算法.铁路计算机运用,2004,13(6)：10-12