Techniques for inserting additional trains into existing timetables

Burdett, Robert L. & Kozan, Erhan (2009) Techniques for inserting additional trains into existing timetables. Transportation Research Part B : Methodological, 43(8-9), pp. 821-836.

View at publisher


In this paper techniques for scheduling additional train services (SATS) are considered as is train scheduling involving general time window constraints, fixed operations, maintenance activities and periods of section unavailability. The SATS problem is important because additional services must often be given access to the railway and subsequently integrated into current timetables. The SATS problem therefore considers the competition for railway infrastructure between new services and existing services belonging to the same or different operators. The SATS problem is characterised as a hybrid job shop scheduling problem with time window constraints. To solve this problem constructive algorithm and metaheuristic scheduling techniques that operate upon a disjunctive graph model of train operations are utilised. From numerical investigations the proposed framework and associated techniques are tested and shown to be effective.

Impact and interest:

27 citations in Scopus
Search Google Scholar™
25 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

140 since deposited on 19 Jan 2010
13 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 29826
Item Type: Journal Article
Refereed: Yes
Additional URLs:
Keywords: Train scheduling, Job shop, Time windows, Meta-heuristics
DOI: 10.1016/j.trb.2009.02.005
ISSN: 0191-2615
Subjects: Australian and New Zealand Standard Research Classification > MATHEMATICAL SCIENCES (010000) > APPLIED MATHEMATICS (010200) > Operations Research (010206)
Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Schools > Mathematical Sciences
Copyright Owner: Copyright 2009 Elsevier
Deposited On: 19 Jan 2010 22:43
Last Modified: 01 Mar 2012 03:40

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page