DocumentCode
3503458
Title
Train-set turnover optimization model and algorithm based on SA considering workload balance among maintenance bases
Author
Zhao, Peng ; Guo, Haiyan ; Ding, Jiebing
Author_Institution
Sch. of Traffic & Transp., Beijing Jiaotong Univ., Beijing
Volume
2
fYear
2008
fDate
12-15 Oct. 2008
Firstpage
1783
Lastpage
1787
Abstract
Maintenance arrangement is a key factor in the quality of the train-set turnover plan making. It requires considering workload balance among all the maintenance bases. Therefore in this paper maintenance workload is transformed into a special kind of train, whose beginning and ending stations are the same, and constitute a train-set turnover network by regarding the train as dot, the linkage as border, and the linkage time as the weight of border. The train-set turnover linkage problem now becomes a unique TSP problem on the network. An optimization algorithm is developed based on SA and the effectiveness of the model and the algorithm is verified through an applied case study on the Beijing-Tianjin Line.
Keywords
maintenance engineering; railways; scheduling; simulated annealing; travelling salesman problems; TSP problem; maintenance arrangement; maintenance bases; optimization algorithm; train-set turnover optimization model; workload balance; SA; TSP; high-speed railway; train-set scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2012-4
Electronic_ISBN
978-1-4244-2013-1
Type
conf
DOI
10.1109/SOLI.2008.4682819
Filename
4682819
Link To Document