Advertisement

Journal of Heuristics

, Volume 3, Issue 1, pp 43–62 | Cite as

Heuristic Techniques for Single Line Train Scheduling

  • A. Higgins
  • E. Kozan
  • L. Ferreira
Article

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.

train scheduling local search tabu search genetic algorithm hybrid algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cai, X. and C.J. Goh. (1994). "A Fast Heuristic for the Train Scheduling Problem." Computers and Operations Research 21, 499–510.Google Scholar
  2. Davis, L. (1987). Genetic Algorithms and Simulated Annealing. Pitman.Google Scholar
  3. Davis, L. (1991). Handbook on Genetic Algorithms. New York: Van Nos-trand Reinhold.Google Scholar
  4. Gendreau, M., A. Hertz, and G. Laporte. (1994). "ATabu Heuristic for theVehicle Routing Problem." Management Science 40, 1276–1290.Google Scholar
  5. Glover, F. (1990). "Tabu Search: A Tutorial." Interfaces 20, 74–79.Google Scholar
  6. Glover, F. (1993). "A Users Guide to Tabu Search." Annals of Operations Research 41, 3–28.Google Scholar
  7. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimisation, and Machine Learning. Addison-Wesley.Google Scholar
  8. Higgins, A. (1996). "Optimisation of Train Schedules to Minimise Transit Time and Maximise Reliability." Ph.D. Thesis at the Queensland University of Technology, Brisbane, Australia.Google Scholar
  9. Higgins, A., E. Kozan, and L. Ferreira. (1996). "Optimal Scheduling of Trains on a Single Line Track." Transportation Research B 30, 147–161.Google Scholar
  10. Jovanovic, D. (1989). "Improving Railroad On-time Performance: Models, Algorithms and Applications." Ph.D. Thesis at Department of Decision Sciences. The Wharton School. University of Pennsylvania.Google Scholar
  11. Kraay, D. (1993). "Learning Methods in Optimisation: With Applications to Railroad Control." Ph.D. Thesis at Decision Sciences Department, The Wharton School, University of Pennsylvania.Google Scholar
  12. Kraay, D., P. Harker, and B. Chen. (1988). "Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution." Working Paper 88-03-03, Decision Sciences Department. The Wharton School. University of Pennsylvania.Google Scholar
  13. Kraay, D., P. Harker, and B. Chen. (1991). "Optimal Pacing of Trains in Freight Railroads." Operations Research 39, 82–99.Google Scholar
  14. Miller, J.A., W.D. Potter, R.V. Gandham, and C.N. Lapena. (1993). "An Evaluation of Local Improvement Operators for Genetic Algorithms." IEEE Transactions on Systems, Man, and Cybernetics 23, 1341–1351.Google Scholar
  15. Mills, R.G., S.E. Perkins, and P.J. Pudney. (1991). "Dynamic Rescheduling of Long Haul Trains for Improved Timekeeping and Energy." Asia-Pacific Journal Operational Research 8, 146–165.Google Scholar
  16. Nordstrom, A. and S. Tufekci. (1994). "A Genetic Algorithm for the Talent Scheduling Problem." Computers and Operations Research 21, 927–940.Google Scholar
  17. Semet, F. and E. Taillard. (1993). "Solving Real Life Vehicle Routing Problems Efficiently Using Tabu Search." Annals of Operations Research 41, 469–488.Google Scholar
  18. Srivastava, B. and W. Chen. (1993). "Part Type Selection Problem in Flexible Manufacturing Systems: Tabu Search Algorithms." Annals of Operations Research 44, 279–297.Google Scholar
  19. Tan, B.T.G. and S.M. Lim. (1996). "Automated Parameter Optimisation for Double Frequency Modulation Synthesis Using the Genetic Annealing Algorithm." Journal of the Audio Engineering Society 44, 3–15.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • A. Higgins
    • 1
  • E. Kozan
    • 1
  • L. Ferreira
    • 2
  1. 1.School of MathematicsQueensland University of TechnologyAustralia
  2. 2.School of Civil EngineeringQueensland University of TechnologyAustralia

Personalised recommendations