关键词: 铁路运输, 专用线取送调车, 禁忌搜索算法, 非直达车流

Abstract: The optimal vehicle fetching and delivering schemes of non-through vehicle flows for the actiniform dedicated lines is a complex combined optimization problem. When the number of the lines is noted by n, the number of the schemes reaches (n!)2. The traditional algorithm is time-consuming to solve the problem. To increase the calculating efficiency, the taboo searching algorithm is applied to the process both solving the delivering scheme and the fetching scheme. The main factors of the taboo searching algorithm are designed, and by the instance simulation for two cases, the effectiveness for the algorithm to solve the fetching and delivering scheme is verified. The simulation results show that the more the number of the dedicated lines, the longer the calculating time is; In the condition that the number of the dedicated line is given, the smaller the number of the schemes equivalent to the optimal scheme, the bigger the searching range will be and the longer the time needed for calculation will be. If the number of the dedicated lines does not exceed 8, the time needed for calculating the schemes does not exceed 3 s which meets the requirement of railway production practice.

Key words: railway transportation, fetching and delivering scheme, taboo search algorithm, non-through wagon flow