|
|||||
|
|
GRASP algorithms for the robust railway network design problem |
|
| Authors: | Bosco García-Archilla Antonio J. Lozano Juan A. Mesa Federico Perea |
| Affiliation: | 1. Department of Applied Mathematics II, Engineering Higher Technical School, Universidad de Sevilla, Camino de los Descubrimientos, s/n, 41092, Seville, Spain 2. Department of Mathematics, Faculty of Experimental Sciences, Universidad de Huelva, Bulevar de las Artes y las Ciencias s/n, 21071, Huelva, Spain 3. Department of Statistics and Operations Research, Universitat Politècnica de València, Camino de Vera s/n, 46021, Valencia, Spain |
| Abstract: | This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |