IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v319y2018icp486-498.html
   My bibliography  Save this article

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

Author

Listed:
  • Hernando, Antonio
  • Roanes-Lozano, Eugenio
  • Garcia-Álvarez, Alberto

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.

Suggested Citation

  • Hernando, Antonio & Roanes-Lozano, Eugenio & Garcia-Álvarez, Alberto, 2018. "A recommender system for train routing: When concatenating two minimum length paths is not the minimum length path," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 486-498.
    • Handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:486-498
    DOI: 10.1016/j.amc.2017.05.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317303442
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.05.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Galán-García, José L. & Aguilera-Venegas, Gabriel & Galán-García, María Á. & Rodríguez-Cielos, Pedro, 2015. "A new Probabilistic Extension of Dijkstra’s Algorithm to simulate more realistic traffic flow in a smart city," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 780-789.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yi, Tao & Cheng, Xiaobin & Peng, Peng, 2022. "Two-stage optimal allocation of charging stations based on spatiotemporal complementarity and demand response: A framework based on MCS and DBPSO," Energy, Elsevier, vol. 239(PC).
    2. Yanfei Zhu & Yingjie Tan & Yongfa Chen & Liudan Chen & Kwang Y. Lee, 2024. "UAV Path Planning Based on Random Obstacle Training and Linear Soft Update of DRL in Dense Urban Environment," Energies, MDPI, vol. 17(11), pages 1-19, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:486-498. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.