|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年12 期
| 標題 |
| 基于運行線匹配的區(qū)段站直通列車接續(xù)問題及算法研究(31 卷) |
| 英文標題 |
| Research on through Train Linkage Problem in Sectional Station Based on Running Line Match and Its Algorithm |
| 摘要 |
| 根據(jù)鋪畫的貨物列車運行線和直通列車在區(qū)段站作業(yè)時間標準，為選擇區(qū)段站直通列車到達和出發(fā)運行線，以直通列車在站總停留時間最少為目標，建立數(shù)學模型，通過虛設源和匯，將該模型轉(zhuǎn)化為網(wǎng)絡流，利用C++語言程序設計最小費用流算法求解。以南宮山站為例驗證表明，該算法能有 |
| 作者 |
| 新聞作者:郭倩倩1，謝 衛(wèi)2，張小炳1，孟潤虎 |
| 關鍵字 |
