| 树枝型专用线取送车问题的哈密尔顿图解法 |
| |
| 引用本文： | 石红国,彭其渊,郭寒英. 树枝型专用线取送车问题的哈密尔顿图解法[J]. 中国铁道科学, 2005, 26(2): 132-135 |
| |
| 作者姓名： | 石红国 彭其渊 郭寒英 |
| |
| 作者单位： | 西南交通大学,交通运输学院,四川,成都,610031 |
| |
| 摘 要： | 运用图论中的哈密尔顿图,可以将树枝型专用线取送车问题,转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。以6个节点的树枝型专用线为例,将其转化为哈密尔顿图,运用近似计算法,求得最小哈密尔顿回路8个,每一个回路对应2个机车走行方案。对于有较多节点的树枝型专用线,运用计算机进行计算,可以得到全部最优解。
|
| 关 键 词： | 编组站 树枝型专用线 调机运用 取送车 哈密尔顿图 近似计算法 |
| 文章编号： | 1001-4632(2005)02-0132-04 |
| 修稿时间： | 2004-01-06 |
An Algorithm by Using Hamilton Graph to Resolve Wagons'''' Placing-in and Taking-out on Branch-shaped Sidings |
| |
| SHI Hong-guo,PENG Qi-yuan,GUO Han-ying. An Algorithm by Using Hamilton Graph to Resolve Wagons'''' Placing-in and Taking-out on Branch-shaped Sidings[J]. China Railway Science, 2005, 26(2): 132-135 |
| |
| Authors: | SHI Hong-guo PENG Qi-yuan GUO Han-ying |
| |
| Abstract: | By using Hamilton graph, the problem of wagons' placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power. With an example of 6 nodes branch-shaped sidings, the author turns it into one Hamilton graph, and works out at 8 Hamilton loops (each loop represents 2 locomotive running schemes) by using approximate algorithm. For branch-shaped sidings with more nodes, computer is employed to solve the problem and the complete optimum solution can be obtained. |
| |
| Keywords: | Marshalling station Branch-shaped sidings Shunting locomotive Placing-in and taking-out of wagons Hamilton graph Approximate algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
