 A recommender system for train routing: When concatenating two minimum length paths is not the minimum length pathAntonio Hernando, Eugenio Roanes-Lozano and Alberto Garcia-Álvarez Applied Mathematics and Computation, 2018, vol. 319, issue C, 486-498 Abstract: In this paper, we propose a method for finding the optimal route for a specific train from a station to another one in the Spanish railway network (or any railway network involving different incompatible features like gauges, electrification and signaling systems). The complexity of the Spanish railway infrastructure makes it difficult to give an estimation of the fastest route of a train from a given station to another. Indeed, very unintuitive situations may happen. The problem of finding fastest routes is typically modeled by a graph where nodes represent stations and edges represent railway sections. However, this approach is not suitable for the Spanish railway network. In order to solve the problem of calculating the fastest routes, we will propose here a novel approach based on modeling the railway network through a different graph whose nodes represent railway sections. Keywords: Railway routing optimization; Graph theory; Dijkstra algorithm; Railway network; Track gauge; Variable gauge train (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:319:y:2018:i:c:p:486-498 DOI: 10.1016/j.amc.2017.05.043 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.