检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:耿敬春 武建平 聂英杰 倪少权[1,5,6] GENG Jingchun;WU Jianping;NIE Yingjie;NI Shaoquan(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu Sichuan 610031,China;Engineering Design and Appraisal Center,China State Railway Group Co.,Ltd.,Beijing 100844,China;Track and Station Yard Consultation Department,China Railway Economic and Planning Research Institute,Beijing 100844,China;Transportation Planning and Research Institute,China Railway Design Corporation,Tianjin 300308,China;National and Local Joint Engineering Laboratory of Comprehensive Intelligent Transportation,Southwest Jiaotong University,Chengdu Sichuan 610031,China;National Engineering Laboratory of Integrated Transportation Big Data Application Technology,Southwest Jiaotong University,Chengdu Sichuan 610031,China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都610031 [2]中国国家铁路集团有限公司工程设计鉴定中心,北京100844 [3]中国铁路经济规划研究院有限公司线路站场咨询部,北京100844 [4]中国铁路设计集团有限公司交通运输规划研究院,天津300308 [5]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都610031 [6]西南交通大学综合交通大数据应用技术国家工程实验室,四川成都610031
出 处:《中国铁道科学》2022年第5期123-131,共9页China Railway Science
基 金:国家自然科学基金资助项目(52072314)。
摘 要:针对列流线铺画中枢纽车站数量多、车站衔接方向多以及列车种类多等现实难题,提出列流线生成与排序优化算法,实现列流图的快速铺画。根据列流图“横平竖直”的表现形式,按线路经纬向分割同一方向衔接多条线路的车站,作为后续算法的基础;基于双向扫描算法思想,构建列流线路径的优化生成算法,在任意车站对之间生成列流线备选集合,通过人机交互方式快速确定列流线径路;以列流线交叉点最少兼顾中心对称为优化目标,提出列流线排序优化算法,快速确定列流线在沿途各区间及车站内的空间相对位置。基于列流线生成与排序优化算法开发列流图优化编制辅助设计系统,并以金华铁路枢纽为例进行验证。结果表明:生成列流图无列流径路以及数据标识错误,且列流线备选集合生成以及列流线排序的时间消耗均小于1 s,列流线生成与排序优化算法具有合理性与有效性。In order to solve practical problems such as the large number of hub stations, connecting directions and trains during the layout of train flow line, an optimization algorithm for the generation and sorting of train flow line is proposed to realize the rapid layout of Train Flow Diagram(TFD). According to the form of“horizontal and vertical” in TFD, the stations, connecting multiple lines in the same direction, are segmented according to the longitude and latitude of the lines, which serves as the basis of the subsequent algorithm. Based on the idea of double-sweep algorithm, an optimized generation algorithm for the path of train flow line is constructed to generate the alternative sets of train flow lines between each station pair, and the path of train flow lines is promptly selected by Human-Computer Interaction(HCI). With the minimum crossing of train flow lines and taking into account the centrosymmetry as the optimization objectives, an optimization algorithm for train flow line sorting is proposed to quickly determine the spatial relative positions of the train flow line in each section and station along the path. An aided design system for the optimization compilation of TFD is developed based on the optimization algorithm for the generation and sorting of train flow lines, and verified by the example of Jinhua railway hub. The results show that the generated train flow diagram has neither train flow path nor data identification mistakes, and the time consumption of the generation for the alternative sets of train flows and the sorting of train flow lines is both less than 1 s. The optimization algorithm for the generation and sorting of train flow lines has rationality and effectiveness.
关 键 词:铁路运输组织 铁路枢纽 列流图 列流线生成 列流线排序优化算法
分 类 号:U292.41[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3