Dundar, SelimSahin, Ismailİnşaat Mühendisliği / Civil Engineering2024-05-252024-05-252013900968-090X1879-235910.1016/j.trc.2012.11.0012-s2.0-84871663732https://doi.org/10.1016/j.trc.2012.11.001https://hdl.handle.net/20.500.14517/864Sahin, Ismail/0000-0002-6959-6215Train re-scheduling problems are popular among researchers who have interest in the railway planning and operations fields. Deviations from normal operation may cause inter-train conflicts which have to be detected and timely resolved. Except for very few applications, these tasks are usually performed by train dispatchers. Due to the complexity of re-scheduling problems, dispatchers utilize some simplifying rules to resolve conflicts and implement their decisions accordingly. From the system effectiveness and efficiency point of view, their decisions should be supported with appropriate tools because their immediate decisions may cause considerable train delays in future interferences. Such a decision support tool should be able to predict overall implications of the alternative solutions. Genetic algorithms (GAs) for conflict resolutions were developed and evaluated against the dispatchers' and the exact solutions. The comparison measures are the computation time and total (weighted) delay due to conflict resolutions. For benchmarking purposes, artificial neural networks (ANNs) were developed to mimic the decision behavior of train dispatchers so as to reproduce their conflict resolutions. The ANN was trained and tested with data extracted from conflict resolutions in actual train operations in Turkish State Railways. The GA developed was able to find the optimal solutions for small sized problems in short times, and to reduce total delay times by around half in comparison to the ANN (i.e., train dispatchers). (C) 2012 Elsevier Ltd. All rights reserved.eninfo:eu-repo/semantics/closedAccessTrain re-schedulingTrain dispatchingConflict resolutionGenetic algorithmsBinary encodingArtificial neural networksArticleQ1Q127115WOS:000315975500001