A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path

DOI10.1016/j.amc.2017.05.043zbMath1426.90045OpenAlexW2619694499MaRDI QIDQ2422936

Alberto Garcia-Álvarez, Antonio Hernando, Eugenio Roanes-Lozano

Publication date: 21 June 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.05.043

zbMATH Keywords

graph theoryDijkstra algorithmrailway networkrailway routing optimizationtrack gaugevariable gauge train

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Uses Software

• Algorithm 97
• RutasOptiRed
• ATISMART

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city
• The directed subgraph homeomorphism problem
• Integration of DEA and AHP with computer simulation for railway system improvement and optimization
• Dijkstra's algorithm on-line