基于图染色的铁路调车场调车问题研究  

Research on Railway Shunting Problem Based on Graph Coloring

作　　者：任怡林 王龙 梁东岳 张淑蓉 杨卫华 

机构地区：[1]太原理工大学数学学院,山西 晋中

出　　处：《应用数学进展》2021年第2期402-415,共14页Advances in Applied Mathematics

摘　　要：本文主要研究铁路调车场调车问题。与已有研究相比,本文同时考虑了调车场的股道数量限制与股道容量限制,更加符合实际情况。首先,我们将带股道数量限制与股道容量限制的调车场调车问题转化为一种特殊的图染色问题。接着,为该问题设计了一种贪婪算法,并通过数值实验说明该算法适合于实际应用。This paper mainly studies the shunting problem of railway shunting yard. Compared with the existing research, this paper considers both the number limit and the capacity limit of the shearing yard, which is more in line with the actual situation. Firstly, we transform the shunting problem of the shunting yard with the limitation of the number of channels and the limitation of the capacity of channels into a special pattern dyeing problem. Then, a greedy algorithm is designed for this problem, and the numerical experiment shows that the algorithm is suitable for practical application.

关 键 词：调车场 调车 图染色 贪婪算法 

分 类 号：U29[交通运输工程—交通运输规划与管理]