| 求解编组站静态配流问题的一种改进算法 |
| |
| 引用本文： | 郭寒英,石红国. 求解编组站静态配流问题的一种改进算法[J]. 铁道运输与经济, 2004, 26(5): 74-76 |
| |
| 作者姓名： | 郭寒英 石红国 |
| |
| 作者单位： | 西南交通大学,交通运输学院,四川,成都,610031 |
| |
| 摘 要： | 铁路编组站在解编列车作业前,必须预先确定出发列车的编组内容和车流来源,即进行编组站配流。可将此类问题转化为运输问题的目标函数,用最小元素法的表上作业法对其进行求解,但需经过5次迭代,现采用沃格尔法求解此类问题可以减少求最优解的迭代步骤,并可求得最优方案。
|
| 关 键 词： | 编组站 配流问题 沃格尔法 最小元素法 最优方案 |
| 文章编号： | 1003-1421(2004)05-0074-02 |
| 修稿时间： | 2003-12-01 |
An Ameliorated Algorithm to Resolve the Static Wagon-flow Allocation in Marshalling Station |
| |
| GUO Han-ying,SHI Hong-guo. An Ameliorated Algorithm to Resolve the Static Wagon-flow Allocation in Marshalling Station[J]. Rail Way Transport and Economy, 2004, 26(5): 74-76 |
| |
| Authors: | GUO Han-ying SHI Hong-guo |
| |
| Abstract: | In railway marshalling station, the composition of a dispatched trainas well as its sourcing wagons shall be finalized before breaking up a train, i.e.to allocate wagon-flow in marshalling station. This operation can be transformedinto an objective function of transport subject, so it can be solved using on-table calculating method of Minimum Element Method. However, this calculationtakes up to 5 iterations. Now the Vogel is employed to solve such problemswith optimized plan and with reduced iteration. |
| |
| Keywords: | marshalling station allocation of wagon-flow the Vogel MinimumElement Method optimized plan |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
