A sequencing approach for creating new train timetables
Data(s) |
2010
|
---|---|
Resumo |
Train scheduling is a complex and time consuming task of vital importance. To schedule trains more accurately and efficiently than permitted by current techniques a novel hybrid job shop approach has been proposed and implemented. Unique characteristics of train scheduling are first incorporated into a disjunctive graph model of train operations. A constructive algorithm that utilises this model is then developed. The constructive algorithm is a general procedure that constructs a schedule using insertion, backtracking and dynamic route selection mechanisms. It provides a significant search capability and is valid for any objective criteria. Simulated Annealing and Local Search meta-heuristic improvement algorithms are also adapted and extended. An important feature of these approaches is a new compound perturbation operator that consists of many unitary moves that allows trains to be shifted feasibly and more easily within the solution. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer Verlag |
Relação |
http://eprints.qut.edu.au/29827/1/OR_Spectrum__A_sequencing_approach_for_creating_new_train_timetables.pdf DOI:10.1007/s00291-008-0143-6 Burdett, Robert L. & Kozan, Erhan (2010) A sequencing approach for creating new train timetables. OR Spectrum, 32(1), pp. 163-193. |
Direitos |
Copyright 2010 Springer |
Fonte |
Faculty of Science and Technology; Mathematical Sciences |
Palavras-Chave | #010206 Operations Research #Job shop #Scheduling #Train taimtabling #Meta-heuristics |
Tipo |
Journal Article |