Train re-scheduling with genetic algorithms and artificial neural networks for single-track railways

dc.authoridSahin, Ismail/0000-0002-6959-6215
dc.authorscopusid55539064100
dc.authorscopusid58614835300
dc.authorwosidDündar, Selim/AAE-5613-2021
dc.authorwosidSahin, Ismail/B-8997-2016
dc.contributor.authorDundar, Selim
dc.contributor.authorSahin, Ismail
dc.contributor.otherİnşaat Mühendisliği / Civil Engineering
dc.date.accessioned2024-05-25T11:25:15Z
dc.date.available2024-05-25T11:25:15Z
dc.date.issued2013
dc.departmentOkan Universityen_US
dc.department-temp[Dundar, Selim] Okan Univ, Fac Engn & Architecture, Dept Civil Engn, TR-34959 Akfirat Istanbul, Turkey; [Sahin, Ismail] Yildiz Tech Univ, Dept Civil Engn, Transportat Div, TR-34210 Esenler, Turkeyen_US
dc.descriptionSahin, Ismail/0000-0002-6959-6215en_US
dc.description.abstractTrain 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.en_US
dc.description.sponsorshipYildiz Technical University Scientific Projects Coordination Department [26-05-01-01]en_US
dc.description.sponsorshipThe authors would like to thank Turkish State Railways (TCDD) for providing train-graphs used to develop the artificial neural network model. This research was partially supported by Yildiz Technical University Scientific Projects Coordination Department (Project No.: 26-05-01-01). We owe special thanks to the anonymous referees for their valuable comments and suggestions that helped us improve the paper significantly.en_US
dc.identifier.citation90
dc.identifier.doi10.1016/j.trc.2012.11.001
dc.identifier.endpage15en_US
dc.identifier.issn0968-090X
dc.identifier.issn1879-2359
dc.identifier.scopus2-s2.0-84871663732
dc.identifier.scopusqualityQ1
dc.identifier.startpage1en_US
dc.identifier.urihttps://doi.org/10.1016/j.trc.2012.11.001
dc.identifier.urihttps://hdl.handle.net/20.500.14517/864
dc.identifier.volume27en_US
dc.identifier.wosWOS:000315975500001
dc.identifier.wosqualityQ1
dc.institutionauthorDündar, Selim
dc.language.isoen
dc.publisherPergamon-elsevier Science Ltden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTrain re-schedulingen_US
dc.subjectTrain dispatchingen_US
dc.subjectConflict resolutionen_US
dc.subjectGenetic algorithmsen_US
dc.subjectBinary encodingen_US
dc.subjectArtificial neural networksen_US
dc.titleTrain re-scheduling with genetic algorithms and artificial neural networks for single-track railwaysen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublication52fffa12-457c-4662-8e87-9cd26b575049
relation.isAuthorOfPublication.latestForDiscovery52fffa12-457c-4662-8e87-9cd26b575049
relation.isOrgUnitOfPublication43a00f20-ca47-4515-b3a3-db2c86320ff6
relation.isOrgUnitOfPublication.latestForDiscovery43a00f20-ca47-4515-b3a3-db2c86320ff6

Files