|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年12 期
| 标题 |
| 基于运行线匹配的区段站直通列车接续问题及算法研究(31 卷) |
| 英文标题 |
| Research on through Train Linkage Problem in Sectional Station Based on Running Line Match and Its Algorithm |
| 摘要 |
| 根据铺画的货物列车运行线和直通列车在区段站作业时间标准，为选择区段站直通列车到达和出发运行线，以直通列车在站总停留时间最少为目标，建立数学模型，通过虚设源和汇，将该模型转化为网络流，利用C++语言程序设计最小费用流算法求解。以南宫山站为例验证表明，该算法能有 |
| 作者 |
| 新闻作者:郭倩倩1，谢 卫2，张小炳1，孟润虎 |
| 关键字 |
