期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimization and Algorithm for Through Train Connections at District Stations
1
作者 郭倩倩 陈宜军 毛介英 《Journal of Southwest Jiaotong University(English Edition)》 2010年第3期220-224,共5页
In the optimization of train diagrams, selecting the arrival and departure paths of the through gains has a great impact on the dwell time at district stations. In this paper, on the basis of train paths and the throu... In the optimization of train diagrams, selecting the arrival and departure paths of the through gains has a great impact on the dwell time at district stations. In this paper, on the basis of train paths and the through train connection time standard at district stations, we built a mathematical model aiming at minimizing dwell time of through trains at two adjacent district stations, and then converted this into a network flow model to which is added a source and a sink node. Then, we propose a new algorithm for solving the network flow model based on the minimum-cost flow algorithm. A case study for through trains from the Guiyang South Railway Station to the Chongqing West Railway Station shows that the algorithm is reliable and efficient for solving the problem of through train connections, and there is a reduction in the total dwell time that the through trains spend at two adjacent district stations. 展开更多
关键词 Train diagrams Through train connections minimum-cost flow algorithm District stations
在线阅读 下载PDF
基于最小费用最大流算法的冲突车流分配 被引量:1
2
作者 李运 潘应久 侯礼兴 《山东交通学院学报》 CAS 2015年第2期25-30,共6页
从最短路径角度研究交通分配问题,利用Dijkstra算法求解最短路径,根据道路容量和运行时间的限制,得出非冲突车流的优化路径,在此基础上假设冲突发生,采用设置优先通行规则与最小费用最大流算法相结合,实现有交通冲突情况下的交通流分配。
关键词 冲突车流 交通分配 最小费用最大流算法 MATLAB
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部