A New Approach to Shortest Route Finding in a Railway Network with Two Track Gauges and Gauge Changeovers
| Autor: | ANTONIO HERNANDO GRANDE, Alberto Almech, ANTONIO HERNANDO ESTEBAN, Carmen Solano-Macías, Eugenio Roanes-Lozano |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Mathematical optimization
Article Subject Computer science lcsh:Mathematics General Mathematics 05 social sciences Frame (networking) General Engineering 050301 education lcsh:QA1-939 Track (rail transport) 01 natural sciences 010305 fluids & plasmas Dual (category theory) Route finding lcsh:TA1-2040 Gauge (instrument) 0103 physical sciences lcsh:Engineering (General). Civil engineering (General) 0503 education |
| Zdroj: | Mathematical Problems in Engineering, Vol 2019 (2019) |
| ISSN: | 1024-123X |
| DOI: | 10.1155/2019/8146150 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text