Heuristic techniques for train scheduling
(1997) Heuristic techniques for train scheduling. Journal of Heuristics 3(1):pp. 43-62.
Full text available as: |
Abstract
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.
| Item Type: | Journal Article |
|---|---|
| Status: | Published |
| Keywords: | Train Scheduling, Local Search, Tabu Search, Genetic Algorithm, Hybrid Algorithm |
| Subjects: | 350000 Commerce, Management, Tourism and Services > 350400 Transportation > 350405 Road and Rail Transportation |
| ID Code: | 3794 |
| Deposited By: | Sirikijpanichkul, A |
| Deposited On: | 31 March 2006 |
| Alternative Locations: | http://dx.doi.org/10.1023/A:1009672832658 |
| Copyright Owner: | Copyright 1997 Springer |
| Copyright Statement: | The original publication is available at SpringerLink http://www.springerlink.com |