A sequencing approach for creating new train timetables
(2008) A sequencing approach for creating new train timetables. OR Spectrum In Press.
Full text available as: |
Abstract
Train scheduling is a complex and time consuming task of vital importance in many countries. To schedule trains more accurately, efficiently and robustly than permitted by current techniques a novel job shop approach is proposed and implemented. Unique characteristics of train scheduling are firstly incorporated into the disjunctive graph representation of the solution. Constructive algorithms that utilise this representation are then developed. Meta-heuristic strategies such as simulated annealing are extended, and a new compound perturbation operator is proposed. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications.
| Item Type: | Journal Article |
|---|---|
| Status: | In Press |
| Keywords: | Job shop scheduling; train timetabling; meta-heuristics |
| Subjects: | 230000 Mathematical Sciences > 230100 Mathematics > 230117 Operations Research |
| ID Code: | 10690 |
| Deposited By: | Burdett, Robert / L |
| Deposited On: | 14 November 2007 |
| Alternative Locations: | http://dx.doi.org/10.1007/s00291-008-0143-6 |
| Copyright Owner: | Copyright 2008 Springer |
| Copyright Statement: | The original publication is available at SpringerLink http://www.springerlink.com |
| Additional Information: | For more information, please refer to the journal's website (see hypertext link) or contact the author. |