The plan of track lines is an important factor which influences the efficiency of marshaling station. When a train reaches the station, schedulers need to decide which track will be occupied by train and how long the train will stay at the track. The problem is NP-complete when the number of track and train are unfixed. After the mathematical model is analyzed, the schedule of single track can be transformed into a weighted clique problem, and a polynomial algorithm is designed. For solving the schedule problem of multi-track, two heuristic algorithms are introduced, and genetic algorithm is also adopted. Moreover, some benchmarks which data are generated randomly are used to validate the rational efficiency and computation burden of foregoing algorithms.
展开▼
