Abstract:

Train formation plan of technical stations is one of key issues for railway transportation schedule. The most popular algorithm is 0~1 program involving train flow recursion relation of train formation destination among the present domestic research on single train formation plan. The essential of such research is to optimize the first arrival station of wagon flows. We therefore devise a real number coded tabu search algorithm that can be applied to solving train formation plan of railway network. Computational cases indicate that it can rapidly and effectively solve formation plan of single-group train at technical service stations. Compared with LINGO software, it can find global optimum solution with only less time.

Key words: technical through train, tabu search algorithm, formation plan')">formation plan, 0~1 program