DocumentCode
2609960
Title
Study on plan of track lines in marshalling station
Author
Wang, Shidong ; Zheng, Li ; Zhang, Zhihai
Author_Institution
Tsinghua Univ., Beijing
fYear
2007
fDate
2-4 Dec. 2007
Firstpage
852
Lastpage
856
Abstract
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.
Keywords
computational complexity; genetic algorithms; rail traffic; railways; NP-complete problem; genetic algorithm; heuristic algorithm; marshalling station; mathematical model analysis; multitrack schedule problem; polynomial algorithm; track lines; train station; weighted clique problem; Algorithm design and analysis; Bismuth; Genetic algorithms; Greedy algorithms; Industrial engineering; Job shop scheduling; Mathematical model; Polynomials; Rail transportation; Scheduling algorithm; Track Lines; genetic algorithm; greedy algorithm; maximum weighted clique;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management, 2007 IEEE International Conference on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1529-8
Electronic_ISBN
978-1-4244-1529-8
Type
conf
DOI
10.1109/IEEM.2007.4419311
Filename
4419311
Link To Document