Train Formation Plan And The Simulated Annealing Algorithm

This paper mostly works over the model and its solution of Train Formation Plan problem in the railway network. The aim of Train Formation Plan is to solve the vehicle flow of marshalling station and change trains .So go to the destination rapidly, in the way of minimization collecting index of every vehicle flow. Because the Train Formation Plan belongs to super-scale combination optimization problem, also is NP-hard problem. Experts and scholar research, discuss this problem with diversified method in this year. Specially, this work makes out breakthrough in lately years, because operation research and technology of computer apply to this domain. One of mostly works of this paper is serious analyze and contrast the model of Train Formation Plan. Finally choose one of this model, its modeling is very crafty, and solve this model with simulated annealing. Although the simulated annealing can obtain global minimum in theory, but there still is many theoretic and actual problem can be embedded discuss.