检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京交通大学学报》2017年第1期14-19,共6页JOURNAL OF BEIJING JIAOTONG UNIVERSITY
基 金:国家自然科学基金(71390332)~~
摘 要:研究了列车到发时刻不确定条件下的铁路客站咽喉利用优化与股道分配问题.首先,建立了基于不确定列车运行图的咽喉利用与股道分配优化模型,模型考虑股道占用时间与均衡使用性,满足列车、咽喉、股道三者的耦合关系.然后分析并统计了不确定列车运行图的列车到、发站时刻的均值与方差,通过函数模拟的形式抽离出列车时刻表.此外,考虑到问题的NP-hard性,设计了基于模拟退火算法的启发式算法.最后,以宝鸡车站一个阶段计划内的咽喉利用与股道分配问题为实例进行了仿真验算.This paper studies the utilization of bottleneck sections and track allocation problems (UBSTAP) for large railway passenger stations under uncertain train arrival/departure at/from stations. First, an integrated model of the UBSTAP for large railway passenger stations under an uncertain scenario is developed. The UBSTAP model considers the occupation times of tracks and their occupation frequencies. In addition, the relationships of train-bottleneck-track are mathe- matically proposed to represent train routes. After processing the average and variance of train ar- rival and departure times for one month's data from Baoji railway station, the train arrival and departure times are mathematically represented by functions. Meanwhile, considering the NP-hardness of the problem, a simulated annealing based heuristic algorithm is developed to solve the UBSTAP model. Finally, a case study of Baoji railway station is carried out to illustrate the effectiveness of the model and the algorithm.
分 类 号:U291.6[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.127.127