Heuristic Techniques for Single Line Train Scheduling

Authors:
A. Higgins;E. Kozan;L. Ferreira
Affiliations:
School of Mathematics, Queensland University of Technology, PO Box 2434, QLD 4001, Australia. E-mail: A.Higgins@fsc.qut.edu.au, E.Kozan@fsc.qut.edu.au;School of Mathematics, Queensland University of Technology, PO Box 2434, QLD 4001, Australia. E-mail: A.Higgins@fsc.qut.edu.au, E.Kozan@fsc.qut.edu.au;School of Civil Engineering, Queensland University of Technology, PO Box 2434, QLD 4001, Australia. E-mail: L.Ferreira@qut.edu.au
Venue:
Journal of Heuristics
Year:
1997

Citing 10
Cited 11

Optimal pacing of trains in freight railroads: model formulation and solution

Operations Research
A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Part type selection problem in flexible manufacturing systems: tabu search algorithms

Annals of Operations Research - Special issue on Tabu search
Solving real-life vehicle routing problems efficiently using tabu search

Annals of Operations Research - Special issue on Tabu search
A fast heuristic for the train scheduling problem

Computers and Operations Research
A genetic algorithm for the talent scheduling problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Simulated Annealing

Genetic Algorithms and Simulated Annealing
Improving railroad on-time performance: models, algorithms and applications

Improving railroad on-time performance: models, algorithms and applications

A Lagrangian heuristic algorithm for a real-world train timetabling problem

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Scheduling trains as a blocking parallel-machine job shop scheduling problem

Computers and Operations Research
Train timetable problem on a single-line railway with fuzzy passenger demand

IEEE Transactions on Fuzzy Systems
A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes

International Journal of Data Analysis Techniques and Strategies
A Lagrangian heuristic algorithm for a real-world train timetabling problem

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Intelligent timetable evaluation using fuzzy AHP

Expert Systems with Applications: An International Journal
Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model

Transportation Science
Railway track allocation: models and methods

OR Spectrum
A set packing inspired method for real-time junction train routing

Computers and Operations Research
SIMARAIL: simulation based optimization software for scheduling railway network

Proceedings of the Winter Simulation Conference
Single line train scheduling with ACO

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimising a train schedule on a single line track is known to beNP-Hard with respect to the number of conflicts in the schedule. Thismakes it difficult to determine optimum solutions to real lifeproblems in reasonable time and raises the need for good heuristictechniques. The heuristics applied and compared in this paper are alocal search heuristic with an improved neighbourhood structure,genetic algorithms, tabu search and two hybrid algorithms. When notime constraints are enforced on solution time, the genetic andhybrid algorithms were within five percent of the optimal solutionfor at least ninety percent of the test problems.