Heuristic techniques for train scheduling
Optimising a train schedule on a single line track is known to be NP-Hard with respect to the number of conflicts in the schedule. This makes it difficult to determine optimum solutions to real life problems in reasonable time and raises the need for good heuristic techniques. The heuristics applied and compared in this paper are a local search heuristic with an improved neighbourhood structure, genetic algorithms, tabu search and two hybrid algorithms. When no time constraints are enforced on solution time, the genetic and hybrid algorithms were within five percent of the optimal solution for at least ninety percent of the test problems.
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Train Scheduling, Local Search, Tabu Search, Genetic Algorithm, Hybrid Algorithm|
|Subjects:||Australian and New Zealand Standard Research Classification > COMMERCE MANAGEMENT TOURISM AND SERVICES (150000) > TRANSPORTATION AND FREIGHT SERVICES (150700) > Rail Transportation and Freight Services (150702)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Built Environment and Engineering|
|Copyright Owner:||Copyright 1997 Springer|
|Copyright Statement:||The original publication is available at SpringerLink http://www.springerlink.com|
|Deposited On:||31 Mar 2006|
|Last Modified:||01 Sep 2010 22:39|
Repository Staff Only: item control page