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

Hernando, A.; Roanes–Lozano, Eugenio; García–Álvarez, Alberto

doi:10.1016/j.amc.2017.05.043

Cited by 2 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…introdata(nodo (12,13), "Huesca_i", no do (12,14), "Canfranc", 135, 120): introdata(nodo (7,4), "Linares", nodo ( introdata(nodo(6, 5), "C.Real_i", nodo (5,5), "Puertollano_i", 39, 140): introdata(nodo (7,5), "Manzanares", no do (7,4), "Linares", 42+67+9, (42+67+ 9)/(42 * (1/160)+67/130+9/160)): introdata(nodo (7,5), "Manzanares", nodo (7,6), "Alcázar de San juan", 49, 160): introdata(nodo(7, 7), "Castillejo A. ", no do (7,6), "Alcázar de San juan", 84, 160): introdata(nodo(7, 7), "Castillejo A.…”

Section: Discussionmentioning

confidence: 99%

“…Utrera", nodo (3,2), "Sevilla_i", 15, 160): introdata(nodo(3, 1), "Bif. Utrera", nodo (5, 1), "Fuente Piedra", 70+41, (70+41)/ (70 * (1/160)+41/115)): introdata(nodo(5, 3), "Córdoba_i", nodo (5, 1), "Fuente Piedra", 118, 155): introdata(nodo (7,4), "Linares", nodo (7,2), "Moreda", 117, 140): introdata(nodo(6, 1), "Granada_i", nodo (7,2), "Moreda", 57, 140): introdata(nodo(6, 1), "Granada_i", nodo(5, 0), "Bobadilla", 127, 155): introdata(nodo(5, 1), "Fuente Piedra", nodo(5, 0), "Bobadilla", 11, 120): introdata(nodo (7,8), "Aranjuez", nodo (11, 8), "Cuenca_i", 152, 120): introdata(nodo(11, 8), "Cuenca_i", nodo (13,6), "Valencia_i", 199, 120): introdata(nodo (12,6), "Játiva", nodo (13,6), "Valencia_i", 64, 160): introdata(nodo (12,6), "Játiva", nodo (12,5), "La Encina", 48, 220): introdata(nodo(10, 5), "Chinchilla", no do (12,5), "La Encina", 70, 160): introdata(nodo(10, 5), "Chinchilla", no do(10, 6), "Albacete_i", 20, 160): introdata(nodo (7,6), "Alcázar de San Juan", nodo(10, 6), "Albacete_i", 131, 200): introdata(nodo (12,4), "Alicante", nodo (12,5), "La Encina", 79, 160): introdata(nodo (12,4), "Alicante", nodo (12,3), "El Reguerón", 68, 160): introdata(nodo(11, 3), "Murcia", nodo (12,3), "El Reguerón", 10, 160): introdata(nodo(11, 3), "Murcia", nodo (10,5), "Chinchilla", 157, 160): introdata(nodo(3, 2), "Sevilla_i", nodo (1, 1), "Huelva", 108, 140): introdata(nodo(1, 1), "Huelva", nodo…”

Section: Discussionunclassified

“…introdata(nodo (9,14), "San Sebastián", nodo (8,14), "Altsazu", 87, 135): introdata(nodo (9,14), "San Sebastián", nodo (10,14), "Irún", 17, 135): introdata(nodo (3,9), "Salamanca", nodo (4,9), "Avila", 111, 155): introdata(nodo (3,9), "Salamanca", nodo (3,10), "Medina del Campo_i", 77, 155):…”

Section: Discussionunclassified

“…Albace te_s", t+nodo(11, 7), "Requena_s", 79, 300): introdata(t+nodo(11, 7), "Requena_s", t+nodo (13,6), "Valencia_s", 70, 300): introdata(t+nodo (6,8), "Madrid At_s", t+nodo (7,9), "Guadalajara_s", 64, 300): introdata(t+nodo(9, 10), "Calatayud_s", t+nodo (7,9), "Guadalajara_s", 157, 300): introdata(t+nodo(9, 10), "Calatayud_s", t+nodo(11, 11), "Zaragoza_s", 86, 300): introdata(t+nodo (14,12), "Lérida_s", t+nodo(11, 11), "Zaragoza_s", 141, 300): introdata(t+nodo (14,12), "Lérida_s", t+nodo (15,10), "Tarragona_s", 81, 300): introdata(t+nodo (17,11), "Barcelona_s", t+nodo(15, 10), "Tarragona_s", 100, 300): introdata(t+nodo (17,11), "Barcelona_s", t+nodo (18,12), "Gerona_s", 94, 255): introdata(t+nodo (18,13), "Figueras_s", t+nodo (18,12), "Gerona_s", 34, 290): introdata(t+nodo (12,12), "Tardienta_s", t+nodo(11, 11), "Zaragoza_s", 86, 300): introdata(t+nodo(5, 1), "Antequera_s", t+nodo(6, 1), "Granada_s", 86, 300): introdata(t+nodo (5,9), "Segovia_s", t+nodo (6,9), "Madrid Ch_s", 67, 300): introdata(t+nodo (5,9), "Segovia_s", t+nodo (4,9), "Bif. Medina_s", 66, 300): introdata(t+nodo(4, 10), "Valladolid_s", t+nodo (4,9), "Bif. Medina_s", 45, 300): introdata(t+nodo(4, 10), "Valladolid_s", t+nodo(4, 12), "Palencia_s", 51, 300): introdata(t+nodo (3,12), "León_s", t+ nodo(4, 12), "Palencia_s", 115,...…”

Section: Discussionunclassified

“…As expected, three graphs are initially considered (and must be given as input). As usual, but unlike RutasOptiRed [1,2,4], the vertices of the graphs represent the stations and the edges of the graphs correspond to the sections of the railway network. ese graphs are as follows:…”

Section: E New Approach: Notation and Initial (Given) Graphsmentioning

confidence: 99%

See 4 more Smart Citations

A New Approach to Shortest Route Finding in a Railway Network with Two Track Gauges and Gauge Changeovers

Almech

Roanes–Lozano

Macías

et al. 2019

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The Spanish railway network is a complex one, due to the existence of standard gauge (1,435 mm), Iberian gauge (1,668 mm), and dual gauge (with three rails) subnetworks, as well as connections between the two first subnetworks (at the so-called gauge changeovers), usable by dual gauge trains. Two of the authors developed a package for shortest route finding, and consumes, costs, and emissions calculations in the Spanish railway network (within the frame of two research projects funded by the Fundación de los Ferrocarriles Españoles–Spanish Railways Foundation). Nevertheless, the approach required from a curious specific algorithm to be developed ad hoc. In this paper, a much simpler approach to shortest route finding in such a network, which merges the three subnetworks into two and considers the gauge changeovers as connections between the two new subnetworks, is detailed. This approach allows to use any standard shortest route algorithm. It has been implemented in the computer algebra system Maple and is applied in this paper both to small specific cases and to the whole Spanish railway network.

show abstract