Rail network routing and scheduling using simulated annealing

The authors present both simulated annealing and genetic algorithm approaches to routing and scheduling traffic over a freight rail network. They provide a brief overview to the rail routing and scheduling problem that formed the basis for the case study. Both algorithms were tested. These two approaches are contrasted and the conclusion is that for this application, simulated annealing is superior.<
>