关键词: 放射形专用线, 非直达车流, 取送顺序, 禁忌搜索算法

Abstract:

The problem of taking out and placing in of non-through vehicle flows on radial private lines is a complex combinatorial optimization problem.An optimal order is in favor of reducing vehicles non-productivity time at the station and accelerating vehicles turnaround to the greatest extent.According to the characteristics of non-through vehicle flows,the production of initial solution is optimized with the simplified and shortest resident time at station seen as the fitness function.The orders of taking out and placing in are regarded as a whole scheme,and the tabu search algorithm (TS) is designed.Computation results of an example illustrate that this algorithm finds satisfactory solution to the above mentioned problem.

Key words: radial private Lines;non-through vehicle flows;taking out and placing in orders;TS