DocumentCode :
1628867
Title :
Rail network routing and scheduling using simulated annealing
Author :
Brown, Donald E. ; Huntley, Christopher L. ; Markowicz, Bernard P. ; Sappington, David E.
Author_Institution :
Sch. of Eng. & Appl. Sci., Virginia Univ., Charlottesville, VA, USA
fYear :
1992
Firstpage :
589
Abstract :
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
Keywords :
genetic algorithms; rail traffic; scheduling; simulated annealing; freight rail network; genetic algorithm; simulated annealing; traffic routing; traffic scheduling; Cities and towns; Computational modeling; Concurrent computing; Encoding; Genetic algorithms; Processor scheduling; Rails; Routing; Scheduling algorithm; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 1992., IEEE International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-0720-8
Type :
conf
DOI :
10.1109/ICSMC.1992.271709
Filename :
271709
Link To Document :
بازگشت