A recommender system for train routing: When concatenating two minimum length paths is not the minimum length path
| Autor: | Alberto García-Álvarez, Antonio Hernando, Eugenio Roanes-Lozano |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
InformationSystems_INFORMATIONSYSTEMSAPPLICATIONS Applied Mathematics Distributed computing 05 social sciences 050301 education ComputerApplications_COMPUTERSINOTHERSYSTEMS Graph theory 010103 numerical & computational mathematics Recommender system 01 natural sciences Computational Mathematics Electrification Path (graph theory) Graph (abstract data type) 0101 mathematics Routing (electronic design automation) 0503 education Dijkstra's algorithm Track gauge |
| Zdroj: | Applied Mathematics and Computation. 319:486-498 |
| ISSN: | 0096-3003 |
| DOI: | 10.1016/j.amc.2017.05.043 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect