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

摘要： 放射形专用线非直达车流取送方案的选择是一个非常复杂的组合优化问题，当作业的专用线数为n时，取送方案数达到(n!)2，采用经典算法求解用时太长. 为了提高非直达车流取送方案的计算效率，将禁忌搜索算法同时用于送车方案和取车方案的求解过程. 对禁忌搜索算法的主要因素进行了设计，通过两组实例仿真，验证了禁忌搜索算法用于求解非直达车流取送方案的有效性. 仿真结果表明，专用线数越多，计算时间越长；在专用线数一定的条件下，最优方案的等值方案数越少，搜索范围就越大，计算用时也越长. 专用线不超过8条时，计算用时不超过3 s，计算效率满足了现场生产需要.

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