首页 | 本学科首页   官方微博 | 高级检索  
     

装车地直达车流的自动识别算法
引用本文:孟德军. 装车地直达车流的自动识别算法[J]. 铁路计算机应用, 2008, 17(7): 25-26
作者姓名:孟德军
作者单位:沈阳铁路局,信息技术所,沈阳,110001
摘    要:
依据运输组织原则.提出一种自动识别装车地直达车流的算法.介绍实现该算法的决策支持软件的设计.

关 键 词:运输计划   装车地直达列车   集结车数   区域半径   车流跨度
收稿时间:2008-07-15

Algorithm of automatic recognition of through trains flow from loading localities
MENG De-jun. Algorithm of automatic recognition of through trains flow from loading localities[J]. Railway Computer Application, 2008, 17(7): 25-26
Authors:MENG De-jun
Affiliation:MENG De-jun(Information Technology Center,Shenyang Railway Administration,Shenyang 110001,China)
Abstract:
According to the principal of railway transportation organization,it was proposed an algorithm of the requirement analyses of through trains flow from loading localities.The software design which implemented the algorithm was also introduced.
Keywords:transportation planning  through trains flow from loading localities  number of wagon concentrating  radius of localities  train flow span  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《铁路计算机应用》浏览原始摘要信息
点击此处可从《铁路计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号